Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization

Abstract This paper presents a novel binary monarch butterfly optimization (BMBO) method, intended for addressing the 0–1 knapsack problem (0–1 KP). Two tuples, consisting of real-valued vectors and binary vectors, are used to represent the monarch butterfly individuals in BMBO. Real-valued vectors constitute the search space, whereas binary vectors form the solution space. In other words, monarch butterfly optimization works directly on real-valued vectors, while solutions are represented by binary vectors. Three kinds of individual allocation schemes are tested in order to achieve better performance. Toward revising the infeasible solutions and optimizing the feasible ones, a novel repair operator, based on greedy strategy, is employed. Comprehensive numerical experimentations on three types of 0–1 KP instances are carried out. The comparative study of the BMBO with four state-of-the-art classical algorithms clearly points toward the superiority of the former in terms of search accuracy, convergent capability and stability in solving the 0–1 KP, especially for the high-dimensional instances.

[1]  D. Wiesmann,et al.  Evolutionary Optimization Algorithms in Computational Optics , 1999 .

[2]  Praveen Ranjan Srivastava,et al.  An Efficient Optimization Algorithm for Structural Software Testing , 2012 .

[3]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[4]  George Mavrotas,et al.  Selection among ranked projects under segmentation, policy and logical constraints , 2008, Eur. J. Oper. Res..

[5]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[6]  Simon Fong,et al.  Swarm Search for Feature Selection in Classification , 2013, 2013 IEEE 16th International Conference on Computational Science and Engineering.

[7]  F. Sibel Salman,et al.  Pre-disaster investment decisions for strengthening a highway network , 2010, Comput. Oper. Res..

[8]  A. Kaveh,et al.  A novel heuristic optimization method: charged system search , 2010 .

[9]  Sarada Prasad Sarmah,et al.  Shuffled frog leaping algorithm and its application to 0/1 knapsack problem , 2014, Appl. Soft Comput..

[10]  Jianhua Wu,et al.  Solving 0-1 knapsack problem by a novel global harmony search algorithm , 2011, Appl. Soft Comput..

[11]  Steven Li,et al.  A simplified binary harmony search algorithm for large scale 0-1 knapsack problems , 2015, Expert Syst. Appl..

[12]  A. Gandomi,et al.  A novel improved accelerated particle swarm optimization algorithm for global numerical optimization , 2014 .

[13]  Amir Hossein Gandomi,et al.  A new hybrid method based on krill herd and cuckoo search for global optimisation tasks , 2016, Int. J. Bio Inspired Comput..

[14]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .

[15]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[16]  Siti Zaiton Mohd Hashim,et al.  BMOA: Binary Magnetic Optimization Algorithm , 2012 .

[17]  Amir Hossein Gandomi,et al.  Chaotic Krill Herd algorithm , 2014, Inf. Sci..

[18]  Ke Jia,et al.  An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems , 2014, Comput. Intell. Neurosci..

[19]  Gaige Wang,et al.  An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems , 2014, Comput. Intell. Neurosci..

[20]  Xiang Li,et al.  Algorithms for randomized time-varying knapsack problems , 2016, J. Comb. Optim..

[21]  Justin Yates,et al.  A constrained binary knapsack approximation for shortest path network interdiction , 2011, Comput. Ind. Eng..

[22]  Ali Husseinzadeh Kashan,et al.  DisABC: A new artificial bee colony algorithm for binary optimization , 2012, Appl. Soft Comput..

[23]  Suash Deb,et al.  A Novel Monarch Butterfly Optimization with Greedy Strategy and Self-Adaptive , 2015, 2015 Second International Conference on Soft Computing and Machine Intelligence (ISCMI).

[24]  S. Voß,et al.  Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .

[25]  Paolo Toth,et al.  Dynamic programming algorithms for the Zero-One Knapsack Problem , 1980, Computing.

[26]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[27]  Anne L. Olsen.  Penalty functions and the knapsack problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[28]  Luo Liu,et al.  A hybrid meta-heuristic DE/CS Algorithm for UCAV path planning , 2012 .

[29]  Minghao Yin,et al.  Animal migration optimization: an optimization algorithm inspired by animal migration behavior , 2014, Neural Computing and Applications.

[30]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[31]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[32]  Amir Hossein Gandomi,et al.  Hybridizing harmony search algorithm with cuckoo search for global numerical optimization , 2014, Soft Computing.

[33]  Nikitas J. Dimopoulos,et al.  Resource allocation on computational grids using a utility model and the knapsack problem , 2009, Future Gener. Comput. Syst..

[34]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[35]  Gai-Ge Wang,et al.  An Improved Hybrid Encoding Firefly Algorithm for Randomized Time-Varying Knapsack Problems , 2015, 2015 Second International Conference on Soft Computing and Machine Intelligence (ISCMI).

[36]  Ding-Zhu Du,et al.  Design and Analysis of Approximation Algorithms , 2011 .

[37]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[38]  Zhihua Cui,et al.  Monarch butterfly optimization , 2015, Neural Computing and Applications.

[39]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[40]  Seyed Mohammad Mirjalili,et al.  The Ant Lion Optimizer , 2015, Adv. Eng. Softw..

[41]  Amir Hossein Gandomi,et al.  Stud krill herd algorithm , 2014, Neurocomputing.

[42]  Xingjuan Cai,et al.  Artificial Plant Optimization Algorithm , 2013 .

[43]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[44]  Xiangtao Li,et al.  A perturb biogeography based optimization with mutation for global numerical optimization , 2011, Appl. Math. Comput..

[45]  Simon Fong,et al.  A heuristic optimization method inspired by wolf preying behavior , 2015, Neural Computing and Applications.

[46]  Liu Zhiming,et al.  Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution , 2008, 2008 Second International Symposium on Intelligent Information Technology Application.

[47]  Panos M. Pardalos,et al.  A human learning optimization algorithm and its application to multi-dimensional knapsack problems , 2015, Appl. Soft Comput..

[48]  Xin-She Yang,et al.  A new hybrid method based on krill herd and cuckoo search for global optimisation tasks , 2016, Int. J. Bio Inspired Comput..

[49]  WangGai-Ge,et al.  Hybridizing harmony search algorithm with cuckoo search for global numerical optimization , 2016 .

[50]  Xin-She Yang,et al.  Attraction and diffusion in nature-inspired optimization algorithms , 2015, Neural Computing and Applications.

[51]  Yongquan Zhou,et al.  A Complex-valued Encoding Bat Algorithm for Solving 0–1 Knapsack Problem , 2015, Neural Processing Letters.

[52]  Amir Hossein Gandomi,et al.  A hybrid method based on krill herd and quantum-behaved particle swarm optimization , 2015, Neural Computing and Applications.

[53]  Simon Fong,et al.  Bat Algorithm is Better Than Intermittent Search Strategy , 2014, J. Multiple Valued Log. Soft Comput..