메뉴 건너뛰기




Volumn 4150 LNCS, Issue , 2006, Pages 156-166

Incremental local search in ant colony optimization: Why it fails for the quadratic assignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SYSTEM RECOVERY; PROBLEM SOLVING;

EID: 33751372267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839088_14     Document Type: Conference Paper
Times cited : (8)

References (13)
  • 3
    • 0001407513 scopus 로고
    • Hybrid heuristics for the vehicle routing problem with time windows
    • Russell, R.: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows. Transportation Science 29 (1995) 156-166
    • (1995) Transportation Science , vol.29 , pp. 156-166
    • Russell, R.1
  • 4
    • 0000866856 scopus 로고
    • New insertion and postoptimization procedures for the traveling salesman problem
    • Gendreau, M., Hertz, A., Laporte, G.: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research 40(6) (1992)
    • (1992) Operations Research , vol.40 , Issue.6
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 5
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • Gendreau, M., Hertz, A., Laporte, G.: A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science 40 (1994) 1276-1290
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 6
    • 0033355838 scopus 로고    scopus 로고
    • Heuristics for large constrained vehicle routing problems
    • Caseau, Y., Laburthe, F.: Heuristics for Large Constrained Vehicle Routing Problems. Journal of Heuristics 5(3) (1999) 281-303
    • (1999) Journal of Heuristics , vol.5 , Issue.3 , pp. 281-303
    • Caseau, Y.1    Laburthe, F.2
  • 7
    • 0001245363 scopus 로고    scopus 로고
    • Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
    • Fleurent, C., Glover, F.: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory. INFORMS Journal on Computing 11(2) (1999) 198-204
    • (1999) INFORMS Journal on Computing , vol.11 , Issue.2 , pp. 198-204
    • Fleurent, C.1    Glover, F.2
  • 9
    • 0002529867 scopus 로고    scopus 로고
    • ACO algorithms for the quadratic assignment problem
    • Corne, D., Dorigo, M., Glover, F., eds.. McGraw-Hill, London, UK
    • Stützle, T., Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization. McGraw-Hill, London, UK (1999) 33-50
    • (1999) New Ideas in Optimization , pp. 33-50
    • Stützle, T.1    Dorigo, M.2


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