Similarity measure of proximate optimality principle and Multi-Point Tabu Search

This paper proposes a new method, multi-point Tabu search, for solving combinatorial optimization problems on the basis of the concept of Proximate optimality principle (POP). While the similarity measure of POP is defined using the concept of metric space on combinatorial optimization problems, some numerical simulations using several types of combinatorial optimization benchmark problems investigate POP. The proposed algorithm is applied to some typical combinatorial optimization problems in order to verify the performance of the proposed algorithm.