title: Solving large scale traveling salesman problems by chaotic neurodynamics.
abstract: We propose a novel approach for solving large scale traveling salesman problems (TSPs) by chaotic dynamics. First, we realize the tabu search on a neural network, by utilizing the refractory effects as the tabu effects. Then, we extend it to a chaotic neural network version. We propose two types of chaotic searching methods, which are based on two different tabu searches. While the first one requires neurons of the order of n2 for an n-city TSP, the second one requires only n neurons. Moreover, an automatic parameter tuning method of our chaotic neural network is presented for easy application to various problems. Last, we show that our method with n neurons is applicable to large TSPs such as an 85,900-city problem and exhibits better performance than the conventional stochastic searches and the tabu searches.
authors.affiliation: Wireless Communications Division, Independent Administrative Institution, Yokosuka-shi, Kanagawa, Japan. mikio@crl.go.jp
authors.forename: Mikio
authors.initials: M
authors.lastname: Hasegawa
authors.forename: Tohru
authors.initials: T
authors.lastname: Ikeguch
authors.forename: Kazuyuki
authors.initials: K
authors.lastname: Aihara
mesh_terms: D003132:Commerce / Q000706:statistics & numerical data; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D011340:Problem Solving