Optimal Learning Rate and Neighborhood Radius of Kohonen's Self-Organizing Map for Solving the Travelling Salesman Problem

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.

[1]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[2]  Shafaatunnur Hasan,et al.  Multistrategy Self-Organizing Map Learning for Classification Problems , 2011, Comput. Intell. Neurosci..

[3]  Oscar Castillo,et al.  Design of Intelligent Systems Based on Fuzzy Logic, Neural Networks and Nature-Inspired Optimization , 2015, Design of Intelligent Systems Based on Fuzzy Logic, Neural Networks and Nature-Inspired Optimization.

[4]  Danijel Koržinek,et al.  Kohonen Self-Organizing Map for the Traveling Salesperson Problem , 2007 .

[5]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Mohammed Essaid Riffi,et al.  Discrete bat-inspired algorithm for travelling salesman problem , 2014, 2014 Second World Conference on Complex Systems (WCCS).

[7]  Said Touati,et al.  Stator Faults Detection and Diagnosis in Reactor Coolant Pump Using Kohonen Self-organizing Map , 2013, Modeling Approaches and Algorithms for Advanced Computer Applications.

[8]  Marco Budinich,et al.  A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing , 1994 .

[9]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[10]  Andrzej Dudek.  Kohonen Self-Organizing Maps for Symbolic Objects , 2008 .

[11]  Norfadzila Mohd Yusof,et al.  Multilevel learning in Kohonen SOM network for classification problems , 2006 .

[12]  Manbir Sodhi,et al.  Modified Self Organizing Neural Network Algorithm for Solving the Vehicle Routing Problem , 2015, 2015 IEEE 18th International Conference on Computational Science and Engineering.

[13]  Thomas Hanne,et al.  Computational Intelligence in Logistics and Supply Chain Management , 2017 .

[14]  Hamed Mojallali,et al.  Chaotic invasive weed optimization algorithm with application to parameter estimation of chaotic systems , 2012 .

[15]  Teuvo Kohonen,et al.  Self-organization and associative memory: 3rd edition , 1989 .

[16]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[17]  Thomas Hanne,et al.  Analysis of chaotic maps applied to self-organizing maps for the Traveling Salesman Problem , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[18]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[19]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[20]  Thomas Hanne,et al.  An ant colony system solving the travelling salesman region problem , 2016, 2016 4th International Symposium on Computational and Business Intelligence (ISCBI).

[21]  Thomas Hanne,et al.  A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem , 2016, 2016 4th International Symposium on Computational and Business Intelligence (ISCBI).

[22]  Marco Budinich,et al.  A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing , 1996, Neural Computation.

[23]  Xiang-Qian Ding,et al.  Research on some problems in the Kohonen SOM algorithm , 2002, Proceedings. International Conference on Machine Learning and Cybernetics.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Zhenyu Qian,et al.  A Discrete Hybrid Invasive Weed Optimization Algorithm for the Capacitated Vehicle Routing Problem , 2016 .

[26]  Zhao Jiang,et al.  Discrete Bat Algorithm for Traveling Salesman Problem , 2016, 2016 3rd International Conference on Information Science and Control Engineering (ICISCE).