Optimal learning rate and neighborhood radius of Kohonen's self-organizing map for solving the travelling salesman problem
Loading...
Author (Corporation)
Publication date
2018
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Editor (Corporation)
Supervisor
Parent work
Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
54-59
Patent number
Publisher / Publishing institution
Place of publication / Event location
Phuket
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
The Travelling Salesman Problem (TSP) is one of the well-studied classic combinatorial optimization problems and proved to be a non-deterministic polynomial-time (NP) hard problem. Kohonen's self-organizing map (SOM) is a type of artificial neural network, which can be applied on the TSP. The purpose of the algorithm is to adapt a special network to a set of unorganized and unlabeled data so that it can be used for clustering and simple classification tasks. In this paper, we study the effect of changing the parameters in the SOM algorithm to solve the TSP. The focus of the parameter investigation lies on the influence of changes in the SOM learning rate and neighborhood radius as well as on the number of iterations in TSP problems with varying number of cities. Thus, the investigation is based on various problem instances as well as on different parameter settings of the SOM, which are compared with each other and discussed. The results are additionally compared with the nature inspired ant colony optimization (ACO) algorithm. As a result, it is proved that with the right parameter setting the SOM generated result is improved and that it is superior to the ACO algorithm.
Keywords
Subject (DDC)
Event
2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI 2018)
Exhibition start date
Exhibition end date
Conference start date
24.03.2018
Conference end date
25.03.2018
Date of the last check
ISBN
978-1-4503-6412-6
ISSN
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Peer review of the complete publication
Open access category
Closed
License
Citation
Mersiovsky, T., Thekkottil, A., Hanne, T., & Dornberger, R. (2018). Optimal learning rate and neighborhood radius of Kohonen’s self-organizing map for solving the travelling salesman problem. Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, 54–59. https://doi.org/10.1145/3206185.3206194