Abstract
This work shows how a modified Kohonen Self-Organizing Map with one dimensional neighborhood is used to solve the symmetrical Traveling Salesperson Problem. Solution generated by the Kohonen network is improved using the 2opt algorithm. The paper describes briefly self-organization in neural networks, 2opt algorithm and modifications applied to Self-Organizing Map. Finally, the algorithm is compared with the Evolutionary Algorithm with Enhanced Edge Recombination operator and self-adapting mutation rate.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kohonen T. (2001), Self-Organizing Maps, Springer, Berlin.
Michalewicz Z. (1996), Genetic Algorithms + DataStructures = Evolution Programs, Springer-Verlag.
Starkweather T., McDaniel S., Whitley C., Mathias K., Whitley D., (1991), A Comparison of Genetic Sequencing Operators.
Johnson, D.S., McGeoch, L.A., and Rothberg, E.E., Asymptotic experimental analysis for the Held-Karp traveling salesman bound.
Korte B., (1988), Applications of Combinatorial Optimization.
Reinelt G., (1995), TSPLIB 95 documentation, University of Heidelberg.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brocki, Ł., Koržinek, D. (2007). Kohonen Self-Organizing Map for the Traveling Salesperson Problem. In: Jabłoński, R., Turkowski, M., Szewczyk, R. (eds) Recent Advances in Mechatronics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73956-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-73956-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73955-5
Online ISBN: 978-3-540-73956-2
eBook Packages: EngineeringEngineering (R0)