메뉴 건너뛰기




Volumn 235, Issue 9, 2011, Pages 3063-3078

Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

Author keywords

Asymmetric traveling salesman problem; Combinatorial optimization; Genetic algorithm; Interval order relation

Indexed keywords

COMBINATORIAL OPTIMIZATION; DECISION MAKING; GENETIC ALGORITHMS; TRAVEL TIME;

EID: 79951514207     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2010.12.027     Document Type: Article
Times cited : (80)

References (58)
  • 1
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper. Res. 21 1973 498 516
    • (1973) Oper. Res. , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 3
    • 0000454153 scopus 로고
    • Solution of a large-scale traveling-salesman problem
    • G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson Solution of a large-scale traveling-salesman problem Oper. Res. 2 1954 393 410
    • (1954) Oper. Res. , vol.2 , pp. 393-410
    • Dantzig, G.B.1    Fulkerson, D.R.2    Johnson, S.M.3
  • 4
    • 0023313723 scopus 로고
    • Optimization of a 532-city symmetric traveling salesman problem by branch and cut
    • DOI 10.1016/0167-6377(87)90002-2
    • M. Padberg, and G. Rinaldi Optimization of a 532-city symmetric traveling salesman problem by branch and cut Oper. Res. 6 1987 1 7 (Pubitemid 17601864)
    • (1987) Operations Research Letters , vol.6 , Issue.1 , pp. 1-7
    • Padberg, M.1    Rinaldi, G.2
  • 6
    • 34250461535 scopus 로고
    • The traveling salesman problem and minimum spanning trees: Part II
    • M. Held, and R.M. Karp The traveling salesman problem and minimum spanning trees: part II Math. Program. 1 1971 6 25
    • (1971) Math. Program. , vol.1 , pp. 6-25
    • Held, M.1    Karp, R.M.2
  • 7
    • 0019585395 scopus 로고
    • A restricted Lagrangian approach to the traveling salesman problem
    • E. Balas, and N. Christofids A restricted Lagrangian approach to the traveling salesman problem Math. Program. 21 1981 19 46 (Pubitemid 12508253)
    • (1981) Mathematical Programming , vol.21 , Issue.1 , pp. 19-46
    • Balas Egon1    Christofides Nicos2
  • 8
    • 0000546002 scopus 로고
    • Solving large-scale symmetric traveling salesman problems to optimality
    • H. Crowder, and M.W. Padberg Solving large-scale symmetric traveling salesman problems to optimality Manage. Sci. 26 1980 495 509
    • (1980) Manage. Sci. , vol.26 , pp. 495-509
    • Crowder, H.1    Padberg, M.W.2
  • 9
    • 0002931406 scopus 로고
    • On the symmetric traveling salesman problem: A computational study
    • M.W. Padberg, and S. Hong On the symmetric traveling salesman problem: a computational study Math. Prog. Stud. 12 1980 78 107
    • (1980) Math. Prog. Stud. , vol.12 , pp. 78-107
    • Padberg, M.W.1    Hong, S.2
  • 10
    • 0026220441 scopus 로고
    • Solution of large-scale symmetric travelling salesman problems
    • M. Grtschel, and O. Holland Solution of large-scale symmetric traveling salesman problems Math. Program. 51 1991 141 202 (Pubitemid 21708534)
    • (1991) Mathematical Programming, Series B , vol.51 , Issue.2 , pp. 141-202
    • Groetschel Martin1    Holland Olaf2
  • 11
    • 84881579627 scopus 로고
    • Dynamic programming treatment of the traveling salesman problem
    • B.E. Bellman Dynamic programming treatment of the traveling salesman problem J. Assoc. Comput. Mach. 9 1963
    • (1963) J. Assoc. Comput. Mach. , vol.9
    • Bellman, B.E.1
  • 12
    • 33244480636 scopus 로고    scopus 로고
    • A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
    • DOI 10.1016/j.disopt.2005.10.002, PII S1572528605000733, The Traveling Salesman Problem
    • . Ergan, and J.B. Orlin A dynamic programming methodology in very large scale neighbourhood search applied to the traveling salesman problem Discrete Optim. 3 2006 78 85 (Pubitemid 43276319)
    • (2006) Discrete Optimization , vol.3 , Issue.1 , pp. 78-85
    • Ergun, O.1    Orlin, J.B.2
  • 13
    • 0000689820 scopus 로고
    • More approaches to the traveling salesman guide
    • D.S. Johnson More approaches to the traveling salesman guide Nature 330 1987 525
    • (1987) Nature , vol.330 , pp. 525
    • Johnson, D.S.1
  • 14
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • G.A. Croes A method for solving traveling salesman problems Oper. Res. 6 1958 791 812
    • (1958) Oper. Res. , vol.6 , pp. 791-812
    • Croes, G.A.1
  • 15
    • 0000017036 scopus 로고
    • Large step Markov chains for the traveling salesman problem
    • O. Martin, S.W. Otto, and E.W. Felten Large step Markov chains for the traveling salesman problem Complex Systems 2 1991 299 326
    • (1991) Complex Systems , vol.2 , pp. 299-326
    • Martin, O.1    Otto, S.W.2    Felten, E.W.3
  • 18
    • 84986841321 scopus 로고
    • Artificial intelligence, heuristic frameworks and Tabu search
    • F. Glover Artificial intelligence, heuristic frameworks and Tabu search Manag. Decis. Econom. 11 1990
    • (1990) Manag. Decis. Econom. , vol.11
    • Glover, F.1
  • 19
    • 0021835689 scopus 로고
    • Neural computation of decisions in optimization problems
    • J.J. Hopfield, and D.W. Tank Neural computation of decisions in optimization problems Biol. Cybernet. 52 1985
    • (1985) Biol. Cybernet. , vol.52
    • Hopfield, J.J.1    Tank, D.W.2
  • 20
  • 21
    • 0021501607 scopus 로고
    • The N-city traveling salesman problem: statistical mechanics and the metropolis algorithm
    • E. Bonomi, and J.-L. Lutton The N-city traveling salesman problem: statistical mechanics and the metropolis algorithm SIAM Rev. 26 1984 551 568 (Pubitemid 17491613)
    • (1984) SIAM Review , vol.26 , Issue.4 , pp. 551-568
    • Bonomi, E.1    Lutton, J.-L.2
  • 22
    • 0000184728 scopus 로고
    • Configuration space analysis of traveling salesman problems
    • S. Kirkpatrick, and G. Toulouse Configuration space analysis of traveling salesman problems J. Phys. 46 1985 1277 1292
    • (1985) J. Phys. , vol.46 , pp. 1277-1292
    • Kirkpatrick, S.1    Toulouse, G.2
  • 23
    • 0022715541 scopus 로고
    • Using simulated annealing to solve routing and location problems
    • B.L. Golden, and C.C. Skiscim Using simulated annealing to solve routing and location problems Naval Res. Logist. Quart. 33 1986 261 280
    • (1986) Naval Res. Logist. Quart. , vol.33 , pp. 261-280
    • Golden, B.L.1    Skiscim, C.C.2
  • 24
    • 0347794523 scopus 로고
    • Ph.D. Dissertation, Department of Computer Science, Yale University
    • J. Lam, An efficient simulated annealing schedule, Ph.D. Dissertation, Department of Computer Science, Yale University, 1988.
    • (1988) An Efficient Simulated Annealing Schedule
    • Lam, J.1
  • 26
  • 32
    • 85015307341 scopus 로고
    • On solving traveling salesman problems by genetic algorithm
    • H.C. Braun On solving traveling salesman problems by genetic algorithm H.P. Schwefel, R. Manner, Parallel Problem Solving from Nature Lecture Notes in Computer Science vol. 496 1991 129 133
    • (1991) Lecture Notes in Computer Science , vol.496 , pp. 129-133
    • Braun, H.C.1
  • 33
    • 0039397863 scopus 로고    scopus 로고
    • Genetic algorithms for the traveling salesman problem: A review of representations and operators
    • P. Larranaga, C. Kuijpers, R. Murga, I. Inza, and S. Dizdarevic Genetic algorithms for the traveling salesman problem: a review of representations and operators Artif. Intell. Rev. 13 1999 129 170
    • (1999) Artif. Intell. Rev. , vol.13 , pp. 129-170
    • Larranaga, P.1    Kuijpers, C.2    Murga, R.3    Inza, I.4    Dizdarevic, S.5
  • 38
    • 25844460167 scopus 로고    scopus 로고
    • Some issues of designing genetic algorithms for traveling salesman problems
    • H.K. Tsai, J.M. Yang, Y.F. Tsai, and C.Y. Kao Some issues of designing genetic algorithms for traveling salesman problems Soft Comput. 8 2004 689 697 Springer-Verlag
    • (2004) Soft Comput. , vol.8 , pp. 689-697
    • Tsai, H.K.1    Yang, J.M.2    Tsai, Y.F.3    Kao, C.Y.4
  • 39
    • 79951513336 scopus 로고    scopus 로고
    • A new heuristic algorithm for the classical symmetric traveling salesman problem
    • S.B. Liu, K.M. Ng, and H.L. Ong A new heuristic algorithm for the classical symmetric traveling salesman problem Int. J. Math. Sci. 1 4 2007 234 238
    • (2007) Int. J. Math. Sci. , vol.1 , Issue.4 , pp. 234-238
    • Liu, S.B.1    Ng, K.M.2    Ong, H.L.3
  • 41
    • 0026880159 scopus 로고
    • Traveling salesman problem: An overview of exact and approximate algorithms
    • DOI 10.1016/0377-2217(92)90138-Y
    • G. Laporte The traveling salesman problem: an overview of exact and approximate algorithms European J. Oper. Res. 59 1992 231 247 (Pubitemid 23565197)
    • (1992) European Journal of Operational Research , vol.59 , Issue.2 , pp. 231-247
    • Laporte Gilbert1
  • 44
    • 0001235541 scopus 로고
    • The complexity of local search for the traveling salesman problem
    • C.H. Papadimitriou, and K. Steiglitz The complexity of local search for the traveling salesman problem SIAM J. Comput. 6 1977 78 83
    • (1977) SIAM J. Comput. , vol.6 , pp. 78-83
    • Papadimitriou, C.H.1    Steiglitz, K.2
  • 45
    • 0013314082 scopus 로고
    • Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems
    • T.H.C. Smith, V. Srinivasan, and G.L. Thompson Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems Ann. Discrete Math. 1 1977 495 506
    • (1977) Ann. Discrete Math. , vol.1 , pp. 495-506
    • Smith, T.H.C.1    Srinivasan, V.2    Thompson, G.L.3
  • 46
    • 0001345505 scopus 로고
    • Some new branching and bounding criteria for the asymmetric traveling salesman problem
    • G. Carpaneto, and P. Toth Some new branching and bounding criteria for the asymmetric traveling salesman problem Manage. Sci. 26 1980 736 743
    • (1980) Manage. Sci. , vol.26 , pp. 736-743
    • Carpaneto, G.1    Toth, P.2
  • 47
    • 84947282912 scopus 로고    scopus 로고
    • The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
    • Algorithm Engineering and Experimentation
    • J. Cirasella, D.S. Johnson, L.A. McGeoch, and W. Zhang The asymmetric traveling salesman problem: algorithms, instance generators, and tests ALENEX Proceedings Springer Lecture Notes in Computer Science vol. 2153 2001 32 59 (Pubitemid 33340063)
    • (2001) Lecture Notes in Computer Science , Issue.2153 , pp. 32-59
    • Cirasella, J.1    Johnson, D.S.2    McGeoch, L.A.3    Zhang, W.4
  • 48
    • 84958047824 scopus 로고    scopus 로고
    • Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
    • Applications of Evolutionary Computing
    • E.K. Burke, P.I. Cowling, and R. Keuthen Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem E.J.W. Boers, EvoWorkshop Springer Lecture Notes in Computer Science vol. 2037 2001 203 212 (Pubitemid 33261169)
    • (2001) Lecture Notes in Computer Science , Issue.2037 , pp. 203-212
    • Burke, E.K.1    Cowling, P.I.2    Keuthen, R.3
  • 50
    • 0037394108 scopus 로고    scopus 로고
    • A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
    • I.C. Choi, S.I. Kim, and H.S. Kim A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem Comput. Oper. Res. 30 2003 773 786
    • (2003) Comput. Oper. Res. , vol.30 , pp. 773-786
    • Choi, I.C.1    Kim, S.I.2    Kim, H.S.3
  • 51
    • 0025480980 scopus 로고
    • Multiobjective programming in optimization of the interval objective function
    • H. Ishibuchi, and H. Tanaka Multiobjective programming in optimization of the interval objective function European J. Oper. Res. 48 1990 219 225
    • (1990) European J. Oper. Res. , vol.48 , pp. 219-225
    • Ishibuchi, H.1    Tanaka, H.2
  • 52
    • 0030575675 scopus 로고    scopus 로고
    • Multiobjective programming in optimization of interval objective functions - A generalized approach
    • DOI 10.1016/0377-2217(95)00055-0
    • S. Chanas, and D. Kuchta Multiobjective programming in optimization of interval objective functionsa generalized approach European J. Oper. Res. 94 1996 594 598 (Pubitemid 126391964)
    • (1996) European Journal of Operational Research , vol.94 , Issue.3 , pp. 594-598
    • Chanas, S.1    Kuchta, D.2
  • 53
    • 0011580230 scopus 로고    scopus 로고
    • Theory and methodology on comparing interval numbers
    • A. Sengupta, and T.K. Pal Theory and methodology on comparing interval numbers European J. Oper. Res. 127 2000 28 43
    • (2000) European J. Oper. Res. , vol.127 , pp. 28-43
    • Sengupta, A.1    Pal, T.K.2
  • 54
    • 33750487130 scopus 로고    scopus 로고
    • Elitist genetic algorithm for assignment problem with imprecise goal
    • J. Majumdar, and A.K. Bhunia Elitist genetic algorithm for assignment problem with imprecise goal European J. Oper. Res. 177 2007 684 692
    • (2007) European J. Oper. Res. , vol.177 , pp. 684-692
    • Majumdar, J.1    Bhunia, A.K.2
  • 57
    • 33846651006 scopus 로고    scopus 로고
    • Interval-arithmetic-oriented interval computing technique for global optimization
    • S.K. Mahato, and A.K. Bhunia Interval-arithmetic-oriented interval computing technique for global optimization AMRX Appl. Math. Res. Exp. 2006 2006 1 19
    • (2006) AMRX Appl. Math. Res. Exp. , vol.2006 , pp. 1-19
    • Mahato, S.K.1    Bhunia, A.K.2


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