Multi‐point Tabu Search for traveling salesman problems
Daichi Niizuma, Keiichiro Yasuda, Atsushi Ishigame · IEEJ Transactions on Electrical and Electronic Engineering · 2006
Abstract This paper proposes an algorithm—multipoint Tabu Search (MPTS) based on POP—which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to some problems of traveling salesmen, which are 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 (TS). © 2006 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.