Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27097
Title: New approach for solving the travelling salesman problem using self-organizing learning
Authors: Choy, CST
Siu, WC 
Issue Date: 1995
Publisher: IEEE
Source: IEEE International Conference on Neural Networks - Conference Proceedings, 1995, v. 5, p. 2632-2635 How to cite?
Abstract: In applying Kohonen's self-organizing model to solve travelling salesman problem (TSP), it is observed that the quality of the solution depends on the number of neurons being used, which is around two to three times of the number of cities, and is highly problem dependent. Instead of doing extensive experiments to determine the optima number of neurons, we propose a new winner selection criterion which generalizes the conventional ones. With this criterion, a ring of N neurons for solving an N-city TSP gives better solution as compared to those given by rings with N, 2N, 3N and 4N neurons using the conventional selection criterion, and yet takes only 16% more processing time than that of the conventional approach with N neurons. Hence, our approach arrives at a better solution with shorter/processing time and requires less resources as compared to that of the conventional approach.
Description: Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6), Perth, Aust, 27 November-1 December 1995
URI: http://hdl.handle.net/10397/27097
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
2
Last month
0
Citations as of Feb 26, 2017

Page view(s)

33
Last Week
0
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.