Journal of Heuristics

, Volume 6, Issue 3, pp 361–383

Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case

  • Xavier Gandibleux
  • Arnaud Freville
Article

DOI: 10.1023/A:1009682532542

Cite this article as:
Gandibleux, X. & Freville, A. Journal of Heuristics (2000) 6: 361. doi:10.1023/A:1009682532542

Abstract

We consider in this paper the solving of 0-1 knapsack problems with multiple linear objectives. We present a tabu search approach to generate a good approximation of the efficient set. The heuristic scheme is included in a redu tion decision space framework. The case of two objectives is developed in this paper. TS principles viewed into the multiobjective context are discussed. According to a prospective way, several variations of the algorithm are investigate. Numerical experiments are reported and compared with available exact efficient solutions. Intuitive justifications for the observed empirical behavior of the procedure and open questions are discussed.

multi-objective programming knapsack problem tabu search decision space reduction 

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Xavier Gandibleux
    • 1
  • Arnaud Freville
    • 2
  1. 1.LAMIH-ROAD, UMR CNRS 8530University of ValenciennesValenciennes CedexFrance
  2. 2.LAMIH-ROAD, UMR CNRS 8530University of ValenciennesValenciennes CedexFrance

Personalised recommendations