Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A new approach to solve the traveling salesman problem by using the improved Kohonen's self-organizing feature map

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
$31 $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

3 Author(s)
Kitaori, K. ; Dept. of Electron. Syst. Eng., Tokyo Metropolitan Inst. of Technol., Japan ; Murakoshi, H. ; Funakubo, N.

This paper proposes methods that would develop the ability of Kohonen's self-organizing features map (SOFM) to solve optimization problems and also shows how useful SOFM is in solving optimization problems. The authors focused on the traveling salesman problem (TSP) as a typical example of an optimization problem. The conventional SOFM can solve the TSP. But the solution is not the optimum solution because the path intersects itself. Therefore, the authors propose new methods to keep the path from intersecting itself at all times. By adding these methods to the rule of changing synaptic strengths, the path length is improved by decreasing the iteration time and increasing the convergence rate

Published in:

Industrial Electronics, Control, and Instrumentation, 1995., Proceedings of the 1995 IEEE IECON 21st International Conference on  (Volume:2 )

Date of Conference:

6-10 Nov 1995