메뉴 건너뛰기




Volumn 228, Issue 1, 2013, Pages 72-82

A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms

Author keywords

Crossover operator; Genetic algorithms; MTSP; Two part chromosome

Indexed keywords

CROSSOVER OPERATOR; MTSP; MULTIPLE TRAVELLING SALESMEN PROBLEM; NEAR-OPTIMAL SOLUTIONS; OBJECTIVE FUNCTIONS; REPRESENTATION TECHNIQUES; SEARCH PERFORMANCE; TWO-PART CHROMOSOMES;

EID: 84875209572     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.01.043     Document Type: Article
Times cited : (140)

References (36)
  • 1
    • 27744588516 scopus 로고    scopus 로고
    • The multiple traveling salesman problem: An overview of formulations and solution procedures
    • T. Bektas The multiple traveling salesman problem: an overview of formulations and solution procedures Omega 34 2006 209 219
    • (2006) Omega , vol.34 , pp. 209-219
    • Bektas, T.1
  • 2
    • 0016081081 scopus 로고
    • Transformation of multisalesmen problem to the standard traveling salesman problem
    • M. Bellmore, and S. Hong Transformation of multisalesmen problem to the standard traveling salesman problem Journal of the Association Computer Machinery 21 1974 500 504
    • (1974) Journal of the Association Computer Machinery , vol.21 , pp. 500-504
    • Bellmore, M.1    Hong, S.2
  • 5
    • 33749144475 scopus 로고    scopus 로고
    • A new approach to solving the multiple traveling salesperson problem using genetic algorithms
    • A.E. Carter, and C.T. Ragsdale A new approach to solving the multiple traveling salesperson problem using genetic algorithms European Journal of Operational Research 175 2006 246 257
    • (2006) European Journal of Operational Research , vol.175 , pp. 246-257
    • Carter, A.E.1    Ragsdale, C.T.2
  • 7
    • 34250247769 scopus 로고
    • Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
    • N. Christofides, A. Mingozzi, and P. Toth Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations Mathematical Programming 20 1981 255 282
    • (1981) Mathematical Programming , vol.20 , pp. 255-282
    • Christofides, N.1    Mingozzi, A.2    Toth, P.3
  • 9
    • 0000150947 scopus 로고
    • Applying adaptive algorithms to epistatic domains
    • IEEE Computer Society Press. Los Angeles
    • L. Davis Applying adaptive algorithms to epistatic domains The International Joint Conference on Artificial Intelligence 1985 IEEE Computer Society Press. Los Angeles 162 164
    • (1985) The International Joint Conference on Artificial Intelligence , pp. 162-164
    • Davis, L.1
  • 12
    • 0022786644 scopus 로고
    • An optimal solution method for large-scale multiple traveling salesmen problems
    • B. Gavish, and K. Srikanth An optimal solution method for large-scale multiple traveling salesmen problems Operations Research 34 1986 698 717
    • (1986) Operations Research , vol.34 , pp. 698-717
    • Gavish, B.1    Srikanth, K.2
  • 16
    • 0014732762 scopus 로고
    • Printing press scheduling for multi-edition periodicals
    • S. Gorenstein Printing press scheduling for multi-edition periodicals Management Science 16 1970 B373 383
    • (1970) Management Science , vol.16 , pp. 373-383
    • Gorenstein, S.1
  • 19
    • 42649114487 scopus 로고    scopus 로고
    • Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
    • T. Kellegöz, B. Toklu, and J. Wilson Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem Applied Mathematics and Computation 199 2008 590 598
    • (2008) Applied Mathematics and Computation , vol.199 , pp. 590-598
    • Kellegöz, T.1    Toklu, B.2    Wilson, J.3
  • 21
    • 77649238246 scopus 로고    scopus 로고
    • Probability collectives: A multi-Agent approach for solving combinatorial optimization problems
    • A.J. Kulkarni, and K. Tai Probability collectives: a multi-Agent approach for solving combinatorial optimization problems Applied Soft Computing 10 2010 759 771
    • (2010) Applied Soft Computing , vol.10 , pp. 759-771
    • Kulkarni, A.J.1    Tai, K.2
  • 23
    • 0030215149 scopus 로고    scopus 로고
    • A genetic algorithm for service level based vehicle scheduling
    • C. Malmborg A genetic algorithm for service level based vehicle scheduling European Journal of Operational Research 93 1996 121 134
    • (1996) European Journal of Operational Research , vol.93 , pp. 121-134
    • Malmborg, C.1
  • 25
    • 0035929097 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines
    • Y.B. Park A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines International Journal of Productions Economics 73 2001 175 188
    • (2001) International Journal of Productions Economics , vol.73 , pp. 175-188
    • Park, Y.B.1
  • 26
    • 84870565261 scopus 로고    scopus 로고
    • Reinelt, G.; 2001. TSPLIB. < http://comopt.ifi.uni-heidelberg.de/ software/TSPLIB95/ >.
    • (2001) TSPLIB
    • Reinelt, G.1
  • 27
    • 0032256933 scopus 로고    scopus 로고
    • Reactive tabu search in unmanned aerial reconnaissance simulations
    • IEEE Computer Society Press Los Alamitos, CA
    • J.L. Ryan, T.G. Bailey, J.T. Moore, and W.B. Carlton Reactive tabu search in unmanned aerial reconnaissance simulations The 30th Conference on Winter Simulation 1998 IEEE Computer Society Press Los Alamitos, CA 873 879
    • (1998) The 30th Conference on Winter Simulation , pp. 873-879
    • Ryan, J.L.1    Bailey, T.G.2    Moore, J.T.3    Carlton, W.B.4
  • 28
    • 50349103500 scopus 로고    scopus 로고
    • A new grouping genetic algorithm approach to the multiple traveling salesperson problem
    • A. Singh, and A.S. Baghel A new grouping genetic algorithm approach to the multiple traveling salesperson problem Soft Computing 13 2009 95 101
    • (2009) Soft Computing , vol.13 , pp. 95-101
    • Singh, A.1    Baghel, A.S.2
  • 30
    • 0001653536 scopus 로고
    • An analysis of multi-point crossover
    • J.E. Rawlins, Morgan Kaufman San Mateo, CA
    • W.M. Spears, and K.A. DeJong An analysis of multi-point crossover J.E. Rawlins, Foundations of Genetic Algorithms 1991 Morgan Kaufman San Mateo, CA 301 315
    • (1991) Foundations of Genetic Algorithms , pp. 301-315
    • Spears, W.M.1    Dejong, K.A.2
  • 31
    • 0009593059 scopus 로고
    • Computational experience with an m-salesman traveling salesman algorithm
    • J.A. Svestka, and V.E. Huckfeldt Computational experience with an m-salesman traveling salesman algorithm Management Science 17 1973 790 799
    • (1973) Management Science , vol.17 , pp. 790-799
    • Svestka, J.A.1    Huckfeldt, V.E.2
  • 32
    • 0033741404 scopus 로고    scopus 로고
    • A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex
    • L. Tang, J. Liu, A. Rong, and Z. Yang A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex European Journal of Operational Research 124 2000 276 282
    • (2000) European Journal of Operational Research , vol.124 , pp. 276-282
    • Tang, L.1    Liu, J.2    Rong, A.3    Yang, Z.4
  • 34
    • 0036466726 scopus 로고    scopus 로고
    • Local truckload pickup and delivery with hard time window constraints
    • X.B. Wang, and A.C. Regan Local truckload pickup and delivery with hard time window constraints Transportation Research Part B 36 2002 97 112
    • (2002) Transportation Research Part B , vol.36 , pp. 97-112
    • Wang, X.B.1    Regan, A.C.2
  • 35
    • 79956144068 scopus 로고    scopus 로고
    • An analysis of the extended Christofides heuristic for the k-depot TSP
    • Z. Xu, L. Xu, and B. Rodrigues An analysis of the extended Christofides heuristic for the k-depot TSP Operations Research Letters 39 2011 218 223
    • (2011) Operations Research Letters , vol.39 , pp. 218-223
    • Xu, Z.1    Xu, L.2    Rodrigues, B.3


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