Abstract
In this paper, we presented a New Hybrid Binary Particle Swarm Optimization (NHBPSO). This hybridization consists at combining some principles of Particle Swarm Optimization (PSO) and Crossover Operation of the Genetic Algorithm (GA). The proposed algorithm is used to solving the NP-hard combinatorial optimization problem of Multidimensional Knapsack Problem (MKP). In the aim to access the efficiency and performance of our NHBPSO algorithm we have tested it on some benchmarks from OR-Library and we have compared our results with the obtained results by the standard binary Particle Swarm Optimization with penalty function technique (PSO-P) algorithm and the quantum version (QICSA) of the new metaheuristic Cuckoo Search. The experimental results show a good and promise solution quality obtained by the proposed algorithm which outperforms the PSO-P and QICSA algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhou, Y., Kuang, Z., Wang, J.: A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds.) ISICA 2008. LNCS, vol. 5370, pp. 715–722. Springer, Heidelberg (2008)
Li, H., Jiao, Y.-C., Zhang, L., Gu, Z.-W.: Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems. In: Jiao, L., Wang, L., Gao, X.-b., Liu, J., Wu, F. (eds.) ICNC 2006, Part I. LNCS, vol. 4221, pp. 696–705. Springer, Heidelberg (2006)
Alonso, C.L., Caro, F., Montaña, J.L.: An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005, Part II. LNCS, vol. 3562, pp. 63–73. Springer, Heidelberg (2005)
Angelelli, E., Mansini, R., Speranza, M.G.: Kernel search: A general heuristic for the multi-dimensional knapsack problem. Computers & Operations Research 37, 2017–2026 (2010)
Chu, P.C., Beasley, J.E.: A Genetic Algorithm for the Multidimensional Knapsack Problem. Journal of Heuristics 4, 63–86 (1998)
Kong, M., Tian, P.: Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 1140–1149. Springer, Heidelberg (2006)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE Int. Conf. on Neural Networks, WA, Australia, pp. 1942–1948 (1995)
Shi, Y., Eberhart, R.: Parameter Selection in Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)
Gherboudj, A., Chikhi, S.: BPSO Algorithms for Knapsack Problem. In: Özcan, A., Zizka, J., Nagamalai, D. (eds.) WiMo 2011 and CoNeCo 2011. CCIS, vol. 162, pp. 217–227. Springer, Heidelberg (2011)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, Piscatawary, NJ, pp. 4104–4109 (1997)
Olamaei, J., Niknam, T., Gharehpetian, G.: Application of particle swarm optimization for distribution feeder reconfiguration considering distributed generators. Appl. Math. Comput. 201(1-2), 575–586 (2008)
Beasley, J.E.: OR-Library, http://www.people.brunel.ac.uk/mastjjb/jeb/orlib/mknapinfo.html
Holland, J.H.: Adaptation in natural and artificial system. The University of Michigan Press, Ann Arbor (1975)
Khanesar, M.-A., Teshnehlab, M., Shoorehdeli, M.-A.: A Novel Binary Particle Swarm Optimization. In: Proceedings of the 15th Mediterranean Conference on Control & Automation, Athens, Greece, July 27– 29 (2007)
Layeb, A.: A novel quantum inspired cuckoo search for knapsack problems. Int. J. Bio-Inspired Computation 3(5) (2011)
Yang, X.-S., Deb, S.: Engineering Optimisation by Cuckoo Search. Int. J. Mathematical Modelling and Numerical Optimisation 1(4), 330–343 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Gherboudj, A., Labed, S., Chikhi, S. (2012). A New Hybrid Binary Particle Swarm Optimization Algorithm for Multidimensional Knapsack Problem. In: Wyld, D., Zizka, J., Nagamalai, D. (eds) Advances in Computer Science, Engineering & Applications. Advances in Intelligent and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30157-5_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-30157-5_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30156-8
Online ISBN: 978-3-642-30157-5
eBook Packages: EngineeringEngineering (R0)