Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem.

The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications. In order to solve this NP-hard problem, a new modified Imperialist Competitive Algorithm with Constrained Assimilation (ICAwICA) is presented. The proposed algorithm introduces the concept of colony independence, a free will to choose between classical ICA assimilation to empires imperialist or any other imperialist in the population. Furthermore, a constrained assimilation process has been implemented that combines classical ICA assimilation and revolution operators, while maintaining population diversity. This work investigates the performance of the proposed algorithm across 101 Multidimensional Knapsack Problem (MKP) benchmark instances. Experimental results show that the algorithm is able to obtain an optimal solution in all small instances and presents very competitive results for large MKP instances.

[1]  Flávio Miguel Varejão,et al.  A shuffled complex evolution algorithm for the multidimensional knapsack problem using core concept , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[2]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[3]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[4]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[5]  Fred W. Glover,et al.  A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem , 2018, Inf. Sci..

[6]  Ayet Allah Ferjani,et al.  Logic gate-based evolutionary algorithm for the multidimensional knapsack problem , 2017 .

[7]  Sarada Prasad Sarmah,et al.  Modified swarm intelligence based techniques for the knapsack problem , 2016, Applied Intelligence.

[8]  Sanghamitra Bandyopadhyay,et al.  Genetic operators for combinatorial optimization in TSP and microarray gene ordering , 2007, Applied Intelligence.

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

[10]  Tatiana Kalganova,et al.  Dynamic Impact for Ant Colony Optimization algorithm , 2020, ArXiv.

[11]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[12]  Mohammad Mohammadi,et al.  Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm , 2017 .

[13]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[14]  Ming Li,et al.  An Imperialist Competitive Algorithm With the Diversified Operators for Many-Objective Scheduling in Flexible Job Shop , 2019, IEEE Access.

[15]  Zheng Tang,et al.  Improved Binary Imperialist Competition Algorithm for Feature Selection from Gene Expression Data , 2016, ICIC.

[16]  Behnam Mohammadi-Ivatloo,et al.  Solution of optimal reactive power dispatch of power systems using hybrid particle swarm optimization and imperialist competitive algorithms , 2016 .

[17]  K. Teo,et al.  A Binary differential search algorithm for the 0-1 multidimensional knapsack problem , 2016 .

[18]  Hamid Davoudpour,et al.  A hybrid imperialist competitive algorithm for solving economic lot and delivery scheduling problem in a four-stage supply chain , 2017 .

[19]  Jun-Lin Lin,et al.  Improving Imperialist Competitive Algorithm with Local Search for Global Optimization , 2013, 2013 7th Asia Modelling Symposium.

[20]  Hossein Nezamabadi-pour,et al.  BICA: a binary imperialist competitive algorithm and its application in CBIR systems , 2018, Int. J. Mach. Learn. Cybern..

[21]  Leandro dos Santos Coelho,et al.  Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization , 2013, Expert Syst. Appl..

[22]  Arun Kumar Sangaiah,et al.  A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem , 2019, Int. J. Mach. Learn. Cybern..

[23]  Kaveh Mollazade,et al.  Application of Imperialist Competitive Algorithm for Feature Selection: A Case Study on Bulk Rice Classification , 2012 .

[24]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[25]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[26]  Yong Wang,et al.  Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem , 2014, Algorithms.

[27]  Dalila Boughaci,et al.  Guided genetic algorithm for the multidimensional knapsack problem , 2018, Memetic Comput..

[28]  Indresh Kumar Gupta,et al.  A hybrid GA-GSA algorithm to solve multidimensional knapsack problem , 2018, 2018 4th International Conference on Recent Advances in Information Technology (RAIT).

[29]  Seyedmohsen Hosseini,et al.  A survey on the Imperialist Competitive Algorithm metaheuristic: Implementation in engineering domain and directions for future research , 2014, Appl. Soft Comput..

[30]  Thomas Setzer,et al.  Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems , 2020, Eur. J. Oper. Res..

[31]  Saïd Hanafi,et al.  A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem , 2016, Eng. Appl. Artif. Intell..

[32]  Mingchang Chih,et al.  Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem , 2015, Appl. Soft Comput..

[33]  Edmund K. Burke,et al.  A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem , 2016, Evolutionary Computation.

[34]  Jamshid Aghaei,et al.  Modified imperialist competitive algorithm for environmental constrained energy management of microgrids , 2018, Journal of Cleaner Production.

[35]  Steven Li,et al.  Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm , 2015, Comput. Oper. Res..

[36]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[37]  Dalila Boughaci,et al.  Knowledge-based Genetic Algorithm for the 0–1 Multidimensional Knapsack Problem , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[38]  H. Martin Weingartner,et al.  Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem , 2015 .

[39]  Seyed Mehdi Hosseini,et al.  A new improved adaptive imperialist competitive algorithm to solve the reconfiguration problem of distribution systems for loss reduction and voltage profile improvement , 2014 .