Summary
International Symposium on Nonlinear Theory and its Applications
2010
Session Number:B2L-A
Session:
Number:B2L-A4
A Method for Solving Asymmetric Traveling Salesman Problems Using Chaotic Exchange Method and Block Shift Operations
Toshihiro TACHIBANA, Masaharu ADACHI,
pp.297-300
Publication Date:2010/9/5
Online ISSN:2188-5079
DOI:10.34385/proc.44.B2L-A4
PDF download (89.5KB)
Summary:
An asymmetric Traveling Salesman Problem is one in which the costs for travel between one city and another are not symmetric. We propose a method for solving such problems based on chaotic search method by Hasegawa et al. It uses a chaotic neural network and tabu search, namely, block shift operations and 2-opt exchange are used as exchanging methods. In block shift operations, we consider several cities as a BLOCK, and the whole BLOCK is exchanged with other city. The proposed method switches two types of exchanging method by using chaotic neurodynamics. The proposed method exhibited better solutions than the method with a fixed ratio of the executing the exchanging methods.