A kohonen-like decomposition method for the Euclidean traveling salesman problem - KNIES_DECOMPOSE

IEEE Transactions on Neural Networks

Volumn 14, Issue 4, 2003, Pages 869-890

  Aras, Necati ^a   Altmel, I Kuban ^a   Oommen, John ^b  

^a BOGAZICI UNIVERSITY   (Turkey)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Combinatorial optimization; Decomposition; Euclidean traveling salesman problem (TSP); Kohonen; Neural networks; Self organizing maps

Indexed keywords

COMPUTATIONAL COMPLEXITY; HAMILTONIANS; HEURISTIC METHODS; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION;

NEURAL NETWORKS;

EID: 0043026760     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2003.811562     Document Type: Article

References (47)

1. S. V. B. Aiyer, "Solving Combinatorial Optimization Problems Using Neural Networks," Cambridge Univ., Cambridge, U.K., CUED/F - INFEGNG/TR89, 1991.
2. İ. K. Altmel, B. J. Oommen, and N. Aras, "Vector quantization for arbitrary distance function estimation," INFORMS J. Computing, vol. 9, pp. 439-451, 1997.
3. İ. K. Altmel, N. Aras, and B. J. Oommen, "Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches," Comput. Operations Res., vol. 27, pp. 461-494, 2000.
4. B. Angéniol, C. Vaubois, and J. Y. Le Texier, "Self-organizing feature maps and the traveling salesman problem," Neural Networks, vol. 1, pp. 289-293, 1988.
5. D. Applegate, R. Bixby, and W. Cook, "On the Solution of Traveling Salesman Problems," Rice Univ., Houston, TX, CRPC - TR98744, 1998.
6. N. Aras, "New Neurocomputational Approaches for Estimating Road Travel Distances and for Solving the Euclidean Traveling Salesman Problem, " Ph.D. dissertation, Boǧaziçi Univ., Istanbul, Turkey, 1999.
7. N. Aras, İ. K. Altinel, and B. J. Oommen, "A Kohonen like decomposition method for travelling salesman problem-KNIES_DECOMPOSE," in Proc. 14th European Conf. Artificial Intelligence, W. Horn, Ed., 2000, pp. 261-265.
8. N. Aras, J. Oommen, and İ. K. Altmel, "Kohonen network incorporating explicit statistics and its application to the traveling salesman problem," Neural Networks, vol. 12, pp. 1273-1284, 1999.
9. N. Ascheuer, "Hamiltonian Path Problems in the On-Line Optimization of Flexible Manufacturing Systems,", Berlin, TR 96-3, ZIB, 1996.
10. M. Budinich, "A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing," Neural Comput., vol. 8, pp. 416-424, 1996.
11. M. Budinich and B. Rosario, "A neural network for the traveling salesman problem with a well behaved energy function," in Math. Neural Networks, Models, Algorithms, and Applications, S. W. Ellacott, J. C. Mason, and I. J. Anderson, Eds. Boston, MA: Kluwer, 1997.
12. L. I. Burke and P. Damany, "The guilty net for the traveling salesman problem," Comput. Operations Res., vol. 19, no. 3/4, pp. 255-265, 1992.
13. L. I. Burke, "Neural methods for the traveling salesman problem: Insights from operations research," Neural Networks, vol. 7, pp. 681-690, 1994.
14. _, "Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net," Comput. Operations Res., vol. 23, pp. 121-129, 1996.
15. A. Cichocki and R. Unbehauen, Neural Networks for Optimization and Signal Processing. Chichester, U.K.: Wiley, 1994.
16. D. DeSieno, "Adding a conscience mechanism to competitive learning," Proc. IEEE Int. Conf. Neural Networks, vol. 1, pp. 117-124, 1988.
17. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
18. R. Durbin and D. Willshaw, "An analogue approach to the travelling salesman problem using an elastic net method," Nature, vol. 326, pp. 689-691, 1987.
19. J. C. Fort, "Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the travelling salesman problem," Biol. Cybern., vol. 59, pp. 33-40, 1988.
20. K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd ed. San Diego: Academic, 1990.
21. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, Ed. New York, 1979.
22. A. H. Gee, S. V. B. Aiyer, and R. W. Prager, "An analytical framework for optimizing neural networks," Neural Networks, vol. 6, pp. 79-97, 1993.
23. A. H. Gee and R. W. Prager, "Limitations of neural networks for solving traveling salesman problem," IEEE Trans. Neural Networks, vol. 6, pp. 280-282, Mar. 1995.
24. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybem., vol. 52, pp. 141-152, 1985.
25. G. J. Hueter, "Solution of the traveling salesman problem with an adaptive ring," Proc. IEEE Int. Conf. Neural Networks, pp. 1-85-92, 1988.
26. C. Jeffreys and T. Niznik, "Easing the conscience of the guilty net," Comput. Operations Res., vol. 21, pp. 961-968, 1994.
27. D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study," in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds. Chichester, U.K.: Wiley, 1997, pp. 215-310.
28. R. Karp, "Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane," Math. Operations Res., vol. 2, pp. 209-224, 1977.
29. T. Kohonen, "The self-organizing map," Proc. IEEE, vol. 78, pp. 1464-1480, Sept. 1990.
30. _, Self-Organizing Maps. Berlin, Germany: Springer-Verlag, 1995.
31. E. L. Lawler, K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization, Chichester, U.K.: Wiley, 1985.
32. J. D. Litke, "An improved solution to the traveling salesman problem with thousands of nodes," Commun. ACM, vol. 27, pp. 1227-1236, 1984.
33. B. Mirkin, Mathematical Classification and Clustering. Boston: Kluwer, MA 1996.
34. B. J. Oommen, I. K. Altmel, and N. Aras, "Discrete vector quantization for arbitrary distance function estimation," IEEE Trans. Syst., Man, Cybern. B, vol. 28, pp. 496-510, Aug. 1998.
35. C. H. Papadimitriou, "The Euclidean traveling salesman problem is AV-complete," Theoretical Computer Science, vol. 4, pp. 237-244, 1978.
36. J.-Y. Potvin, "The traveling salesman problem: A neural network perspective," ORSA J. Comput., vol. 5, pp. 328-348, 1993.
37. G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA J. Comput., vol. 3, pp. 376-384, 1991.
38. _, The Travelling Salesman. Computational Solutions for TSP Applications. Berlin, Germany: Springer-Verlag, 1994.
39. H. J. Ritter and K. J. Schulten, "Kohonen's self-organizing maps: Exploring their computational capabilities," in Proc. Int. Joint Conf. Neural Networks, 1988, pp. 2455-2460.
40. K. Smith, "An argument for abandoning the traveling salesman problem as a neural network benchmark," IEEE Trans. Neural Networks, vol. 7, pp. 1542-1544, Nov. 1996.
41. _, "A hybrid neural approach to combinatorial optimization," Comput. Operations Res., vol. 23, pp. 597-610, 1996.
42. K. Smith, P. Palaniswami, and M. Krishnamoorthy, "Neural techniques for combinatorial optimization with applications," IEEE Trans. Neural Networks, vol. 9, pp. 1301-1318, Nov. 1998.
43. K. Smith, "Neural networks for combinatorial optimization: A review of more than a decade of research," INFORMS J. Comput., vol. 11, no. 1, pp. 15-34, 1999.
44. A. Vakhutinsky and B. L. Golden, "A hierarchical strategy for solving traveling salesman problem using elastic nets," J. Heuristics, vol. 1, pp. 67-76, 1995.
45. M. S. Waterman, Introduction to Computational Biology. London, U.K.: Chapman and Hall, 1995.
46. W. J. Wolfe, "A fuzzy Hopfield-tank traveling salesman problem model," INFORMS J. Comput., vol. 11, pp. 329-344, 1999.
47. Y.-F. Wong, "A comparative study of the Kohonen self-organizing map and the elastic net," Computational Learning Theory and Natural Learning Systems, vol. 2, pp. 401-413, 1996.