메뉴 건너뛰기




Volumn 18, Issue 11, 2008, Pages 1417-1422

Ant colony optimization method for generalized TSP problem

Author keywords

2 OPT; Ant colony optimization; Generalized traveling salesman problem; Mutation

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOCKS (FASTENERS); NUMERICAL METHODS; TRAVELING SALESMAN PROBLEM;

EID: 56849088786     PISSN: 10020071     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.pnsc.2008.03.028     Document Type: Article
Times cited : (206)

References (24)
  • 1
    • 0002444551 scopus 로고
    • The traveling salesman problem: a survey
    • M. Bellmore G.L. Nemhauser The traveling salesman problem: a survey Oper Res 16 1968 538 558
    • (1968) Oper Res , vol.16 , pp. 538-558
    • Bellmore, M.1    Nemhauser, G.L.2
  • 2
    • 0000904077 scopus 로고
    • Messy genetic algorithms: motivation, analysis, and first results
    • D.E. Goldberg Messy genetic algorithms: motivation, analysis, and first results Complex Syst 3 1989 493 530
    • (1989) Complex Syst , vol.3 , pp. 493-530
    • Goldberg, D.E.1
  • 3
    • 1542382123 scopus 로고    scopus 로고
    • Solving constrained traveling salesman problems by genetic algorithms
    • L. Huang C.G. Zhou K.P. Wang Solving constrained traveling salesman problems by genetic algorithms Prog Nat Sci 13 2003 295 299
    • (2003) Prog Nat Sci , vol.13 , pp. 295-299
    • Huang, L.1    Zhou, C.G.2    Wang, K.P.3
  • 4
    • 0037312001 scopus 로고    scopus 로고
    • Solving traveling salesman problems by genetic algorithms
    • Y.C. Liang H.W. Ge C.G. Zhou Solving traveling salesman problems by genetic algorithms Prog Nat Sci 13 2003 135 141
    • (2003) Prog Nat Sci , vol.13 , pp. 135-141
    • Liang, Y.C.1    Ge, H.W.2    Zhou, C.G.3
  • 5
    • 5644253415 scopus 로고    scopus 로고
    • Hybrid ant colony algorithm for traveling salesman problem
    • C.G. Wu Y.C. Liang H.P. Lee Hybrid ant colony algorithm for traveling salesman problem Prog Nat Sci 14 2004 631 637
    • (2004) Prog Nat Sci , vol.14 , pp. 631-637
    • Wu, C.G.1    Liang, Y.C.2    Lee, H.P.3
  • 6
    • 0030247388 scopus 로고    scopus 로고
    • Genetic algorithms and traveling salesman problems
    • S. Chatterjee C. Carrera L.A. Lynch Genetic algorithms and traveling salesman problems Eur J Oper Res 93 3 1996 490 510
    • (1996) Eur J Oper Res , vol.93 , Issue.3 , pp. 490-510
    • Chatterjee, S.1    Carrera, C.2    Lynch, L.A.3
  • 7
    • 0012394011 scopus 로고
    • The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem
    • A.L. Henry-Labordere The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem RIRO B 2 1969 43 49
    • (1969) RIRO B , vol.2 , pp. 43-49
    • Henry-Labordere, A.L.1
  • 8
    • 0012474120 scopus 로고
    • Mathematical model for scheduling clients through welfare agencies
    • J.P. Saskena Mathematical model for scheduling clients through welfare agencies CORS J 8 1970 185 200
    • (1970) CORS J , vol.8 , pp. 185-200
    • Saskena, J.P.1
  • 9
    • 0012394013 scopus 로고
    • Generalized traveling salesman problem through n sets of nodes
    • S.S. Srivastava Generalized traveling salesman problem through n sets of nodes CORS J 7 1969 97 101
    • (1969) CORS J , vol.7 , pp. 97-101
    • Srivastava, S.S.1
  • 10
    • 0031040665 scopus 로고    scopus 로고
    • The dynamic programming method in the generalized traveling salesman problem
    • A.G. Chentsov L.N. Korotayeva The dynamic programming method in the generalized traveling salesman problem Math Comput Model 25 1997 93 105
    • (1997) Math Comput Model , vol.25 , pp. 93-105
    • Chentsov, A.G.1    Korotayeva, L.N.2
  • 11
    • 0031144089 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
    • M. Fischetti J.J. Salazar P. Toth A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Oper Res 45 1997 378 394
    • (1997) Oper Res , vol.45 , pp. 378-394
    • Fischetti, M.1    Salazar, J.J.2    Toth, P.3
  • 12
    • 33746503980 scopus 로고    scopus 로고
    • A random-key genetic algorithm for the generalized traveling salesman problem
    • L.V. Snyder M.S. Daskin A random-key genetic algorithm for the generalized traveling salesman problem Eur J Oper Res 174 2006 38 53
    • (2006) Eur J Oper Res , vol.174 , pp. 38-53
    • Snyder, L.V.1    Daskin, M.S.2
  • 13
    • 85036391384 scopus 로고    scopus 로고
    • A generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining
    • C.G. Wu Y.C. Liang H.P. Lee A generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining Phys Rev E 70 2004 016701
    • (2004) Phys Rev E , vol.70 , pp. 016701
    • Wu, C.G.1    Liang, Y.C.2    Lee, H.P.3
  • 14
    • 85119774933 scopus 로고    scopus 로고
    • Tasgetiren MF, Suganthan PN, Pan QK. A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: Proceedings of the ninth annual conference on genetic and evolutionary computation; 2007. p. 158–67.
  • 15
    • 34250187782 scopus 로고    scopus 로고
    • Particle swarm optimization-based algorithms for TSP and generalized TSP
    • X.H. Shi Y.C. Liang H.P. Lee Particle swarm optimization-based algorithms for TSP and generalized TSP Inf Process Lett 103 2007 169 176
    • (2007) Inf Process Lett , vol.103 , pp. 169-176
    • Shi, X.H.1    Liang, Y.C.2    Lee, H.P.3
  • 16
    • 48049114581 scopus 로고    scopus 로고
    • Solving traveling salesman problems using generalized chromosome genetic algorithm
    • J.H. Yang C.G. Wu H.P. Lee Solving traveling salesman problems using generalized chromosome genetic algorithm Prog Nat Sci 18 7 2008 887 892
    • (2008) Prog Nat Sci , vol.18 , Issue.7 , pp. 887-892
    • Yang, J.H.1    Wu, C.G.2    Lee, H.P.3
  • 17
    • 85119744873 scopus 로고    scopus 로고
    • Dorigo M. Optimization, learning and natural algorithms [in Italian]. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy; 1992. p. 140.
  • 18
    • 0030082551 scopus 로고    scopus 로고
    • The ant system: optimization by a colony of cooperating agents
    • M. Dorigo V. Maniezzo A. Colorni The ant system: optimization by a colony of cooperating agents IEEE Trans Syst Man Cybern B 26 1 1996 1 13
    • (1996) IEEE Trans Syst Man Cybern B , vol.26 , Issue.1 , pp. 1-13
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 19
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: a cooperative learning approach to the traveling salesman problem
    • M. Dorigo L. Ganbardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans Evol Comput 1 1 1997 53 66
    • (1997) IEEE Trans Evol Comput , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Ganbardella, L.2
  • 20
    • 85119776860 scopus 로고    scopus 로고
    • Stutzle T, Hoos HH. The maxmin ant system and the local search for the traveling salesman problem. In: IEEE international conference on evolutionary computing, Piscataway, NJ; 1997. p. 309–15.
  • 21
    • 0002012598 scopus 로고    scopus 로고
    • The ant colony optimization meta-heuristic
    • M. Dorigo G.Di. Caro The ant colony optimization meta-heuristic New ideas in optimization 1999 McGraw-Hill London 11 32
    • (1999) , pp. 11-32
    • Dorigo, M.1    Caro, G.Di.2
  • 23
    • 0033102347 scopus 로고    scopus 로고
    • Guided local search and its application to the traveling salesman problem
    • C. Voudouris E. Tsang Guided local search and its application to the traveling salesman problem Eur J Oper Res 113 1999 469 499
    • (1999) Eur J Oper Res , vol.113 , pp. 469-499
    • Voudouris, C.1    Tsang, E.2
  • 24
    • 0026225350 scopus 로고
    • TSPLIB – a traveling salesman problem library
    • G. Reinelt TSPLIB – a traveling salesman problem library ORSA J Comput 3 1991 376 384
    • (1991) ORSA J Comput , vol.3 , pp. 376-384
    • Reinelt, G.1


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