Optimal learning rate and neighborhood radius of Kohonen's self-organizing map for solving the travelling salesman problem

dc.contributor.authorMersiovsky, Tabea
dc.contributor.authorThekkottil, Abhilash
dc.contributor.authorHanne, Thomas
dc.contributor.authorDornberger, Rolf
dc.date.accessioned2024-04-18T06:55:39Z
dc.date.available2024-04-18T06:55:39Z
dc.date.issued2018
dc.description.abstractThe 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.
dc.event2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI 2018)
dc.event.end2018-03-25
dc.event.start2018-03-24
dc.identifier.doihttps://doi.org/10.1145/3206185.3206194
dc.identifier.isbn978-1-4503-6412-6
dc.identifier.urihttps://irf.fhnw.ch/handle/11654/42523
dc.language.isoen
dc.relation.ispartofProceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence
dc.spatialPhuket
dc.subject.ddc330 - Wirtschaft
dc.titleOptimal learning rate and neighborhood radius of Kohonen's self-organizing map for solving the travelling salesman problem
dc.type04B - Beitrag Konferenzschrift
dspace.entity.typePublication
fhnw.InventedHereYes
fhnw.ReviewTypeAnonymous ex ante peer review of a complete publication
fhnw.affiliation.hochschuleHochschule für Wirtschaftde_CH
fhnw.affiliation.institutInstitut für Wirtschaftsinformatikde_CH
fhnw.openAccessCategoryClosed
fhnw.pagination54-59
fhnw.publicationStatePublished
relation.isAuthorOfPublicatione070950a-346d-4c64-b126-87f22b1c8081
relation.isAuthorOfPublication35d8348b-4dae-448a-af2a-4c5a4504da04
relation.isAuthorOfPublication64196f63-c326-4e10-935d-6776cc91354c
relation.isAuthorOfPublication.latestForDiscovery35d8348b-4dae-448a-af2a-4c5a4504da04
Dateien
Lizenzbündel
Gerade angezeigt 1 - 1 von 1
Lade...
Vorschaubild
Name:
license.txt
Größe:
1.36 KB
Format:
Item-specific license agreed upon to submission
Beschreibung: