Four-Quadrant Division with HNN for Euclidean TSP
The Traveling Salesman Problem (TSP) is a renowned combinatorial optimization problem and has caught great attention of scientists from all over the world. In this study, an algorithm of Four-quadrant Division (FQD), which in each time divides a part of the map into four equivalent quadrants until the number of cities at each part of map is suitable for HNN to create tours, is applied to TSP. Also, a path relinking method is proposed to relink each part of a map to compose a global tour.
Keywordsthe travel salesman problem (TSP) Four-Quadrant Division (FQD) Hopfield Neural Network (HNN) path relinking
Unable to display preview. Download preview PDF.
- 2.Punnen, A.P.: The Traveling Salesman Problem: Application, Formulations and Variations. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, pp. 1–28. Kluwer, Norwell (2002)Google Scholar
- 3.Yang, H.Q., Yang, H.H.: An Self-organizing Neural Network with Convex-hull Expanding Property for TSP. IEEE (2005)Google Scholar
- 5.Li, M.L., Zhang, Y., Zhu, M.: Solving TSP by using Lotka-Volterra Neural Networks. Neurocomputing, 0925–2312/$ - see front matter © 2009 Elsevier B.VGoogle Scholar
- 7.Li, Y., Tang, Z., Xia, G.P., Wang, R.L., Xu, X.S.: A Fast and Reliable Approach to TSP using Positively Self-feedbacked Hopfield Networks. Hokkaido Institute of Tecnology, Japan (2004)Google Scholar