메뉴 건너뛰기




Volumn 5, Issue 6, 2001, Pages 613-622

A hybrid heuristic for the traveling salesman problem

Author keywords

Compact genetic algorithms; Hybrid GA; Lin Kernighan algorithm; TSP

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

EID: 0035696799     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.974843     Document Type: Article
Times cited : (170)

References (27)
  • 5
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • (1958) Oper. Res. , vol.6 , Issue.6 , pp. 791-812
    • Croes, G.A.1
  • 9
    • 0001724713 scopus 로고
    • Tabu search - Part II
    • (1990) ORSA J. Comput. , vol.2 , Issue.1 , pp. 4-32
  • 13
    • 85015307341 scopus 로고
    • On solving traveling salesman problems by genetic algorithm
    • Parallel Problem Solving from Nature, H. P. Schwefel and R. Männer, Eds. Berlin, Germany: Springer-Verlag
    • (1991) Lecture Notes in Computer Science , vol.496 , pp. 129-133
    • Braun, H.C.1
  • 25
    • 0003984832 scopus 로고
    • Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
    • Carnegie Mellon Univ., Pittsburgh, PA
    • (1994) Tech. Rep. CMU-CS-94-163
    • Baluja, S.1
  • 27
    • 0000950606 scopus 로고    scopus 로고
    • The roles of FPGAs in re-programmable systems
    • Apr.
    • (1998) Proc. IEEE , vol.86 , pp. 615-638
    • Hauck, S.1


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