## An Efficient Growing Ring SOM and Its Application to TSP

Citations: | 1 - 0 self |

### BibTeX

@MISC{Bai_anefficient,

author = {Yanping Bai and Wendong Zhang and Hongping Hu},

title = {An Efficient Growing Ring SOM and Its Application to TSP},

year = {}

}

### OpenURL

### Abstract

Abstract:- This paper presents an automatic parameters adjustment learning algorithm for self-organizing maps having growing ring topology. Like the existing SOM-like algorithm, the heuristic algorithm possesses many of these advantages of a good heuristic for the TSP solution. These advantages are easy implementation, fast computation, and production of good solutions. Computer programs developed in MATLAB for the heuristic algorithm were used to solve twelve test problems of the TSP from the TSPLIB. The experiment is showed that the results have an average of 2.4925 % difference from the optimum route. We can find almost optimal route by the heuristic algorithm. The algorithm is well suited for larger instances of the TSP since it has a fast convergence and low complexity. Key-Words:- Neural networks; Self-organizing maps; Traveling salesman problem; Combinatorial optimization; Neural computation 1

### Citations

1090 |
Self-organized Formation of Topologically Correct Feature Maps
- Kohonen
- 1982
(Show Context)
Citation Context ... or related notions [5]. However there are two types of neural network approaches for the TSP: the Hopfild-type neural networks [6] and the Kohonen-type self-organizing map (SOM-like) neural networks =-=[7]-=--[12]. The underlying idea of the Hopfied-type networks is to find solutions by automatically searching for the equilibrium states of one dynamic system corresponding to the problem under consideratio... |

481 |
Neural computations of decisions in optimization problems
- Hopfield, Tank
- 1985
(Show Context)
Citation Context ... heuristics proposed recently utilize the paradigm of neural computation or related notions [5]. However there are two types of neural network approaches for the TSP: the Hopfild-type neural networks =-=[6]-=- and the Kohonen-type self-organizing map (SOM-like) neural networks [7]-[12]. The underlying idea of the Hopfied-type networks is to find solutions by automatically searching for the equilibrium stat... |

257 |
TSPLIB - a traveling salesman problem library
- Reinelt
- 1991
(Show Context)
Citation Context ...n-problem form of TSP is a NP-complete [1], thence the great interest in efficient heuristics to solve it. There are several real-life applications of the TSP such as, VLSI routing [2], hole punching =-=[3]-=-. And wallpaper cutting [4]. There, the research on the TSP is theoretically important. Many of the heuristics proposed recently utilize the paradigm of neural computation or related notions [5]. Howe... |

85 |
The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms
- Laporte
- 1992
(Show Context)
Citation Context ...NP-complete [1], thence the great interest in efficient heuristics to solve it. There are several real-life applications of the TSP such as, VLSI routing [2], hole punching [3]. And wallpaper cutting =-=[4]-=-. There, the research on the TSP is theoretically important. Many of the heuristics proposed recently utilize the paradigm of neural computation or related notions [5]. However there are two types of ... |

73 |
The euclidean traveling salesman problem is NPcomplete
- Papadimitriou
- 1977
(Show Context)
Citation Context ...f the typical combinatorial optimization problems. It can be stated as a search for the shorted closed tour that visits each city once and only once. The decision-problem form of TSP is a NP-complete =-=[1]-=-, thence the great interest in efficient heuristics to solve it. There are several real-life applications of the TSP such as, VLSI routing [2], hole punching [3]. And wallpaper cutting [4]. There, the... |

31 | Parallel Distributed Approaches to Combinatorial Optimization
- Peterson
- 1990
(Show Context)
Citation Context ...ching [3]. And wallpaper cutting [4]. There, the research on the TSP is theoretically important. Many of the heuristics proposed recently utilize the paradigm of neural computation or related notions =-=[5]-=-. However there are two types of neural network approaches for the TSP: the Hopfild-type neural networks [6] and the Kohonen-type self-organizing map (SOM-like) neural networks [7]-[12]. The underlyin... |

26 | A.: "Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Smith
- 1999
(Show Context)
Citation Context ...y once. The decision-problem form of TSP is a NP-complete [1], thence the great interest in efficient heuristics to solve it. There are several real-life applications of the TSP such as, VLSI routing =-=[2]-=-, hole punching [3]. And wallpaper cutting [4]. There, the research on the TSP is theoretically important. Many of the heuristics proposed recently utilize the paradigm of neural computation or relate... |

21 | A Study of the Application of Kohonen-type Neural Networks to the Traveling Salesman Problem - Favata, Walker - 1991 |

18 | Texier. Self-organizing feature maps and the travelling salesman problem, Neural Networks - Angeniol, Vaubois, et al. - 1988 |

12 |
Solving a Combinatorial Problem via SelfOrganizing Process: An Application of the Kohonen Algorithm to the Traveling Salesman Problem
- Fort
- 1988
(Show Context)
Citation Context ...related notions [5]. However there are two types of neural network approaches for the TSP: the Hopfild-type neural networks [6] and the Kohonen-type self-organizing map (SOM-like) neural networks [7]-=-=[12]-=-. The underlying idea of the Hopfied-type networks is to find solutions by automatically searching for the equilibrium states of one dynamic system corresponding to the problem under consideration. Th... |

7 | Solution of the traveling salesman problem with an adaptive ring - Hueter - 1988 |

6 | An e cient self-organizing map designed by genetic algorithms for the traveling salesman problem
- Jin, Leung, et al.
- 2003
(Show Context)
Citation Context .... Due to their low computation complexity and promising performance, the SOM-like networks have attracted a large amount of research to explore and enhance the capability of handing the TSP [9], [12]-=-=[14]-=-. This paper presents an efficient growing ring SOM for TSP.Proceedings of the 9th WSEAS International Conference on Applied Mathematics, Istanbul, Turkey, May 27-29, 2006 (pp351-355) The rest of pap... |

4 |
A self-organizing neural network for multiple traveling salesman and vehicle routing problems,” Intl. Trans
- Modares, Somhom, et al.
- 1999
(Show Context)
Citation Context ... hereafter. Due to their low computation complexity and promising performance, the SOM-like networks have attracted a large amount of research to explore and enhance the capability of handing the TSP =-=[9]-=-, [12]-[14]. This paper presents an efficient growing ring SOM for TSP.Proceedings of the 9th WSEAS International Conference on Applied Mathematics, Istanbul, Turkey, May 27-29, 2006 (pp351-355) The ... |

1 | Kohonen Network incorporating explicit statistics and its application to the traveling salesman problem - Altinel - 1999 |

1 |
Convergence acceleration of the Hopfild neural network by optimization integration step sizes
- Abe
- 1996
(Show Context)
Citation Context ...ching for the equilibrium states of one dynamic system corresponding to the problem under consideration. The Hopfield-type networks can be successfully applied to solve small or some medium scale TSPs=-=[15]-=-. However, few promising solutions for general medium or large scale TSPs can be obtained. On the other, the SOM-like neural networks can handle large scale TSPs with low computation complexity. We wi... |