Self-organizing feature maps and the travelling salesman problem

✍ Scribed by Bernard Angéniol; Gaël de La Croix Vaubois; Jean-Yves Le Texier

• Publisher: Elsevier Science
• Year: 1988
• Tongue: English
• Weight: 435 KB
• Volume: 1
• Category: Article
• ISSN: 0893-6080
• DOI: 10.1016/0893-6080(88)90002-0

✦ Synopsis

AhstractwBased on Kohonen's work on self-organizing feature maps, we derive an algorithm for solving the classical Travelling Salesman Problem. Given a set of cities defined by their positions in the plane, an evolving population of cells, featuring dupfication and selection, iteratively organizes towards a quasi-optimal solution. Simulations on sequential machines have been carried out for problems with a thousand cities. The algorithm naturally lends itself to implementation on a network of interconnected, analog processing elements.