It is known that neighborhood search methods such as Tabu Search have the high performances for single-objective combinatorial optimization problems. In this paper, we develop a new method based on Tabu Search for multi-objective combinatorial optimization problems by using multi-point search and interaction among search points. The performance of the developed optimization method is examined using 3 types of 2-objective 0-1 knapsack problems.
