An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Neurocomputing

Volumn 74, Issue 5, 2011, Pages 671-679

  Faigl, Jan ^a   Kulich, Miroslav ^a   Vonásek, Vojtěch ^a   Přeučil, Libor ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Multi goal path planning; Neural network; Self organizing map; Traveling Salesman Problem

Indexed keywords

EUCLIDEAN; GEOMETRICAL INTERPRETATION; NON-EUCLIDEAN; PATH PLANNING PROBLEMS; PATH-PLANNING; POLYGONAL DOMAIN; PROBLEM FORMULATION; REAL PROBLEMS; SHORTEST PATH; TRAVELING SALESMAN;

CONFORMAL MAPPING; MOTION PLANNING; NEURAL NETWORKS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; CONTROLLED STUDY; FEASIBILITY STUDY; GEOMETRY; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; NERVE CELL; PRIORITY JOURNAL; SELF ORGANIZING MAP; STATISTICAL ANALYSIS;

EID: 78650727565     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2010.08.026     Document Type: Article

References (31)

1. Angéniol B., Vaubois G.de la C., Texier J.-Y.L. Self-organizing feature maps and the travelling salesman problem. Neural Networks 1988, 1:289-293.
2. Fort J.C. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem. Biological Cybernetics 1988, 59(1):33-40.
3. Burke L.I., Damany P. The guilty net for the traveling salesman problem. Computers and Operations Research 1992, 19(3-4):255-265.
4. Budinich M. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Computation 1996, 8(2):416-424.
5. Somhom S., Modares A., Enkawa T. A self-organising model for the travelling salesman problem. Journal of the Operational Research Society 1997, 919-928.
6. Burke L. "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net. Computers and Operations Research 1996, 23(2):121-129.
7. Aras N., Oommen B.J., Altinel I.K. The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks 1999, 12(9):1273-1284.
8. Leung K.-S., Jin H.-D., Xu Z.-B. An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 2004, 62:267-292.
9. Cochrane E.M., Beasley J.E. The co-adaptive neural network approach to the Euclidean travelling salesman problem. Neural Networks 2003, 16(10):1499-1525.
10. Créput J.-C., Koukam A. A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 2009, 72(4-6):1250-1264.
11. Papadimitriou C.H. The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science 1977, 4(3):237-244.
12. L.B. Gueta, R. Chiba, J. Ota, T. Ueyama, T. Arai, Coordinated motion control of a robot arm and a positioning table with arrangement of multiple goals, in: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), 2008, pp. 2252-2258.
13. T. Danner, L. Kavraki, Randomized planning for short inspection paths, in: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), San Francisco, CA, 2000, pp. 971-976.
14. S.N. Spitz, A.A.G. Requicha, Multiple-goals path planning for coordinate measuring machines, in: Proceedings of IEEE International Conference on Robotics and Automation (ICRA), 2000, pp. 2322-2327.
15. Glover F., Gutin G., Yeo A., Zverovich A. Construction heuristics for the asymmetric TSP. European Journal of Operational Research 2001, 129(3):555-568.
16. Saalweachter J., Pizlo Z. Non-Euclidean traveling salesman problem. Optimization and its Applications 2008, 21:339-358.
17. Hershberger J., Suri S. An optimal algorithm for Euclidean shortest paths in the plane. SIAM Journal on Computing 1999, 28(6):2215-2256.
18. M. Kulich, J. Faigl, L. Přeučil, Cooperative planning for heterogeneous teams in rescue operations, in: IEEE International Workshop on Safety, Security and Rescue Robotics, 2005, pp. 230-235.
19. Seidel R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry: Theory and Applications 1991, 1(1):51-64.
20. M.H. Overmars, E. Welzl, New methods for computing visibility graphs, in: SCG '88: Proceedings of the Fourth Annual Symposium on Computational Geometry, ACM, New York, NY, USA, 1988, pp. 164-171.
21. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction (Monographs in Computer Science) 1985, Springer.
22. Devillers O., Pion S., Teillaud M., Prisme P. Walking in a triangulation. International Journal of Foundations of Computer Science 2002, 12(3):193-205.
23. Reinelt G. TSPLIB-a traveling salesman problem library. Journal on Computing 1991, 3(4):376-384.
24. D. Applegate, R. Bixby, V. Chvátal, W. Cook, CONCORDE TSP solver, 2003 (cited 8 July 2010). http://www.tsp.gatech.edu/concorde.html.
25. T. Yamakawa, K. Horio, M. Hoshino, Self-organizing map with input data represented as graph, in: ICONIP (1), 2006, pp. 907-914.
26. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 2000, 126(1):106-130.
27. Applegate D., Cook W., Rohe A. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 2003, 15(1):82-92.
28. Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Operations Research 1992, 40(6):1086-1094.
29. Saha M., Roughgarden T., Latombe J.-C., Sánchez-Ante G. Planning tours of robotic arms among partitioned goals. International Journal of Robotics Research 2006, 25(3):207-223.
30. J. Faigl, M. Kulich, L. Přeučil, A sensor placement algorithm for a mobile robot inspection planning, Journal of Intelligent & Robotic Systems doi:10.1007/s10846-010-9449-0.
31. Canny J., Reif J. New lower bound techniques for robot motion planning problems. Annual IEEE Symposium on Foundations of Computer Science 1987, 49-60.