Particle Swarm Optimization for the Multidimensional Knapsack Problem
作者： Fernanda Hembecker , Heitor S. Lopes , Walter Godoy
DOI: 10.1007/978-3-540-71618-1_40
关键词:
摘要: The multidimensional 0/1 knapsack problem is a classical of discrete optimization. There are several approaches for solving the different variations such problem, including mathematical programming and stochastic heuristic methods. This paper presents application Particle Swarm Optimization (PSO) using selected instances ORLib. For tested, results were very close or equal to optimal solution known, even considering that parameters PSO not optimized. analysis suggests potential simple this class combinatorial problems.
springer.com
sci-hub.se 参考文章(14)
Arild Hoff, Genetic Algorithms for 0/1 Multidimensional Knapsack Problems ,(2005)
Marcos H. Maruo, Heitor S. Lopes, Myriam R. Delgado, Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems Evolutionary Computation in Combinatorial Optimization. pp. 154- 165 ,(2005) , 10.1007/978-3-540-31996-2_15
P.C. Chu, J.E. Beasley, A Genetic Algorithm for the Multidimensional Knapsack Problem Journal of Heuristics. ,vol. 4, pp. 63- 86 ,(1998) , 10.1023/A:1009642405419
M. Clerc, The swarm and the queen: towards a deterministic and adaptive particle swarm optimization congress on evolutionary computation. ,vol. 3, pp. 1951- 1957 ,(1999) , 10.1109/CEC.1999.785513
Russell C. Eberhart, Yuhui Shi, Comparison between Genetic Algorithms and Particle Swarm Optimization Evolutionary Programming. ,vol. 7, pp. 611- 616 ,(1998) , 10.1007/BFB0040812
Sami Khuri, Thomas Bäck, Jörg Heitkötter, The zero/one multiple knapsack problem and genetic algorithms acm symposium on applied computing. pp. 188- 193 ,(1994) , 10.1145/326619.326694
Wei Shih, A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem Journal of the Operational Research Society. ,vol. 30, pp. 369- 378 ,(1979) , 10.1057/JORS.1979.78
David N. Ness, H. Martin Weingartner, Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem ,(2011)
Silvano Martello, Paolo Toth, Knapsack Problems: Algorithms and Computer Implementations ,(1990)
Ioan Cristian Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection Information Processing Letters. ,vol. 85, pp. 317- 325 ,(2003) , 10.1016/S0020-0190(02)00447-7