메뉴 건너뛰기




Volumn 6238 LNCS, Issue PART 1, 2010, Pages 566-575

A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover

Author keywords

Chained LK; Generalized Partition Crossover; Hybrid Genetic Algorithm; Traveling Salesman Problem

Indexed keywords

CHAINED-LK; COMPUTATIONAL EFFORT; GENERALIZED PARTITION CROSSOVER; HYBRID GENETIC ALGORITHM; HYBRID GENETIC ALGORITHMS; LOCAL OPTIMA; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; POPULATION SIZES; PROBLEM SIZE; STATE OF THE ART; TRAVELING SALESMAN;

EID: 78149239292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_57     Document Type: Conference Paper
Times cited : (56)

References (7)
  • 1
    • 2442515836 scopus 로고    scopus 로고
    • Chained Lin-Kernighan for large traveling salesman problems
    • Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82-92 (2003)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.1 , pp. 82-92
    • Applegate, D.1    Cook, W.2    Rohe, A.3
  • 3
    • 0003032328 scopus 로고
    • Fitness variance of formae and performance predictions
    • Whitley, D., Vose, M. (eds.) Morgan Kaufmann, San Francisco
    • Radcliffe, N., Surry, P.: Fitness variance of formae and performance predictions. In: Whitley, D., Vose, M. (eds.) FOGA - 3, pp. 51-72. Morgan Kaufmann, San Francisco (1995)
    • (1995) FOGA - 3 , pp. 51-72
    • Radcliffe, N.1    Surry, P.2
  • 4
    • 0001237146 scopus 로고
    • A method for solving traveling-salesman problems
    • Croes, G.: A method for solving traveling-salesman problems. Operations Research, 791-812 (1958)
    • (1958) Operations Research , pp. 791-812
    • Croes, G.1
  • 5
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling-salesman problem
    • Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 498-516 (1973)
    • (1973) Operations Research , pp. 498-516
    • Lin, S.1    Kernighan, B.2
  • 6
    • 0000692965 scopus 로고
    • A new adaptive multi-start technique for combinatorial global optimizations
    • Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16, 101-113 (1994)
    • (1994) Operations Research Letters , vol.16 , pp. 101-113
    • Boese, K.D.1    Kahng, A.B.2    Muddu, S.3
  • 7
    • 0001193147 scopus 로고    scopus 로고
    • The traveling salesman problem: A case study in local optimization
    • Aarts, E.H.L., Lenstra, J. (eds.) John Wiley and Sons Ltd., Chichester
    • Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215-310. John Wiley and Sons Ltd., Chichester (1997)
    • (1997) Local Search in Combinatorial Optimization , pp. 215-310
    • Johnson, D.S.1    McGeoch, L.A.2


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