A Modified Binary Particle Swarm Optimization for Knapsack Problems
作者： Jagdish Chand Bansal , Kusum Deep
DOI: 10.1016/J.AMC.2012.05.001
关键词: Search algorithm 、 Sigmoid function 、 Multi-swarm optimization 、 Mathematics 、 Mathematical optimization 、 Benchmark (computing) 、 Continuous knapsack problem 、 Knapsack problem 、 Swarm behaviour 、 Probability density function 、 Algorithm
摘要: … Multiple or Multidimensional Knapsack Problem: if we have n items and m knapsacks with … same and knapsack are to be filled simultaneously. All the Knapsack Problems belongs to the …
elsevier.com
sci-hub.se 参考文章(51)
Jochen Thiel, Stefan Voss, Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms Infor. ,vol. 32, pp. 226- 242 ,(1994) , 10.1080/03155986.1994.11732253
Jin-Kao Hao, Michel Vasquez, A Hybrid Approach for the 01 Multidimensional Knapsack problem. international joint conference on artificial intelligence. pp. 328- 333 ,(2001)
Hong Li, Yong-Chang Jiao, Li Zhang, Ze-Wei Gu, Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems Lecture Notes in Computer Science. pp. 696- 705 ,(2006) , 10.1007/11881070_94
Min Kong, Peng Tian, Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem Artificial Intelligence and Soft Computing – ICAISC 2006. pp. 1140- 1149 ,(2006) , 10.1007/11785231_119
Bin Ye, Jun Sun, Wen-Bo Xu, Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach Computational Intelligence and Bioinformatics. pp. 155- 163 ,(2006) , 10.1007/11816102_17
A. Drexl, A simulated annealing approach to the multiconstraint zero-one knapsack problem Computing. ,vol. 40, pp. 1- 8 ,(1988) , 10.1007/BF02242185
Fred Glover, Gary A. Kochenberger, Critical Event Tabu Search for Multidimensional Knapsack Problems Springer, Boston, MA. pp. 407- 427 ,(1996) , 10.1007/978-1-4613-1361-8_25
Andries P. Engelbrecht, Fundamentals of Computational Swarm Intelligence ,(2005)
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
Fernanda Hembecker, Heitor S. Lopes, Walter Godoy, Particle Swarm Optimization for the Multidimensional Knapsack Problem international conference on adaptive and natural computing algorithms. pp. 358- 365 ,(2007) , 10.1007/978-3-540-71618-1_40