论文信息 - A hierarchical strategy for solving traveling salesman problems using elastic nets

A hierarchical strategy for solving traveling salesman problems using elastic nets

In this article, we focus on implementing the elastic net method to solve the traveling salesman problem using a hierarchical approach. The result is a significant speed-up, which is studied both analytically and experimentally.

Bruce L. Golden | Andrew I. Vakhutinsky | B. Golden | A. Vakhutinsky

[1] Jean-Yves Potvin,et al. THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE , 1993 .

[2] M.C.S. Boeres,et al. A faster elastic-net algorithm for the traveling salesman problem , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[3] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[4] David M. Stein,et al. Scheduling Dial-a-Ride Transportation Systems , 1978 .

[5] SzeliskiRichard,et al. An analysis of the elastic net approach to the traveling salesman problem , 1989 .

[6] Tao Sun,et al. A fast optimization method based on a hierarchical strategy for the travelling salesman problem , 1993 .

[7] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[8] Martin W. Simmen. Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem , 1991, Neural Computation.

[9] Richard Szeliski,et al. An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.

[10] Bruce L. Golden,et al. Solving vehicle routing problems using elastic nets , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).