Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem

作者: Min Kong , Peng Tian

DOI: 10.1007/11785231_119

关键词: Cutting stock problemParticle swarm optimizationMathematical optimizationMulti-swarm optimizationContinuous knapsack problemPenalty methodAlgorithmHeuristic (computer science)MathematicsSwarm intelligenceKnapsack problem

摘要: This paper proposes a new heuristic approach based on the Particle Swarm Optimization (PSO) for Multidimensional Knapsack Problem (MKP). Instead of penalty function technique usually used to deal with constrained problem, repair operator utilizing problem-specific knowledge is incorporated into modified algorithm. Computational results show that PSO algorithm capable quickly obtaining high-quality solutions problems various characteristics.

参考文章(9)
Jin-Kao Hao, Michel Vasquez, A hybrid approach for the 0-1 multidimensional knapsack problem international joint conference on artificial intelligence. pp. 328- 333 ,(2001)
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
P. C. Gilmore, R. E. Gomory, The Theory and Computation of Knapsack Functions Operations Research. ,vol. 14, pp. 1045- 1074 ,(1966) , 10.1287/OPRE.14.6.1045
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
Bezalel Gavish, Hasan Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality Mathematical Programming. ,vol. 31, pp. 78- 105 ,(1985) , 10.1007/BF02591863
J. Kennedy, R.C. Eberhart, A discrete binary version of the particle swarm algorithm systems man and cybernetics. ,vol. 5, pp. 4104- 4108 ,(1997) , 10.1109/ICSMC.1997.637339
J. Kennedy, R. Eberhart, Particle swarm optimization international conference on networks. ,vol. 4, pp. 1942- 1948 ,(2002) , 10.1109/ICNN.1995.488968