Hard multidimensional multiple choice knapsack problems, an empirical study

Recent advances in algorithms for the multidimensional multiple choice knapsack problems have enabled us to solve rather large problem instances. However, these algorithms are evaluated with very limited benchmark instances. In this study, we propose new methods to systematically generate comprehensive benchmark instances. Some instances with special correlation properties between parameters are found to be several orders of magnitude harder than those currently used for benchmarking the algorithms. Experiments on an existing exact algorithm and two generic solvers show that instances whose weights are uncorrelated with the profits are easier compared with weakly or strongly correlated cases. Instances with classes containing similar set of profits for items and with weights strongly correlated to the profits are the hardest among all instance groups investigated. These hard instances deserve further study and understanding their properties may shed light to better algorithms.

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

[2]  Marc E. Pfetsch,et al.  Orbitopal fixing , 2011, Discret. Optim..

[3]  Daniel P. Siewiorek,et al.  On quality of service optimization with discrete QoS options , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

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

[5]  電子情報通信学会.  IEICE transactions on fundamentals of electronics, communications and computer sciences , 1992 .

[6]  Mhand Hifi,et al.  A column generation method for the multiple-choice multi-dimensional knapsack problem , 2010, Comput. Optim. Appl..

[7]  Harvey M. Salkin,et al.  The knapsack problem: A survey , 1975 .

[8]  V. Kaibel,et al.  Packing and partitioning orbitopes , 2006, math/0603678.

[9]  Miltiades E. Anagnostou,et al.  MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem , 2006, International Conference on Computational Science.

[10]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[11]  François Margot,et al.  Exploiting orbits in symmetric ILP , 2003, Math. Program..

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

[13]  Nikitas J. Dimopoulos,et al.  A new heuristic for solving the multichoice multidimensional knapsack problem , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[15]  Mohammad Sohel Rahman,et al.  Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..

[16]  S. M. Kamrul Hasan,et al.  A NEW STRATEGY FOR SOLVING MULTIPLE-CHOICE MULTIPLE-DIMENSION KNAPSACK PROBLEM IN PRAM MODEL , 2007 .

[17]  David Pisinger,et al.  Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[18]  Gwendal Simon,et al.  Query range problem in wireless sensor networks , 2009, IEEE Communications Letters.

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

[20]  David Pisinger,et al.  Core Problems in Knapsack Algorithms , 1999, Oper. Res..

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

[22]  Md. Mahmudul Hasan,et al.  Heuristic solution of MMKP in different distributed admission control and QoS adaptation architectures for video on demand service , 2005, 2nd International Conference on Broadband Networks, 2005..