메뉴 건너뛰기




Volumn 133, Issue 1-3, 2003, Pages 69-92

A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

Author keywords

Bin packing; Heuristic; Multiple trip; Population

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; COSTS; DATA STRUCTURES; SCHEDULING; STRATEGIC PLANNING;

EID: 0242366703     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00434-7     Document Type: Conference Paper
Times cited : (100)

References (15)
  • 1
    • 0031186464 scopus 로고    scopus 로고
    • A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
    • Brandao J., Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100:1997;180-191.
    • (1997) Eur. J. Oper. Res. , vol.100 , pp. 180-191
    • Brandao, J.1    Mercer, A.2
  • 2
    • 0032141410 scopus 로고    scopus 로고
    • The multi-trip vehicle routing problem
    • Brandao J., Mercer A. The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49:1998;799-805.
    • (1998) J. Oper. Res. Soc. , vol.49 , pp. 799-805
    • Brandao, J.1    Mercer, A.2
  • 4
    • 0000419596 scopus 로고
    • Scheduling of vehicles for a central depot to a number of delivery points
    • Clarke G., Wright J.W. Scheduling of vehicles for a central depot to a number of delivery points. Oper. Res. 12:1964;568-581.
    • (1964) Oper. Res. , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 5
    • 0028461566 scopus 로고
    • Optimal solution of vehicle routing problems using minimum k-trees
    • Fisher M.L. Optimal solution of vehicle routing problems using minimum. k-trees Oper. Res. 42(4):1994;626-646.
    • (1994) Oper. Res. , vol.42 , Issue.4 , pp. 626-646
    • Fisher, M.L.1
  • 6
    • 0042548127 scopus 로고
    • The vehicle routing problem with multiple use of vehicles
    • Fachbereich Wirschaftswissenschaften, Universitat Hamburg
    • B. Fleischmann, The vehicle routing problem with multiple use of vehicles, Working paper, Fachbereich Wirschaftswissenschaften, Universitat Hamburg, 1990.
    • (1990) Working Paper
    • Fleischmann, B.1
  • 7
    • 0031146838 scopus 로고    scopus 로고
    • An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
    • Golden B., Laporte G., Taillard E. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24:1997;445-452.
    • (1997) Comput. Oper. Res. , vol.24 , pp. 445-452
    • Golden, B.1    Laporte, G.2    Taillard, E.3
  • 10
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Heuristics. 1:1995;147-167.
    • (1995) Heuristics , vol.1 , pp. 147-167
    • Rochat, Y.1    Taillard, E.2
  • 12
    • 0023312243 scopus 로고
    • Improvements to vehicle routing heursitics
    • Salhi S., Rand G.K. Improvements to vehicle routing heursitics. J. Oper. Res. Soc. 38:1987;293-295.
    • (1987) J. Oper. Res. Soc. , vol.38 , pp. 293-295
    • Salhi, S.1    Rand, G.K.2
  • 13
    • 0031272412 scopus 로고    scopus 로고
    • A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
    • Salhi S., Sari M. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur. J. Oper. Res. 103:1997;95-112.
    • (1997) Eur. J. Oper. Res. , vol.103 , pp. 95-112
    • Salhi, S.1    Sari, M.2
  • 14
  • 15
    • 0001547673 scopus 로고
    • A computational modification to the savings method of vehicle scheduling
    • Yellow P.C. A computational modification to the savings method of vehicle scheduling. Oper. Res. Q. 21:1970;281-283.
    • (1970) Oper. Res. Q. , vol.21 , pp. 281-283
    • Yellow, P.C.1


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