Abstract
In this paper, we propose a novel artificial bee colony(ABC) algorithm for the multidimensional knapsack problems, which introduces the attraction pheromone and presents a transition strategy based on the attraction pheromone. In our algorithm, the scout generates a food source according to the transition strategy and replaces the abandoned food source by comparison with the corresponding elite food source, while the employed bee and onlooker modify the repair operator using the transition strategy in the determination of the neighborhood of a food source. Experimental results show that our approach performs better in the quality of solutions, the convergence speed and the time performance than traditional ABC algorithm.
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
Ji, J., Huang, Z., Liu, C., Liu, X., Zhong, N.: An ant colony optimization algorithm for solving the multidimensional knapsack problems. In: IEEE/WIC/ACM International Conference on Intelligent Agent Technology, pp. 10–16 (2007)
Freville, A.: The multidimensional 0-1 knapsack problem:an overview. European Journal of Operational Research 155, 1–21 (2004)
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)
Junzhong, J., Zhen, H., Chunnian, L.: Ant colony optimization algorithm based on mutation and pheromone diffusion for the multidimensional knapsack problems. Computer Research and Development 46, 644–654 (2009)
Sundar, S., Singh, A., Rossi, A.: An artificial bee colony algorithm for the 0–1 multidimensional knapsack problem. CCIS, vol. 94, pp. 141–151 (2010)
Karaboga, D.: An idea based on honey bee swarm for numerical optimization,Technical Report TR06,Computer Engineering Department, Erciyes University,Turkey (2005)
Karaboga, D., Akay, B.: A comparative study of artifical bee colony algorithm. Applied Mathematics and Computation 214, 108–132 (2009)
Wu, y.: The behavior of honey bees. Bulletin of Biology 36 (2001)
Leguizamon, G., Michalewicz, Z.: A new version of ant system for subset prolems. In: Proceedings of the 1999 Congress on Evolutionary Compution (CEC 1999), vol. 2, pp. 1458–1464 (1999)
Alaya, I., Solnon, C., Ghedira, K.: Ant algorithm for the multidimensional knapsack problem. Technique et Science Informatiques 26, 371–390 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, H., Ji, J., Qin, Y., Wang, Y., Liu, C. (2011). A Novel Artificial Bee Colony Algorithm Based on Attraction Pheromone for the Multidimensional Knapsack Problems. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23887-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-23887-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23886-4
Online ISBN: 978-3-642-23887-1
eBook Packages: Computer ScienceComputer Science (R0)