Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem

Abstract Monarch butterfly optimization (MBO) has become an effective optimization technique for function optimization and combinatorial optimization. In this paper, a generalized opposition-based learning (OBL) monarch butterfly optimization with Gaussian perturbation (OMBO) is presented, in which OBL strategy is used on half individuals of the population in the late stage of evolution and Gaussian perturbation acts on part of the individuals with poor fitness in each evolution. OBL guarantees the higher convergence speed of OMBO and Gaussian perturbation avoids to be stuck at a local optimum. In order to test and verify the effectiveness of the proposed method, three groups of 15 large-scale 0-1 KP instances from 800 to 2000 dimensions are used in our studies. The experimental results indicate that OMBO can find high-quality solutions.

[1]  Amir Hossein Alavi,et al.  An effective krill herd algorithm with migration operator in biogeography-based optimization , 2014 .

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

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

[4]  Shengyao Wang,et al.  A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2013, Knowl. Based Syst..

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

[6]  Suash Deb,et al.  Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization , 2017, Neural Computing and Applications.

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

[8]  Jinjun Chen,et al.  High Performance Computing for Cyber Physical Social Systems by Using Evolutionary Multi-Objective Optimization Algorithm , 2020, IEEE Transactions on Emerging Topics in Computing.

[9]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

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

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

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

[13]  Yu Xue,et al.  A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems , 2017, J. Parallel Distributed Comput..

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

[15]  Farid Nouioua,et al.  Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems , 2016, Soft Comput..

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

[17]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

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

[19]  Leandro dos Santos Coelho,et al.  Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems , 2018, Int. J. Bio Inspired Comput..

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

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

[22]  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..

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

[24]  Amir Hossein Gandomi,et al.  Opposition-based krill herd algorithm with Cauchy mutation and position clamping , 2016, Neurocomputing.

[25]  N. Hansen,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.

[26]  Yu Xue,et al.  A self-adaptive artificial bee colony algorithm based on global best for global optimization , 2017, Soft Computing.

[27]  Ye Xu,et al.  An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem , 2012, Expert Syst. Appl..

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