An improved firefly algorithm for solving dynamic multidimensional knapsack problems

作者：Baykasoglu Adil^*; Ozsoydan Fehmi Burcin

来源：Expert Systems with Applications, 2014, 41(8): 3712-3725.

DOI：10.1016/j.eswa.2013.11.040

• Firefly algorithm
• Genetic algorithm
• Differential evolution
• Dynamic optimization
• Multidimensional knapsack problem

There is a wide range of publications reported in the literature, considering optimization problems where the entire problem related data remains stationary throughout optimization. However, most of the real-life problems have indeed a dynamic nature arising from the uncertainty of future events. Optimization in dynamic environments is a relatively new and hot research area and has attracted notable attention of the researchers in the past decade. Firefly Algorithm (FA), Genetic Algorithm (GA) and Differential Evolution (DE) have been widely used for static optimization problems, but the applications of those algorithms in dynamic environments are relatively lacking. In the present study, an effective FA introducing diversity with partial random restarts and with an adaptive move procedure is developed and proposed for solving dynamic multidimensional knapsack problems. To the best of our knowledge this paper constitutes the first study on the performance of FA on a dynamic combinatorial problem. In order to evaluate the performance of the proposed algorithm the same problem is also modeled and solved by GA, DE and original FA. Based on the computational results and convergence capabilities we concluded that improved FA is a very powerful algorithm for solving the multidimensional knapsack problems for both static and dynamic environments.

• 出版日期2014-6-15