Abstract
This paper proposes a new heuristic approach based on the Particle Swarm Optimization (PSO) for the Multidimensional Knapsack Problem (MKP). Instead of the penalty function technique usually used to deal with the constrained problem, a heuristic repair operator utilizing problem-specific knowledge is incorporated into the modified algorithm. Computational results show that the new PSO based algorithm is capable of quickly obtaining high-quality solutions for problems of various characteristics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chu, P.C., Beasley, J.E.: A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics 4, 63–86 (1998)
Gavish, B., Pirkuo, H.: Efficient Algorithms for Solving Multiconstraint zero-One Knapsack Problems to Optimality. Mathematical Programming 31, 78–105 (1985)
Gilmore, P.C., Gomory, R.E.: The Theory and Computation of Knapsack Functions. Operations Research 14, 1045–1075 (1966)
Hu, X., Eberhart, R.: Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization. In: Proceedings of the Sixth World Multiconference on Systemics, Cybernetics and Informatics 2002 (SCI 2002), Orlando, USA (2002) [3]
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the International Conference on Neural Networks, Perth, Australiz, pp. 1942–1948. IEEE, Piscataway (1995)
Kennedy, J., Eberhart, R.C.: A Discrete Binary Version of the Particle Swarm Algorithm. In: Proc. 1997 Conf. On systems, Man, and Cybernetics, pp. 4104–4109. IEEE Service Center, Piscataway (1997)
Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco (2001)
Martello, S., Toth, P.: Knapsack Problems, Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)
Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization Method for Constrained Optimization Problems. In: Sincak, P., Vascak, J., Kvasnicka, V., Pospichal, J. (eds.) Intelligent Technologies - Theory and Applications: New Trends in Intelligent Technologies, pp. 214–220. IOS Press, Amsterdam (2002) (Frontiers in Artificial Intelligence and Applications series, vol. 76)
Shih, W.: A Branch and Bound method for the Multiconstraint Zero-One Knapsack Problem. Journal of the Operational Research Society 30, 369–378 (1979)
Vasquez, M., Hao, J.K.: A Hybrid Approach for the 0-1 Multidimensional Knapsack Problem. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp. 328–333. Morgan Kaufmann, San Francisco (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, M., Tian, P. (2006). Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_119
Download citation
DOI: https://doi.org/10.1007/11785231_119
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35748-3
Online ISBN: 978-3-540-35750-6
eBook Packages: Computer ScienceComputer Science (R0)