Tabu search based procedure for solving the 0–1 multiobjective knapsack problem: The two objectives case

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 reduction 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 investigated. 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.