메뉴 건너뛰기




Volumn 172, Issue 1, 2006, Pages 603-623

The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP

Author keywords

Combinatorial optimization; Neural networks; Self organizing maps; Traveling salesman problem

Indexed keywords

ADAPTIVE ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MAPS; MATHEMATICAL TECHNIQUES; NEURAL NETWORKS; OPTIMAL SYSTEMS; OPTIMIZATION;

EID: 31144469869     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.02.025     Document Type: Article
Times cited : (11)

References (14)
  • 1
    • 19044391501 scopus 로고
    • The Euclidean traveling salesman problem is NP-complete
    • C.H. Papadimitriou The Euclidean traveling salesman problem is NP-complete Theoretical Computer Science 4 1978 237 244
    • (1978) Theoretical Computer Science , vol.4 , pp. 237-244
    • Papadimitriou, C.H.1
  • 2
    • 0000511953 scopus 로고
    • Parallel distributed approaches to combinatorial optimization: Benchmark studies on traveling salesman problem
    • C. Peterson Parallel distributed approaches to combinatorial optimization: benchmark studies on traveling salesman problem Neural Computation 2 1990 261 269
    • (1990) Neural Computation , vol.2 , pp. 261-269
    • Peterson, C.1
  • 3
    • 0021835689 scopus 로고
    • Neural computation of decisions in optimization problems
    • J.J. Hopfield, and D.W. Tank Neural computation of decisions in optimization problems Biological Cybernetics 52 1985 141 152
    • (1985) Biological Cybernetics , vol.52 , pp. 141-152
    • Hopfield, J.J.1    Tank, D.W.2
  • 5
    • 0032853386 scopus 로고    scopus 로고
    • Kohonen network incorporating explicit statistics and its application to the traveling salesman problem
    • N. Aras, B.J. Oommen, and I.K. Altinel Kohonen network incorporating explicit statistics and its application to the traveling salesman problem Neural Networks 12 1999 1273 1284
    • (1999) Neural Networks , vol.12 , pp. 1273-1284
    • Aras, N.1    Oommen, B.J.2    Altinel, I.K.3
  • 6
    • 0032790197 scopus 로고    scopus 로고
    • Competition-based neural network for the multiple traveling salesman problem with minmax objective
    • S. Somhom, A. Modares, and T. Enkawa Competition-based neural network for the multiple traveling salesman problem with minmax objective Computers and Operations Research 26 1999 395 407
    • (1999) Computers and Operations Research , vol.26 , pp. 395-407
    • Somhom, S.1    Modares, A.2    Enkawa, T.3
  • 7
    • 0001633383 scopus 로고
    • A study of the application of Kohonen-type neural networks to the traveling salesman problem
    • S. Favata, and R. Walker A study of the application of Kohonen-type neural networks to the traveling salesman problem Biological Cybernetics 64 1991 463 468
    • (1991) Biological Cybernetics , vol.64 , pp. 463-468
    • Favata, S.1    Walker, R.2
  • 9
    • 0023707894 scopus 로고
    • Solving combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling sales-man problem
    • J.C. Fort Solving combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling sales-man problem Biological Cybernetics 59 1988 33 40
    • (1988) Biological Cybernetics , vol.59 , pp. 33-40
    • Fort, J.C.1
  • 10
    • 0024127287 scopus 로고
    • Self-organizing feature maps and the traveling salesman problem
    • B. Ange'niol, C. Vaubois, and J.Y. Le Texier Self-organizing feature maps and the traveling salesman problem Neural Networks 1 1988 289 293
    • (1988) Neural Networks , vol.1 , pp. 289-293
    • Ange'Niol, B.1    Vaubois, C.2    Le Texier, J.Y.3
  • 12
    • 27744589982 scopus 로고    scopus 로고
    • An efficient approach to the traveling salesman problem using self-organizing maps
    • C.V. Frederico, D.D.N. Adiao, and A.F. Jose An efficient approach to the traveling salesman problem using self-organizing maps International Journal of Neural Systems 13 2 2003 59 66
    • (2003) International Journal of Neural Systems , vol.13 , Issue.2 , pp. 59-66
    • Frederico, C.V.1    Adiao, D.D.N.2    Jose, A.F.3
  • 13
    • 31144477307 scopus 로고    scopus 로고
    • http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
  • 14
    • 0026853637 scopus 로고
    • The guilty net for the traveling salesman problem
    • L.I. Burke, and P. Damany The guilty net for the traveling salesman problem Computer & Operations Research 19 1992 255 265
    • (1992) Computer & Operations Research , vol.19 , pp. 255-265
    • Burke, L.I.1    Damany, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.