Abstract
In this work, we propose modified versions of shuffled frog leaping algorithm (SFLA) to solve multiple knapsack problems (MKP). The proposed algorithm includes two important operations: repair operator and genetic mutation with a small probability. The former is utilizing the pseudo-utility to repair infeasible solutions, and the later can effectively prevent the algorithm from trapping into the local optimal solution. Computational experiments with a large set of instances show that the proposed algorithm can be an efficient alternative for solving 0/1 multidimensional knapsack problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Osrio, M., Glover, F., Hammer, P.: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Technical Report HCES-08-00, Hearing Center for Enterprise Science (2000)
Nemhauser, G., Ullmann, Z.: Discrete dynamic programming and capital allocation. Management Science 15(9), 494–505 (1969)
Balas, E.: An additive algorithm for solving linear programs with zero-one variables. Operations Research 13(4), 517–546 (1965)
Crama, Y., Mazzola, J.: On the strength of relaxations of multidimensional knapsack problems. INFOR 32(4), 219–225 (1994)
Arntzen, H., Hvattum, L.M., Lokketangen, A.: Adaptive memory search for multidemand multidimensional knapsack problems. Computers and Operations Research 33(9), 2508–2525 (2006)
Egeblad, J., Pisinger, D.: Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers and Operations Research 36(4), 1026–1049 (2009)
Hua, Z., Huang, F.: A variable-grouping based genetic algorithm for large-scale integer programming. Information Sciences 176(19), 2869–2885 (2006)
Ke, L., Feng, Z., Ren, Z., Wei, X.: An ant colony optimization approach for the multidimensional knapsack problem. Journal of Heuristics 16(1), 65–83 (2010)
Zhao, Q., Zhang, X., Xiao, R.: Particle swarm optimization algorithm for partner selection in virtual enterprise. Progress in Natural Science 18(11), 1445–1452 (2008)
Eusuff, M.M., Lansey, K., Pasha, F.: Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization. Engineering Optimization 38(2), 129–154 (2006)
Zhang, X., Hu, X., Cui, G., Wang, Y., Niu, Y.: An improved shuffled frog leaping algorithm with cognitive behavior. In: Proc. 7th World Congr. Intelligent Control and Automation 2008 (2008)
Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary based optimization algorithms. Adv. Eng. Informat. 19(1), 43–53 (2005)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Conf. Neural Networks, vol. 4, pp. 1942–1948 (1995)
Eusuff, M., Lansey, K.: Optimization of water distribution network design using the shuffled frog leaping algorithm. Journal of Water Resource Plan Management 129, 210–225 (2003)
Pirkul, H.: A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics 34, 161–172 (1987)
Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics 4(1), 63–86 (1998)
Beasley, J.E.: Or-library: Distributing test problems by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharjee, K.K., Sarmah, S.P. (2012). A Modified Shuffled Frog Leaping Algorithm with Genetic Mutation for Combinatorial Optimization. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-34707-8_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34706-1
Online ISBN: 978-3-642-34707-8
eBook Packages: Computer ScienceComputer Science (R0)