Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 264, Issue 1, Pages 74-88Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2017.06.058
Keywords
Multi-objective discrete optimization; Firefly algorithm; Particle swarm optimization; Transfer function; Knapsack problem
Ask authors/readers for more resources
tion problems (MODP). Our algorithm combines a firefly algorithm (FA) and a particle swarm optimization (PSO). Basically, we address three main points: the effect of FA and PSO cooperation on the exploration of the search space, the discretization of the two algorithms using a transfer function, and finally, the use of the epsilon dominance relation to manage the size of the external archive and to guarantee the convergence and the diversity of Pareto optimal solutions. We compared the results of our algorithm with the results of five well-known meta-heuristics on nine multi-objective knapsack problem benchmarks. The experiments show clearly the ability of our algorithm to provide a better spread of solutions with a better convergence behavior. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available