By Topic

New approach for solving the travelling salesman problem using self-organizing learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Clifford Sze-Tsan Choy ; Dept. of Electron. Eng., Hong Kong Polytech. Univ., Hung Hom, Hong Kong ; Wan-Chi Siu

In applying Kohonen's self-organizing model to solve the 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 optimal number of neurons, the authors 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 a 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, the authors' approach arrives at a better solution with shorter processing time and requires less resources as compared to that of the conventional approach

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:5 )

Date of Conference:

Nov/Dec 1995