Multi-point Tabu Search for traveling salesman problems

被引：5

作者：

Niizuma, Daichi

Yasuda, Keiichiro

Ishigame, Atsushi

机构：

[1] Tokyo Metropolitan Univ, Tokyo 1920397, Japan

[2] Osaka Prefecture Univ, Osaka 5998531, Japan

来源：

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING | 2006年 / 1卷 / 01期

关键词：

Tabu Search; meta-heuristics; proximate optimality principle; interaction;

D O I：

10.1002/tee.20028

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：126 / 129

页数：4