Summary
International Symposium on Nonlinear Theory and its Applications
2008
Session Number:A1L-F
Session:
Number:A1L-F2
A Method for Solving Asymmetric Traveling Salesman Problems Using Neural Networks and Block Shift Operations with Tabu Search
Toshihiro TACHIBANA, Masaharu ADACHI,
pp.-
Publication Date:2008/9/7
Online ISSN:2188-5079
Summary:
In this paper, a method for solving Asymmetric Traveling Salesman Problems (ATSP) is proposed. Where the asymmetric TSP means that the costs for travel between a city and another one are not symmetric. The proposed method uses Hopfield Neural Network and Block shift Operations combined with Tabu rules. The decisions of the cities to be exchanged are made by indices called “Asymmetric Index” focused on symmetry and asymmetry. In addition, this operation does not change the combination of the same cities with certain conditions represented as tabu rules. The proposed method can obtain the exact solution of for a 13-cities problem.