메뉴 건너뛰기




Volumn 11, Issue 4, 2005, Pages 572-576

Improved MMAS for vehicle routing problem with time window

Author keywords

Ant system; Time window; Vehicle routing problem

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; OPTIMIZATION; VEHICLE LOCATING SYSTEMS;

EID: 19644387965     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (20)

References (12)
  • 2
    • 0000110116 scopus 로고
    • Local search for routing problem with time windows
    • SAVELSBERGH M. Local search for routing problem with time windows[J]. Annals of Operations Research, 1985, 16(4): 285-305.
    • (1985) Annals of Operations Research , vol.16 , Issue.4 , pp. 285-305
    • Savelsbergh, M.1
  • 3
    • 84866717137 scopus 로고
    • Algorithms for vehicle routing and scheduling problems with time window constraints
    • MARIUS M, SOLOMON M. Algorithms for vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 763-781.
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 763-781
    • Marius, M.1    Solomon, M.2
  • 5
  • 6
    • 0036626113 scopus 로고    scopus 로고
    • Improved genetic algorithm for vehicle routing problem with time windows
    • ZHANG Liping, CHAI Yueting, CAO Rui. Improved genetic algorithm for vehicle routing problem with time windows[J]. Computer Integrated Manufacturing Systems, 2002, 8(6): 451
    • (2002) Computer Integrated Manufacturing Systems , vol.8 , Issue.6 , pp. 451
    • Zhang, L.1    Chai, Y.2    Cao, R.3
  • 9
    • 0346009088 scopus 로고    scopus 로고
    • D-Ants: Savings based ants divide and conquer the vehicle routing problem
    • REIMANN M, DOERNER K, HARTL R F. D-Ants: savings based ants divide and conquer the vehicle routing problem[J]. Computers and Operations Research, 2004, 31(5): 563-591.
    • (2004) Computers and Operations Research , vol.31 , Issue.5 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 10
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for the vehicle routing problem
    • BULLNHEIMER B, HARTL R, STRAUSS C. An improved ant system algorithm for the vehicle routing problem[J]. Annals of Operations Research 1999, 89(13): 319-328.
    • (1999) Annals of Operations Research , vol.89 , Issue.13 , pp. 319-328
    • Bullnheimer, B.1    Hartl, R.2    Strauss, C.3
  • 11
    • 3343027050 scopus 로고    scopus 로고
    • A fast evolutionary metaheuristic for the vehicle routing problem with time windows
    • BRYSY O, DULLAERT W. A fast evolutionary metaheuristic for the vehicle routing problem with time windows[J]. International Journal of Artificial Intelligence Tools, 2002, 12(2): 143-157.
    • (2002) International Journal of Artificial Intelligence Tools , vol.12 , Issue.2 , pp. 143-157
    • Brysy, O.1    Dullaert, W.2
  • 12
    • 19644387092 scopus 로고    scopus 로고
    • Model and algorithm of vehicle routing problem with stochastictravel time
    • Chinese source
    • GUO Qiang, XIE Binglei. Model and algorithm of vehicle routing problem with stochastictravel time[J]. Journal of Systems Engineering, 2003, 18(3): 244-247 (in Chinese).
    • (2003) Journal of Systems Engineering , vol.18 , Issue.3 , pp. 244-247
    • Guo, Q.1    Xie, B.2


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