Heuristic algorithms for the multiple-choice multidimensional knapsack problem

In this paper, we propose several heuristics for approximately solving the multiple-choice multidimensional knapsack problem (noted MMKP), an NP-Hard combinatorial optimization problem. The first algorithm is a constructive approach used especially for constructing an initial feasible solution for the problem. The second approach is applied in order to improve the quality of the initial solution. Finally, we introduce the main algorithm, which starts by applying the first approach and tries to produce a better solution to the MMKP. The last approach can be viewed as a two-stage procedure: (i) the first stage is applied in order to penalize a chosen feasible solution and, (ii) the second stage is used in order to normalize and to improve the solution given by the firs stage. The performance of the proposed approaches has been evaluated based problem instances extracted from the literature. Encouraging results have been obtained.

[1]  Dirk Cattrysse,et al.  A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .

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

[3]  Arnaud Fréville,et al.  An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..

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

[5]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[6]  C. Voudouris,et al.  Partial Constraint Satisfaction Problems and Guided Local Search , 1996 .

[7]  Lei Chen,et al.  Building an Adaptive Multimedia System using the Utility Model , 1999, IPPS/SPDP Workshops.

[8]  David Pisinger,et al.  Algorithms for Knapsack Problems , 1995 .

[9]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[10]  Patrick Prosser,et al.  Guided Local Search for the Vehicle Routing Problem , 1997 .

[11]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[12]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[13]  Mhand Hifi,et al.  An exact algorithm for the multiple-choice multidimensional knapsack problem , 2004 .

[14]  R. Nauss.  The 0–1 knapsack problem with multiple choice constraints☆ , 1978 .

[15]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[16]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[17]  Ian Glendinning,et al.  Parallel and Distributed Processing , 2001, Digital Image Analysis.

[18]  Gérard Plateau,et al.  An algorithm for the solution of the 0–1 knapsack problem , 2005, Computing.

[19]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[20]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[21]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[22]  S. Martello,et al.  A New Algorithm for the 0-1 Knapsack Problem , 1988 .

[23]  Mhand Hifi,et al.  The Knapsack Sharing Problem: An Exact Algorithm , 2002, J. Comb. Optim..

[24]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[25]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[26]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[27]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[28]  Edward P. K. Tsang,et al.  Fast local search and guided local search and their application to British Telecom's workforce scheduling problem , 1997, Oper. Res. Lett..

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

[30]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

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

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