메뉴 건너뛰기




Volumn 179, Issue 10, 2009, Pages 1454-1468

A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem

Author keywords

Artificial immune systems; Artificial neural networks; Combinatorial optimization; Self organizing networks; Traveling salesman problem

Indexed keywords

BACKPROPAGATION; COMBINATORIAL OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; IMMUNOLOGY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EID: 61749097897     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.12.016     Document Type: Article
Times cited : (124)

References (42)
  • 1
    • 0024127287 scopus 로고
    • Self-organizing feature maps and the travelling salesman problem
    • Angeniol B., Croix Vaubois G., and Le Texier J.-Y. Self-organizing feature maps and the travelling salesman problem. Neural Networks 1 (1988) 289-293
    • (1988) Neural Networks , vol.1 , pp. 289-293
    • Angeniol, B.1    Croix Vaubois, G.2    Le Texier, J.-Y.3
  • 3
    • 0032853386 scopus 로고    scopus 로고
    • The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem
    • Aras N., Oommen B.J., and Altinel I.K. The Kohonen network incorporating explicit statistics and its application to the travelling 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
  • 5
    • 0030082682 scopus 로고    scopus 로고
    • "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net
    • Burke L. "Conscientious" neural nets for tour construction in the traveling salesman problem: the vigilant net. Computers and Operations Research 23 (1996) 121-129
    • (1996) Computers and Operations Research , vol.23 , pp. 121-129
    • Burke, L.1
  • 6
    • 0028272636 scopus 로고
    • Neural methods for the traveling salesman problem: insights from operations research
    • Burke L.I. Neural methods for the traveling salesman problem: insights from operations research. Neural Networks 7 (1994) 681-690
    • (1994) Neural Networks , vol.7 , pp. 681-690
    • Burke, L.I.1
  • 7
    • 0026853637 scopus 로고
    • The guilty net for the traveling salesman problem
    • Burke L.I., and Damany P. The guilty net for the traveling salesman problem. Computers and Operations Research 19 (1992) 255-265
    • (1992) Computers and Operations Research , vol.19 , pp. 255-265
    • Burke, L.I.1    Damany, P.2
  • 8
    • 0242662140 scopus 로고    scopus 로고
    • The co-adaptive neural network approach to the Euclidean travelling salesman problem
    • Cochrane E.M., and Beasley J.E. The co-adaptive neural network approach to the Euclidean travelling salesman problem. Neural Networks 16 (2003) 1499-1525
    • (2003) Neural Networks , vol.16 , pp. 1499-1525
    • Cochrane, E.M.1    Beasley, J.E.2
  • 9
    • 0000454153 scopus 로고
    • Solution of a large-scale traveling salesman problem
    • Dantzig G., Fulkerson R., and Johnson S. Solution of a large-scale traveling salesman problem. Operations Research 2 (1954) 393-410
    • (1954) Operations Research , vol.2 , pp. 393-410
    • Dantzig, G.1    Fulkerson, R.2    Johnson, S.3
  • 11
    • 33847773326 scopus 로고    scopus 로고
    • Fundamentals of natural computing: an overview
    • de Castro L.N. Fundamentals of natural computing: an overview. Physics of Life Reviews 4 (2007) 1-36
    • (2007) Physics of Life Reviews , vol.4 , pp. 1-36
    • de Castro, L.N.1
  • 12
    • 0023657610 scopus 로고
    • An analogue approach to the travelling salesman problem using an elastic net method
    • Durbin R., and Willshaw D. An analogue approach to the travelling salesman problem using an elastic net method. Nature 326 (1987) 689-691
    • (1987) Nature , vol.326 , pp. 689-691
    • Durbin, R.1    Willshaw, D.2
  • 13
    • 33845433823 scopus 로고    scopus 로고
    • Exchange strategies for multiple ant colony system
    • Ellabib I., Calamai P., and Basir O. Exchange strategies for multiple ant colony system. Information Sciences 177 (2007) 1248-1264
    • (2007) Information Sciences , vol.177 , pp. 1248-1264
    • Ellabib, I.1    Calamai, P.2    Basir, O.3
  • 14
    • 0001633383 scopus 로고
    • A study of the application of Kohonen-type neural networks to the travelling salesman problem
    • Favata F., and Walker R. A study of the application of Kohonen-type neural networks to the travelling salesman problem. Biological Cybernetics 64 (1991) 463-468
    • (1991) Biological Cybernetics , vol.64 , pp. 463-468
    • Favata, F.1    Walker, R.2
  • 15
    • 0023707894 scopus 로고
    • Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem
    • 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
    • (1988) Biological Cybernetics , vol.59 , pp. 33-40
    • Fort, J.C.1
  • 20
    • 0034301999 scopus 로고    scopus 로고
    • An effective implementation of the Lin-Kernighan traveling salesman heuristic
    • Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126 (2000) 106-130
    • (2000) European Journal of Operational Research , vol.126 , pp. 106-130
    • Helsgaun, K.1
  • 24
    • 0003408279 scopus 로고
    • Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds), John Wiley & Sons, Chichester
    • In: Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985), John Wiley & Sons, Chichester
    • (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
  • 26
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling-salesman problem
    • Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 (1973) 498-516
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 27
    • 0026852716 scopus 로고
    • Neural network methods in combinatorial optimization
    • Looi C.-K. Neural network methods in combinatorial optimization. Computers and Operations Research 19 (1992) 191-208
    • (1992) Computers and Operations Research , vol.19 , pp. 191-208
    • Looi, C.-K.1
  • 28
    • 0033899259 scopus 로고    scopus 로고
    • Case injected genetic algorithms for traveling salesman problems
    • Louis S.J., and Li G. Case injected genetic algorithms for traveling salesman problems. Information Sciences 122 (2000) 201-225
    • (2000) Information Sciences , vol.122 , pp. 201-225
    • Louis, S.J.1    Li, G.2
  • 29
    • 51849161638 scopus 로고    scopus 로고
    • Uma Abordagem Neuro-Imune para a Solução do Problema de Múltiplos Caixeiros Viajantes (in Portuguese)
    • Florianópolis, SC, CD-ROM
    • T.A.S. Masutti, L.N. de Castro, Uma Abordagem Neuro-Imune para a Solução do Problema de Múltiplos Caixeiros Viajantes (in Portuguese), in: Proceedings of the VIII Brazilian Conference on Neural Networks, Florianópolis, SC, 2007, (CD-ROM).
    • (2007) Proceedings of the VIII Brazilian Conference on Neural Networks
    • Masutti, T.A.S.1    de Castro, L.N.2
  • 30
    • 0026743862 scopus 로고
    • Self-organizing neural networks and various Euclidean traveling salesman problems
    • Matsuyama Y. Self-organizing neural networks and various Euclidean traveling salesman problems. Systems and Computers in Japan 23 (1992) 101-112
    • (1992) Systems and Computers in Japan , vol.23 , pp. 101-112
    • Matsuyama, Y.1
  • 33
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • Padberg M., and Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33 (1991) 60-100
    • (1991) SIAM Review , vol.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 36
    • 61749092628 scopus 로고    scopus 로고
    • Neural network approach to solving the traveling salesman problem
    • Reilly R., and Tchimev P. Neural network approach to solving the traveling salesman problem. Journal of Computing Sciences in Colleges 19 (2003) 41-61
    • (2003) Journal of Computing Sciences in Colleges , vol.19 , pp. 41-61
    • Reilly, R.1    Tchimev, P.2
  • 37
    • 0026225350 scopus 로고
    • TSPLIB - a traveling salesman problem library
    • Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 3 (1991) 376-384
    • (1991) ORSA Journal on Computing , vol.3 , pp. 376-384
    • Reinelt, G.1
  • 39
    • 0002381070 scopus 로고    scopus 로고
    • Neural networks for combinatorial optimization: a review of more than a decade of research
    • Smith K. Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS Journal on Computing 11 (1999) 15-34
    • (1999) INFORMS Journal on Computing , vol.11 , pp. 15-34
    • Smith, K.1
  • 41
    • 0032790197 scopus 로고    scopus 로고
    • Competition-based neural network for the multiple travelling salesmen problem with minmax objective
    • Somhom S., Modares A., and Enkawa T. Competition-based neural network for the multiple travelling salesmen 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


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