Abstract
Multiobjective combinatorial optimization problems are important tools for modeling real world decision problems. It is well known that they are very difficult to solve, therefore approximation of efficient solutions can contribute to obtaining overview solutions quickly. We consider the 0-1 knapsack problem with two objectives and we underline the problem difficulties. We propose a preprocessing using some properties to reduce the decision space with a simple local search-based method. Finally, we report and analyse numerical experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ehrgott. Multiple Criteria Optimization — Classification and Methodology. Shaker Verlag, Aachen, 1997.
M. Ehrgott and X. Gandibleux. A survey and annotated bibliography of multi-objective combinatorial optimization. OR Spektrum, 22(4):425–460, 2000.
X. Gandibleux and A. Fréville. Tabu search based procedure for solving the 0/1 multiobjective knapsack problem: The two objective case. Journal of Heuristics, 6(3):361–383, August 2000.
S. Martello and P. Toth. Knapsack Problems-Algorithms and Computer Implementations. John Wiley & Sons, Chichester, 1990.
R.E. Steuer. Multiple Criteria Optimization: Theory, Computation and Application. John Wiley & Sons, New York, 1985.
E.L. Ulungu, J. Teghem, and P. Fortemps. Heuristics for multi-objective combinatorial optimisation problem by simulated annealing. In Q. Wei J. Gu, G. Chen and S. Wang, editors, MCDM: Theory and applications, pages 228–238. SCI-TECH Information services, 1995.
M. Visée, J. Teghem, M. Pirlot, and E.L. Ulungu. Two-phases method and branch and bound procedures to solve the bi-obective knapsack problem. Journal of Global Optimization, 12:139–155, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gandibleux, X. (2001). Quick Evaluation of the Efficient Solution Set for the Biobjective Knapsack Problem. In: Köksalan, M., Zionts, S. (eds) Multiple Criteria Decision Making in the New Millennium. Lecture Notes in Economics and Mathematical Systems, vol 507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56680-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-56680-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42377-5
Online ISBN: 978-3-642-56680-6
eBook Packages: Springer Book Archive