Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

In the present work, we are interested in the practical behavior of a new fully polynomial time approximation schemes (fptas) to solve the approximation version of the 0-1 multi-objective knapsack problem. The proposed methodology makes use of very general techniques (such as dominance relations in dynamic programming) and thus may be applicable in the implementation of fptas for other problems as well. Extensive numerical experiments on various types of instances in the bi and tri-objective cases establish that our method performs very well both in terms of CPU time and size of solved instances. We point out some reasons for the good practical performance of our algorithm. A comparison with an exact method and the fptas proposed in [Erlebach, T., Kellerer, H., Pferschy, U., 2002. Approximating multiobjective knapsack problems. Management Science 48 (12), 1603-1612] is also performed.

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

[2]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

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

[4]  H. Safer.  Fast approximation schemes for multi-criteria combinatorial optimization , 1992 .

[5]  Paolo Serafini,et al.  Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[6]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

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

[8]  Patrick Reed,et al.  Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems , 2011, Eur. J. Oper. Res..

[9]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[11]  Johannes Jahn,et al.  Recent Advances and Historical Development of Vector Optimization , 1987 .

[12]  Daniel Vanderpooten,et al.  Solving efficiently the 0-1 multi-objective knapsack problem , 2009, Comput. Oper. Res..

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

[14]  Evripidis Bampis,et al.  On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems , 2003, Theor. Comput. Sci..

[15]  J. Orlin,et al.  Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems , 1995 .