Solving efficiently the 0-1 multi-objective knapsack problem

In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case.

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

[2]  Matthias Ehrgott,et al.  Bound sets for biobjective combinatorial optimization problems , 2007, Comput. Oper. Res..

[3]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[4]  Arnaud Fréville,et al.  Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case , 2000, J. Heuristics.

[5]  Gwo-Hshiung Tzeng,et al.  A MULTIOBJECTIVE PROGRAMMING APPROACH FOR SELECTING NON-INDEPENDENT TRANSPORTATION INVESTMENT ALTERNATIVES , 1996 .

[6]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[7]  Hans Kellerer,et al.  Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..

[8]  José Rui Figueira,et al.  Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems , 2007, Eur. J. Oper. Res..

[9]  José Rui Figueira,et al.  Core problems in the bi-criteria {0,1}-knapsack , 2004 .

[10]  Larry Jenkins.  A bicriteria knapsack program for planning remediation of contaminated lightstation sites , 2002, Eur. J. Oper. Res..

[11]  Michael M. Kostreva,et al.  Relocation problems arising in conservation biology , 1999 .

[12]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[13]  José Rui Figueira,et al.  A scatter search method for bi-criteria {0, 1}-knapsack problems , 2006, Eur. J. Oper. Res..

[14]  G. Nemhauser,et al.  Discrete Dynamic Programming and Capital Allocation , 1969 .

[15]  Meir J. Rosenblatt,et al.  Generating the Discrete Efficient Frontier to the Capital Budgeting Problem , 1989, Oper. Res..

[16]  José Rui Figueira,et al.  Solving bicriteria 0-1 knapsack problems using a labeling algorithm , 2003, Comput. Oper. Res..

[17]  M. Wiecek,et al.  Dynamic programming approaches to the multiple criteria knapsack problem , 2000 .