Summary
International Symposium on Nonlinear Theory and its Applications
2009
Session Number:B1L-B
Session:
Number:B1L-B3
A Method for Solving Asymmetric Traveling Salesman Problems Using Chaotic Neurodynamics and Block Shift Operations
Toshihiro TACHIBANA, Masaharu ADACHI,
pp.-
Publication Date:2009/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.43.B1L-B3
PDF download (129.2KB)
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 previous work by Hasegawa et al. It uses a chaotic neural network and tabu search; block shift operations and 2-opt exchange are used as exchange methods. The proposed method obtains better solutions with a shorter computational time than the method we previously proposed.