The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem

Neural Networks

Volumn 16, Issue 10, 2003, Pages 1499-1525

  Cochrane, E M ^a   Beasley, J E ^b  

^a GLASGOW CALEDONIAN UNIVERSITY   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Co Adaptive Net algorithm; Euclidean Travelling Salesman Problem; Self Organising NN

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MECHANISMS; TRAVELING SALESMAN PROBLEM;

EUCLIDEAN PLANE;

NEURAL NETWORKS;

ALGORITHM; ARTIFICIAL NEURAL NETWORK; CITY; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; REVIEW; SYSTEM ANALYSIS; TRAVEL;

EID: 0242662140     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(03)00056-X     Document Type: Review

References (57)

1. Al-Mulhem M., Al-Maghrabi T. Efficient convex-elastic net algorithm to solve the euclidean traveling salesman problem. IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics. 28:1998;618-620.
2. Altinel I.K., Aras N., Oommen B.J. Fast, efficient and accurate solutions to the hamiltonian path problem using neural approaches. Computers and Operations Research. 27:2000;461-494.
3. Amin S. A self-organised travelling salesman. Neural Computing and Applications. 2:1994;129-133.
4. Amin S., Fernández-Villacañas J.-L., Cochrane P. A natural solution to the travelling salesman problem. British Telecommunications Engineering. 13:1994;117-122.
5. Angéniol B., de La Croix Vaubois G., Le Texier J.-Y. Self-organizing feature maps and the travelling salesman problem. Neural Networks. 1:1988;289-293.
6. Aras N., Altinel I.K., Oommen J. A Kohonen-like decomposition method for the traveling salesman problem - KNIES_DECOMPOSE. Horn W. Proceedings of ECAI 2000: The 14th European Conference on Artificial Intelligence. 2000;261-265. Berlin, Germany.
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. 12:1999;1273-1284.
8. de Boeres M.C.S., de Carvalho L.F.V., Barbosa V.C. A faster elastic-net algorithm for the traveling salesman problem. IJCNN, International Joint Conference on Neural Networks, Baltimore, Maryland. 1992;. pp. II-215-II-220.
9. Budinich M. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Computation. 8:1996;416-424.
10. Budinich M. Neural networks for NP-complete problems. Nonlinear Analysis, Theory, Methods and Applications. 30:1997;1617-1624.
11. Burke L.I. Neural methods for the traveling salesman problem: insights from operations research. Neural Networks. 7:1994;681-690.
12. Burke L. Conscientious neural nets for tour construction in the traveling salesman problem: the Vigilant net. Computers and Operations Research. 23:1996;121-129.
13. Burke L.I., Damany P. The guilty net for the traveling salesman problem. Computers and Operations Research. 19:1992;255-265.
14. Burke L.I., Ignizio J.P. Neural networks and operations research: an overview. Computers and Operations Research. 19:1992;179-189.
15. Burr D.J. An improved elastic net method for the traveling salesman problem (Vol. 1). Proceedings of the IEEE International Conference on Neural Networks, San Diego, CA. 1988;. pp.I-69-I-76.
16. Cochrane, E. M (1998). An adaptive neural network approach to the Euclidean travelling salesman problem: Theory and application. PhD Thesis, Imperial College, University of London.
17. Dongarra, J. J (2001). Performance of various computers using standard linear equations softwarex. Available at http://www.netlib.org/benchmark/ performance.ps .
18. Durbin R., Szeliski R., Yuille A. An analysis of the elastic net approach to the traveling salesman problem. Neural Computation. 1:1989;348-358.
19. Durbin R., Willshaw D. An analogue approach to the travelling salesman problem using an elastic net method. Nature. 326:1987;689-691.
20. Favata F., Walker R. A study of the application of Kohonen-type neural networks to the travelling salesman problem. Biological Cybernetics. 64:1991;463-468.
21. Fort J.C. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem. Biological Cybernetics. 59:1988;33-40.
22. Fritzke B., Wilke P. FLEXMAP - A neural network for the traveling salesman problem with linear time and space complexity. IJCNN'91, Proceedings of the International Joint Conference on Neural Networks, Singapore. 1991;. Updated version (1995) available from http://www.ki.inf.tu-dresden.de/ ∼fritzke/papers/papers.html.
23. Garey M.R., Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness. 1979;W.H. Freeman, San Francisco.
24. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research. 126:2000;106-130.
25. Hérault L., Niez J.-J. Neural networks and combinatorial optimization: a study of np-complete graph problems. Gelenbe E. Neural networks: Advances and applications. 1991;164-213 North-Holland, Amsterdam.
26. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biological Cybernetics. 52:1985;141-152.
27. Hueter G.J. Solution of the traveling salesman problem with an adaptive ring. Proceedings of the IEEE International Conference on Neural Networks, San Diego, CA. 1988;. pp.I-85-I-92.
28. Johnson D.S., McGeoch L.A. Experimental analysis of heuristics for the STSP. Gutin G., Punnen A. Traveling salesman problem and its variations. 2001;Kluwer Academic Publishers, Dordrecht. Draft version (2001) currently available from http://www.research.att.com/∼dsj/papers/stspchap.ps.
29. Johnson D.S., Papadimitriou C.H. Computational complexity. Lawler E.L., Lenstra J.K., Rinnoy-Kan A.H.G., Shmoys D.B. The travelling salesman problem: A guided tour of combinatorial optimization. 1985;37-85 Wiley, Chichester.
30. Juenger M., Reinelt G., Rinaldi G. The travelling salesman problem. Ball M., Magnanti T., Monma C.L., Nemhauser G. Handbook in operations research and management sciences: Networks. Vol. 7:1995;North-Holland, Amsterdam.
31. Kim S.-J., Kim J.-H., Choi H.-M. An efficient algorithm for traveling salesman problems based on self-organizing feature maps. Proceedings of the Second IEEE International Conference on Fuzzy Systems/International Conference on Neural Networks (ICNN'93), San Francisco, CA. 1993;. pp. 1085-1090.
32. Kohonen T. Self-organized formation of topologically correct feature maps. Biological Cybernetics. 43:1982;59-69.
33. Kohonen T. Self-organizing maps. 2nd ed Springer series in information sciences. 1997;Springer, Berlin.
34. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The travelling salesman problem: A guided tour of combinatorial optimization. 1985;Wiley, Chichester.
35. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling-salesman problem. Operations Research. 21:1973;498-516.
36. Looi C.-K. Neural network methods in combinatorial optimization. Computers and Operations Research. 19:1992;191-208.
37. Matsuyama Y. Competitive self-organization and combinatorial optimization: applications to traveling salesman problem. Proceedings of the International Joint Conference on Neural Networks (IJCNM-90), San Diego, CA. 1990;. pp. III-819-III-824.
38. Matsuyama Y. Self-organizing neural networks and various euclidean traveling salesman problems. Systems and Computers in Japan. 2:1992;101-112.
39. Mérida-Casermeiro E., Galán-Marín G., Muñoz-Peréz J. An efficient multivalued Hopfield network for the traveling salesman problem. Neural Processing Letters. 14:2001;203-216.
40. Munehisa T., Kobayashi M., Yamazaki H. Cooperative updating in the Hopfield model. IEEE Transactions on Neural Networks. 12:2001;1243-1251.
41. Ootake N., Nagasaka K. The composition of Chaos Hopfield neural network and Gaussian machine to the traveling salesman problem. Proceedings of the Fifth International Conference on Neural Information Processing (Jointly with JNNS'98), Kitakyushu, Japan. 1998;. pp. 221-224.
42. Peng M., Gupta N.K., Armitage A.F. An investigation into the improvement of local minima of the Hopfield network. Neural Networks. 9:1996;1241-1253.
43. Peterson C. Parallel distributed approaches to combinatorial optimization: benchmark studies on traveling salesman problem. Neural Computation. 2:1990;261-269.
44. Potvin J.-Y. The traveling salesman problem: a neural network perspective. ORSA Journal on Computing. 5:1993;328-348.
45. Reeves C.R. Modern heuristic techniques for combinatorial problems. 1993;Blackwell Scientific Publications, Oxford.
46. Reinelt G. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing. 3:1991;376-384.
47. Reinelt G. The traveling salesman: Computational solutions for tsp applications. Lecture notes in computer science. Vol. 840:1994;Springer, Berlin.
48. Simmen M.W. Parameter sensitivity of the elastic net approach to the traveling salesman problem. Neural Computation. 3:1991;363-374.
49. Smith K.A. Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS Journal on Computing. 11:1999;15-34.
50. Somhom S., Modares A., Enkawa T. A self-organising model for the travelling salesman problem. Journal of the Operational Research Society. 48:1997;919-928.
51. Stone J.V. The optimal elastic net: Finding solutions to the travelling salesman problem. Aleksander I., Taylor J. Artificial Neural Networks. Proceedings of the 1992 International Conference on Artificial Neural Networks (ICANN-92). Vol. 2:1992;1077-1080.
52. Sun K.T., Fu H.C. A hybrid neural network model for solving optimization problems. IEEE Transactions on Computers. 42:1993;218-227.
53. Vakhutinsky A.I., Golden B.L. A hierarchical strategy for solving traveling salesman problems using elastic nets. Journal of Heuristics. 1:1995;67-76.
54. Wilson G.V., Pawley G.S. On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biological Cybernetics. 58:1988;63-70.
55. Wolfe W.J., Duca F.A. Summary of the neural centroid TSP. Rogers S.K., Fogel D.B., Bezdek J.C., Bosacchi B. Applications and science of computational intelligence. Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3390:1998;50-56.
56. Wolfe W.J., Fuzzy A. Hopfield-tank traveling salesman problem model. INFORMS Journal on Computing. 11:1999;329-344.
57. Zeng X., Martinez T.R. Graded rescaling in Hopfield networks. Neruda R., Karny M. Artificial neural nets and genetic algorithms. 2001;63-66.