메뉴 건너뛰기
Acta Polytechnica Hungarica
Volumn 2, Issue 2, 2005, Pages 77-89
Route elimination heuristic for vehicle routing problem with time windows
Author keywords

Tabu search; Time windows; Transportation; Vehicle routing problem
Indexed keywords

EID: 63849196561     PISSN: 17858860     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (7)
References (12)
  • 1
    • 3343027050 scopus 로고    scopus 로고
    • A fast evolutionary metaheuristic for the vehicle routing problem with time windows
    • O. Bräysy, W. Dullaert: A fast evolutionary metaheuristic for the vehicle routing problem with time windows, Int. J. AI Tools 12 (2003), pp. 153:172
    • (2003) Int. J. AI Tools , vol.12 , pp. 153-172
    • Bräysy, O.1    Dullaert, W.2
  • 2
    • 8444235112 scopus 로고    scopus 로고
    • A two-phase metaheuristic for the vehicle routing problem with time windows
    • J. Homberger, H. Gehring: A two-phase metaheuristic for the vehicle routing problem with time windows, European Journal of Operation Research 162 (2005), pp. 220-228
    • (2005) European Journal of Operation Research , vol.162 , pp. 220-228
    • Homberger, J.1    Gehring, H.2
  • 4
    • 84875039422 scopus 로고    scopus 로고
    • nd International Conference
    • Schweinfurt
    • nd International Conference "Science in Practice", Schweinfurt (2005)
    • (2005) Science in Practice
    • Csiszár, S.1
  • 5
    • 3843138356 scopus 로고    scopus 로고
    • A reactive variable neighbourhood search for the Vehiclerouting problem with time windows
    • O. Bräysy: A reactive variable neighbourhood search for the Vehiclerouting problem with time windows. Informs Journal on Computing 15 (2003), pp. 347-368
    • (2003) Informs Journal on Computing , vol.15 , pp. 347-368
    • Bräysy, O.1
  • 6
    • 0036497536 scopus 로고    scopus 로고
    • A parametric analysis of heuristics for the vehicle routing problem with side-constraints
    • A. Van Breedam: A parametric analysis of heuristics for the vehicle routing problem with side-constraints, European Journal of Operation Reports 137 (2002), pp. 348-370
    • (2002) European Journal of Operation Reports , vol.137 , pp. 348-370
    • Breedam, A.V.1
  • 7
    • 0000419596 scopus 로고
    • Scheduling of Vehicles from a Central Depot to a number of delivery poing
    • G. Clarke, J. W. Wright: Scheduling of Vehicles from a Central Depot to a number of delivery poing. Operation Research 12 (1964), pp. 568-581
    • (1964) Operation Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 8
    • 0023313252 scopus 로고
    • Algorithm for the Vehicle Routing and Scheduling Problem with Time Window Constraints
    • M. M. Solomon: Algorithm for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Operation Research 35 (1987), pp. 254-265
    • (1987) Operation Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 10
    • 0000592377 scopus 로고
    • Parallel savings based heuristic for the delivery problem
    • K. Altinkemer, B. Gavish: Parallel savings based heuristic for the delivery problem, Operations Research 39 (1991), pp. 456-469
    • (1991) Operations Research , vol.39 , pp. 456-469
    • Altinkemer, K.1    Gavish, B.2
  • 11
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • G. Laporte: The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59 (1992), pp. 345-358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 12
    • 33845512751 scopus 로고
    • Parallel iterative search methods for vehicle routing problems
    • E. Taillard: Parallel iterative search methods for vehicle routing problems, Networks 23 (1993), pp. 661-672
    • (1993) Networks , vol.23 , pp. 661-672
    • Taillard, E.1

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