On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

Information Sciences

Volumn 181, Issue 19, 2011, Pages 4214-4229

  Faigl, Jan ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Multi goal path planning; Self organizing map (SOM); Traveling Salesman Problem (TSP)

Indexed keywords

ADAPTATION RULES; COMBINATORIAL APPROACH; COMPUTATIONAL TIME; EUCLIDEAN; INSPECTION PLANNING; MULTI-GOAL PATH PLANNING; NON-EUCLIDEAN; PATH PLANNING PROBLEMS; POLYGONAL DOMAIN; SELF ORGANIZING; SHORTEST PATH; STATE-OF-THE-ART ALGORITHMS; TRAVELING SALESMAN; VISIBILITY GRAPHS;

APPROXIMATION ALGORITHMS; CONFORMAL MAPPING; MOTION PLANNING; PROBLEM SOLVING; SELF ORGANIZING MAPS;

TRAVELING SALESMAN PROBLEM;

EID: 79960182781     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2011.05.019     Document Type: Article

References (39)

1. B. Angéniol, G. de la, C. Vaubois, and J-Y L. Texier Self-organizing feature maps and the travelling salesman problem Neural Netw. 1 1988 289 293
2. D. Applegate, R. Bixby, V. Chvátal, and W. Cook, CONCORDE TSP Solver. (2003) () (cited 8 July, 2010).
3. N. Aras, B.J. Oommen, and I.K. Altinel The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem Neural Netw. 12 9 1999 1273 1284 (Pubitemid 29475157)
4. N. Aras, I.K. Altinel, and J. Oommen A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES-DECOMPOSE IEEE Trans. Neural Netw. 14 4 2003 869 890
5. Yanping Bai, Wendong Zhang, and Zhen Jin An new self-organizing maps strategy for solving the traveling salesman problem Chaos Solitons Fract. 28 4 2006 1082 1089 (Pubitemid 41607610)
6. Marco Budinich A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing Neural Computing 8 2 1996 416 424 (Pubitemid 126449936)
7. Laura Burke Conscientious neural nets for tour construction in the traveling salesman problem: the vigilant net Comput. Oper. Res. 23 2 1996 121 129
8. Laura I. Burke Neural methods for the traveling salesman problem: insights from operations research Neural Netw. 7 4 1994 681 690
9. Laura I. Burke, and Poulomi Damany The guilty net for the traveling salesman problem Comput. Oper. Res. 19 3-4 1992 255 265
10. Vašek Chvátal, William Cook, George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson Solution of a Large-Scale Traveling-Salesman Problem 2010 Springer Berlin Heidelberg (Chapter 1, pp. 7-28)
11. E.M. Cochrane, and J.E. Beasley The co-adaptive neural network approach to the Euclidean travelling salesman problem Neural Netw. 16 10 2003 1499 1525 (Pubitemid 37386365)
12. Jean-Charles Créput, and Abderrafiaa Koukam A memetic neural network for the Euclidean traveling salesman problem Neurocomputing 72 4-6 2009 1250 1264
13. Olivier Devillers, Sylvain Pion, Monique Teillaud, and Projets Prisme Walking in a triangulation Int. J. Found. Comput. Sci. 13 2001 106 114 (Pubitemid 32865852)
14. Masato Edahiro, Iwao Kokubo, and Takao Asano A new point-location algorithm and its practical efficiency: comparison with existing algorithms ACM Trans. Graph 3 2 1984 86 109
15. Jan Faigl, Multi-Goal Path Planning for Cooperative Sensing, Ph.D. Thesis, Czech Technical University in Prague, 2010a.
16. Jan Faigl Approximate solution of the multiple watchman routes problem with restricted visibility range IEEE Trans. Neural Netw. 21 10 2010 1668 1679
17. Jan Faigl, Miroslav Kulich, and Libor Přeučil A sensor placement algorithm for a mobile robot inspection planning J. Intell. Robotic Syst. 62 3 2011 329 353
18. Jan Faigl, Miroslav Kulich, Vojtěch Vonásek, and Libor Přeučil An application of self-organizing map in the non-euclidean traveling salesman problem Neurochaptercomputing 74 5 2011 671 679
19. J.C. Fort Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem Biol. Cybern. 59 1 1988 33 40
20. Bernd Fritzke, Peter Wilke, FLEXMAP - A Neural Network For The Traveling Salesman Problem With Linear Time And Space Complexity, in: Proceedings of IJCNN, Singapore, 1991, pp. 929-934.
21. H.H. González-Baños, D. Hsu, and J.-C. Latombe Motion planning: recent developments S.S. Ge, F.L. Lewis, Autonomous Mobile Robots: Sensing Control, Decision-Making and Applications 2006 CRC Press (chapter 10)
22. Hui-Dong Jin, Kwong-Sak Leung, Man-Leung Wong, and Z.-B. Xu An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem IEEE Trans. Syst. Man Cybern. Part B: cybernetics 33 6 2003 877 888
23. Marcelo Kallmann Path Planning in Triangulations Proceedings of the IJCAI Workshop on Reasoning, Representation, and Learning in Computer Games vol. 31 2005 Edinburgh Scotland
24. Miroslav Kulich, Jan Kout, Libor Přeučil, Jiří Pavlíček, and Roman Mázl et al. PeLoTe - a Heterogeneous Telematic System for Cooperative Search and Rescue Missions, in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems 2004, volume 1, Sendai, 2004.
25. Miroslav Kulich, Jan Faigl, Libor Přeučil, Cooperative planning for heterogeneous teams in rescue operations, in IEEE International Workshop on Safety, Security and Rescue Robotics, pp. 230-235, 2005.
26. Kwong-Sak Leung, Hui-Dong Jin, and Zong-Ben Xu An expanding self-organizing neural network for the traveling salesman problem Neurocomputing 62 2004 267 292 (Pubitemid 39504666)
27. Thiago A.S. Masutti, and Leandro N. de Castro A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem Inf. Sci. 179 10 2009 1454 1468
28. Kazushi Murakoshi, and Yuichi Sato Reducing topological defects in self-organizing maps using multiple scale neighborhood functions Biosystems 90 1 2007 101 104 (Pubitemid 47031443)
29. M.H. Overmars, and E. Welzl New methods for computing visibility graphs SCG '88: Proceedings of the fourth annual symposium on Computational geometry 1988 ACM New York, NY, USA 164 171
30. Alessio Plebe, and Angelo Marcello Anile A neural-network-based approach to the double traveling salesman problem Neural Computing 14 2 2002 437 471
31. Gerhard Reinelt TSPLIB - a traveling salesman problem library J. Comput. 3 4 1991 376 384
32. Mitul Saha Tim Roughgarden, Jean-Claude Latombe, and Gildardo Sánchez-Ante. Planning Tours of Robotic Arms among Partitioned Goals Int. J. Rob. Res 25 3 2006 207 223
33. Raimund Seidel A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Comput. Geom. Theory Appl 1 1 1991 51 64
34. K. Smith, M. Palaniswami, and M. Krishnamoorthy Neural techniques for combinatorial optimization with applications IEEE Trans. on Neural Netw. 9 6 1998 1301 1318 (Pubitemid 128742410)
35. Kate A. Smith Neural networks for combinatorial optimization: a review of more than a decade of research INFORMS J. Comput. 11 1 1999 15 34
36. Samerkae Somhom, Abdolhamid Modares, and Takao Enkawa A self-organising model for the travelling salesman problem J. Oper. Res. Soc. 1997 919 928
37. Frederico Carvalho Vieira, Adrião Duarte Dória Neto, and José Alfredo Ferreira Costa An efficient approach to the travelling salesman problem using self-organizing maps Int. J. Neural Syst. 13 2 2003 59 66
38. Haiqing Yang and Haihong Yang, An Self-organizing Neural Network with Convex-hull Expanding Property for TSP, in: Neural Networks and Brain, 2005. ICNN& B '05. International Conference on, vol. 1, pp. 379-383, October 2005.
39. Wendong Zhang, Yanping Bai, and Hong Ping Hu The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP Appl. Math. Comput. 172 1 2006 603 623 (Pubitemid 43132865)