Multi-Point Tabu Search with Interaction Based on Distance

This paper proposes proximate optimality principle (POP) based multi-point tabu search, for solving combinatorial optimization problems. 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.