Please use this identifier to cite or link to this item:
|Title:||Simple learning algorithm for the traveling salesman problem||Authors:||Chen, K.||Issue Date:||Jun-1997||Citation:||Chen, K. (1997-06). Simple learning algorithm for the traveling salesman problem. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics 55 (6 SUPPL. B) : 7809-7812. ScholarBank@NUS Repository.||Abstract:||We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation. (i) A tour is selected by choosing cities probabilistically according to the "synaptic" strengths between cities. ii) The "synaptic" strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of the previous trials. We perform extensive simulations of the random distance traveling salesman problem. For sufficiently slow learning rates, near-optimal tours can be obtained with the average tour lengths close to the lower bounds for the shortest tour lengths.||Source Title:||Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics||URI:||http://scholarbank.nus.edu.sg/handle/10635/97925||ISSN:||1063651X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 15, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.