Abstract
This paper introduces an adaptive Binary Differential Evolution (aBDE) that self adjusts two parameters of the algorithm: perturbation and mutation rates. The well-known 0-1 Multiple Knapsack Problem (MKP) is addressed to validate the performance of the method. The MKP is a NP-hard optimization problem and the aim is to maximize the total profit subjected to the total weight in each knapsack that must be less than or equal to a given limit. Results were obtained using 11 instances of the problem with different degrees of complexity. The results were compared using aBDE, BDE, a standard Genetic Algorithm (GA), and its adaptive version (aGA). The results show that aBDE obtained better results than the other algorithms. This indicates that the proposed approach is an interesting and promising strategy for control of parameters and for optimization of complex problems.
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
Aleti, A., Moser, I.: Studying feedback mechanisms for adaptive parameter control in evolutionary algorithms. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 3117–3124. IEEE (2013)
André, L., Parpinelli, R.S.: Controle de parâmetros em inteligência de enxame e computação evolutiva. Revista de Informática Teórica e Aplicada (to appear, 2014)
Azad, M.A.K., Rocha, A.M.A., Fernandes, E.M.: Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems. Swarm and Evolutionary Computation 14, 66–75 (2014)
Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Applied Mathematics and Computation 218(22), 11042–11061 (2012)
De Jong, K.: Evolutionary Computation: A Unified Approach. Bradford Book, Mit Press (2006)
Eiben, A., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)
Fialho, Á., Da Costa, L., Schoenauer, M., Sebag, M.: Extreme value based adaptive operator selection. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol. 5199, pp. 175–184. Springer, Heidelberg (2008)
Freville, A.: The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research 155(1), 1–21 (2004)
Hoff, A., Løkketangen, A., Mittet, I.: Genetic algorithms for 0/1 multidimensional knapsack problems. In: Proceedings Norsk Informatikk Konferanse, pp. 291–301. Citeseer (1996)
Kramer, O.: Evolutionary self-adaptation: a survey of operators and strategy parameters. Evolutionary Intelligence 3(2), 51–65 (2010)
Krause, J., Cordeiro, J., Parpinelli, R.S., Lopes, H.S.: A survey of swarm algorithms applied to discrete optimization problems. In: Swarm Intelligence and Bio-inspired Computation: Theory and Applications. Elsevier Science & Technology Books, pp. 169–191 (2013)
Krause, J., Parpinelli, R.S., Lopes, H.S.: Proposta de um algoritmo inspirado em evolução diferencial aplicado ao problema multidimensional da mochila. In: Anais do IX Encontro Nacional de Inteligência Artificial–ENIA. SBC, Curitiba (2012)
Storn, R., Price, K.: Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. J. of Global Optimization 11(4), 341–359 (1997)
Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 1539–1546. ACM (2005)
Vasquez, M., Hao, J.K., et al.: A hybrid approach for the 0-1 multidimensional knapsack problem. In: IJCAI, pp. 328–333 (2001)
Wang, L., Long Zheng, X., Yao Wang, S.: A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowledge-Based Systems 48(0), 17–23 (2013)
Yang, X.-S.: Chapter 6 - differential evolution. In: Nature-Inspired Optimization Algorithms, p. 89. Elsevier, Oxford (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
André, L., Stubs Parpinelli, R. (2014). A Binary Differential Evolution with Adaptive Parameters Applied to the Multiple Knapsack Problem. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Nature-Inspired Computation and Machine Learning. MICAI 2014. Lecture Notes in Computer Science(), vol 8857. Springer, Cham. https://doi.org/10.1007/978-3-319-13650-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-13650-9_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13649-3
Online ISBN: 978-3-319-13650-9
eBook Packages: Computer ScienceComputer Science (R0)