Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks

Neural Networks

Volumn 16, Issue 5-6, 2003, Pages 827-832

  Mulder, Samuel A ^a   Wunsch II, Donald C ^a  

^a Architectural and Environmental Engineering   (United States)

Author keywords

Adaptive resonance theory; Lin Kernighan algorithm; Traveling salesman problem

Indexed keywords

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

ADAPTIVE RESONANCE THEORY (ART);

NEURAL NETWORKS;

ALGORITHM; ANALYTIC METHOD; CLUSTER ANALYSIS; CONFERENCE PAPER; DATA ANALYSIS; PERFORMANCE; PRIORITY JOURNAL; PROBLEM SOLVING; QUALITATIVE ANALYSIS; QUALITY CONTROL; RANDOMIZATION; SCALE UP; STANDARDIZATION; SYSTEM ANALYSIS; TECHNIQUE; THEORY; TRAVELING SALESMAN PROBLEM;

EID: 0038355077     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(03)00130-8     Document Type: Conference Paper

References (16)

1. Agarwala, R., Applegate, D.L., Maglott, D., Schuler, G.D., & Schaffler, A.A (2000). A fast and scalable radiation hybrid map construction and integration strategy. http://www.ncbi.nlm.nih.gov/genome/rhmap/.
2. Applegate, D., Bixby, R., Chvatal, V., & Cook, W (2001). Concorde - A code for solving traveling salesman problems. http://www.math.princeton.edu/tsp/concorde.html.
3. Applegate, D., Cook, W., & Rohe, A (2000). Chained Lin-Kernighan for large traveling salesman problems. Technical report http://www.keck.caam.rice.edu/reports/chained lk.ps.
4. Aurora S. Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems. Journal of the ACM. 45:(5):1998;753-782.
5. Bailey C.A., McLain T.W., Beard R.W. Fuel saving strategies for dual spacecraft interferometry missions. Journal of the Astronatical Science. 2003;. in press.
6. Braun M.L., Buhmann J.M. The noisy Euclidean traveling salesman problem and learning. Advances in neural information processing systems. 2002;MIT Press, Cambridge, MA.
7. Carpenter G., Grossberg S. The art of adaptive pattern recognition by a self-organizing neural network. IEEE Computer. March:1988;47-88.
8. Cochrane E.M., Cochrane J.M. Exploring competition and co-operation for solving the Euclidean traveling salesman problem by using the self-organizing map. Artificial Neural Networks. 1:1999;180-185.
9. Cormen T., Leiserson C., Rivest R. Introduction to algorithms. 1996;MIT Press, Cambridge, MA. pp. 954-960.
10. Johnson D., McGeoch L. Experimental analysis of heuristics for the STSP. Gutin G., Punnen A. The traveling salesman problem and its variations. 2002;369-487 Kluwer Academic Publishers, Boston.
11. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research. 21:1973;498-516.
12. Moscoto, P (2002). TSPBIBHome Page. http://www.densis.fee.unicamp.br/~moscato/TSPBIB_home.html.
13. Papadimitriou C.H. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science. 4:1977;237-244.
14. Rego C., Glover F. Local search and metaheuristics. Gutin G., Punnen A. The traveling salesman problem and its variations. 2002;309-368 Kluwer Academic Publishers, Boston.
15. Turino, J (2002). ASIC DFT and BIST Alternatives. http://www.chipcenter.com/asic/tn004.html.
16. Vishwanathan, N., & Wunsch, D (2001). A Hybrid Approach to the TSP. IEEE International Joint Conference on Neural Networks, Washington, DC.