Multi-point Tabu Search based on Proximate Optimality Principle
Daichi Niizuma, Keiichiro Yasuda, Atushi Ishigame · 2006
This paper proposes an algorithm - multi-point tabu search based on proximate optimality principle (POP) - which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to several typical combinatorial optimization problems in order to verify the performance of the proposed algorithm. The simulation results indicate that the proposed method has higher optimality than the conventional tabu search.