메뉴 건너뛰기




Volumn 13, Issue 3-4, 1993, Pages 371-406

A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions

Author keywords

Computational testing; Improvement heuristics; Vehicle routing

Indexed keywords


EID: 0000474250     PISSN: 01966324     EISSN: None     Source Type: Journal    
DOI: 10.1080/01966324.1993.10737363     Document Type: Article
Times cited : (115)

References (18)
  • 2
    • 0020504118 scopus 로고
    • Scheduling of Vehicles and Crews: The State of the Art
    • Bodin, L., Golden, B., Assad, A., and Ball, M. (1983). Scheduling of Vehicles and Crews: The State of the Art. Operations Research, 10(2), 63-211
    • (1983) Operations Research , vol.10 , Issue.2 , pp. 63-211
    • Bodin, L.1    Golden, B.2    Assad, A.3    Ball, M.4
  • 3
    • 0015357614 scopus 로고
    • TRAMP--A Multi-depot Vehicle Scheduling System
    • Cassidy, P. and Bennett, H. (1972). TRAMP--A Multi-depot Vehicle Scheduling System. Operational Research Quarterly, 23(2), 151-163
    • (1972) Operational Research Quarterly , vol.23 , Issue.2 , pp. 151-163
    • Cassidy, P.1    Bennett, H.2
  • 4
    • 0006245546 scopus 로고
    • Algorithms and Solutions to Multi-level Vehicle Routing Problems. Ph.D. Dissertation
    • College Park, Maryland
    • Chao, I. M. (1993). Algorithms and Solutions to Multi-level Vehicle Routing Problems. Ph.D. Dissertation, University of Maryland, College Park, Maryland.
    • (1993) University of Maryland
    • Chao, I.M.1
  • 5
    • 0000419596 scopus 로고
    • Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
    • Clarke, G. and Wright, J.W. (1964). Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4), 568-581
    • (1964) Operations Research , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 6
    • 0039780230 scopus 로고
    • New Optimization Heuristics, the Great Deluge Algorithm and the Record-to-Record Travel
    • IBM Germany, Heidelberg Scientific Center, Heidelberg, Germany
    • Dueck, G. (1990). New Optimization Heuristics, the Great Deluge Algorithm and the Record-to-Record Travel. Scientific Center Technical Report, IBM Germany, Heidelberg Scientific Center, Heidelberg, Germany
    • (1990) Scientific Center Technical Report
    • Dueck, G.1
  • 7
    • 0039780231 scopus 로고
    • Multi-Terminal Vehicle-Dispatch Algorithm
    • Gillett, B. E. and Johnson, J. G. (1976). Multi-Terminal Vehicle-Dispatch Algorithm. Omega, 4(6), 711-718
    • (1976) Omega , vol.4 , Issue.6 , pp. 711-718
    • Gillett, B.E.1    Johnson, J.G.2
  • 8
    • 0001535867 scopus 로고
    • A Heuristic Algorithm for the Vehicle Dispatch Problem
    • Gillett, B. E. and Miller, L. E. (1974). A Heuristic Algorithm for the Vehicle Dispatch Problem. Operations Research, 22(2), 340-349.
    • (1974) Operations Research , vol.22 , Issue.2 , pp. 340-349
    • Gillett, B.E.1    Miller, L.E.2
  • 10
    • 0017502445 scopus 로고
    • Implementing Vehicle Routing Algorithms
    • Golden, B. L., Magnanti, T. L., and Nguyen, H. Q. (1977). Implementing Vehicle Routing Algorithms. Networks, 7(2), 113-148
    • (1977) Networks , vol.7 , Issue.2 , pp. 113-148
    • Golden, B.L.1    Magnanti, T.L.2    Nguyen, H.Q.3
  • 11
    • 0023238214 scopus 로고
    • Computerized Vehicle Routing in the Soft Drink Industry
    • Golden, B. L. and Wasil, E. (1987). Computerized Vehicle Routing in the Soft Drink Industry. Operations Research, 35(1), 6-17
    • (1987) Operations Research , vol.35 , Issue.1 , pp. 6-17
    • Golden, B.L.1    Wasil, E.2
  • 12
    • 0026874435 scopus 로고
    • The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms
    • Laporte, G. (1992). The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research, 59(3), 345-358
    • (1992) European Journal of Operational Research , vol.59 , Issue.3 , pp. 345-358
    • Laporte, G.1
  • 13
    • 0039187828 scopus 로고
    • Optimal Solutions to Capacitated Multidepot Vehicle Routing Problems
    • Laporte, G., Nobert, Y., and Arpin, D. (1984). Optimal Solutions to Capacitated Multidepot Vehicle Routing Problems. Congressus Numerantium, 44, 283-292.
    • (1984) Congressus Numerantium , vol.44 , pp. 283-292
    • Laporte, G.1    Nobert, Y.2    Arpin, D.3
  • 14
    • 84908780328 scopus 로고
    • Computer Solutions of the Traveling Salesman Problem
    • Lin, S. (1965). Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal, 44, 2245-2269
    • (1965) Bell System Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 16
    • 0000187093 scopus 로고
    • An Effective Heuristic for the M-tour Traveling Salesman Problem with Some Side Conditions
    • Russell, R. A. (1977). An Effective Heuristic for the M-tour Traveling Salesman Problem with Some Side Conditions. Operations Research, 25(3),517-524
    • (1977) Operations Research , vol.25 , Issue.3 , pp. 517-524
    • Russell, R.A.1
  • 17
    • 0039780233 scopus 로고
    • An Upper bound Algorithm for the Single and Multiple Terminal Delivery Problem
    • Tillman, F. A. and Cain, T. M. (1972). An Upper bound Algorithm for the Single and Multiple Terminal Delivery Problem. Management Science, 18(11), 664-682.
    • (1972) Management Science , vol.18 , Issue.11 , pp. 664-682
    • Tillman, F.1    Cain, A.T.M.2
  • 18
    • 0015401408 scopus 로고
    • Computer Scheduling of Vehicles for One or More Depots to a Number of Delivery Points
    • Wren, A. and Holliday, A. (1972). Computer Scheduling of Vehicles for One or More Depots to a Number of Delivery Points. Operational Research Quarterly. 23, 333-344
    • (1972) Operational Research Quarterly , vol.23 , pp. 333-344
    • Wren, A.1    Holliday, A.2


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