Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm

The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an NP-hard problem. Many heuristics algorithms have been developed to solve this combinatorial optimization problem. In this work, a new method based on Artificial Bee Colony algorithm (ABC) and surrogate constraint is proposed to solve the MMKP. Experimental results show that this method is competitive with the state-of-the-art approaches.

[1]  Mhand Hifi,et al.  Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem , 2009 .

[2]  John E. Beasley Multidimensional Knapsack Problems , 2009, Encyclopedia of Optimization.

[3]  Rabah Attia,et al.  OSC: solving the multidimensional multi-choice knapsack problem with tight strategic Oscillation using Surrogate Constraints , 2013 .

[4]  Xin Yao,et al.  An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem , 2017, Eur. J. Oper. Res..

[5]  S. Hanafi,et al.  A hybrid heuristic for the multiple choice multidimensional knapsack problem , 2013 .

[6]  Eric G. Manning,et al.  Quality adaptation in a multisession multimedia system: model, algorithms, and architecture , 1998 .

[7]  Bernard Chazelle,et al.  Natural algorithms , 2009, SODA.

[8]  Mohammadreza Razzazi,et al.  An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core , 2008, CSICC.

[9]  Abdelkader Sbihi Les Méthodes Hybrides en Optimisation Combinatoire :Algorithmes Exacts et Heuristiques. (The Hybrid Methods in Combinatorial Optimization: Exact Algorithms and Heuristics) , 2003 .

[10]  Kin F. Li,et al.  Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..

[11]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[12]  Chao Gao,et al.  A Stochastic Local Search Heuristic for the Multidimensional Multiple-choice Knapsack Problem , 2015, BIC-TA.

[13]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[14]  David Pisinger A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[15]  Saïd Hanafi,et al.  Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem , 2012, Comput. Oper. Res..

[16]  F. Glover A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[17]  Mhand Hifi,et al.  A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..

[18]  Marco Caserta,et al.  The robust multiple-choice multidimensional knapsack problem , 2019, Omega.

[19]  Abdelkader Sbihi,et al.  A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem , 2007, J. Comb. Optim..

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

[21]  Jin-Kao Hao,et al.  A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem , 2014, Eur. J. Oper. Res..

[22]  Fred W. Glover,et al.  Surrogate Constraints , 1968, Oper. Res..

[23]  Raymond R. Hill,et al.  First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem , 2013, Int. J. Metaheuristics.

[24]  Md. Faizul Bari,et al.  Solving the Multi-dimensional Multi-choice Knapsack Problem with the Help of Ants , 2010, ANTS Conference.

[25]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[26]  M. Moser,et al.  An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem , 1997 .

[27]  T. Ibaraki,et al.  THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .

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

[29]  Günther R. Raidl,et al.  The Multidimensional Knapsack Problem: Structure and Algorithms , 2010, INFORMS J. Comput..

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

[31]  Mhand Hifi,et al.  Heuristic algorithms for the multiple-choice multidimensional knapsack problem , 2004, J. Oper. Res. Soc..

[32]  Mohammadreza Razzazi,et al.  Development of core to solve the multidimensional multiple-choice knapsack problem , 2011, Comput. Ind. Eng..

[33]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.

[34]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .