A shortest path approach to the multiple-vehicle routing problem with split pick-ups

Transportation Research Part B: Methodological

Volumn 40, Issue 4, 2006, Pages 265-284

  Lee, Chi Guhn ^a   Epelman, Marina A ^b   White III, Chelsea C ^c   Bozer, Yavuz A ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Dynamic programming; Shortest path algorithms; Split deliveries pick ups; Vehicle routing

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; THEOREM PROVING; TRUCKS; VECTORS;

SHORTEST PATH ALGORITHMS; SPLIT DELIVERIES; SPLIT PICK-UPS; VEHICLE ROUTING;

TRANSPORTATION ROUTES;

ALGORITHM; PLANNING METHOD; ROUTING; TRANSPORTATION PLANNING;

EID: 29844447098     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2004.11.004     Document Type: Article

References (11)

1. J.M. Belenguer M.C. Martinez E. Mota A lower bound for the split delivery vehicle routing problem Operations Research 48 2000 801-810
2. D.P. Bertsekas Dynamic programming and optimal control vol. I 1995 Athena Scientific Belmont, Mass
3. J. Desrosiers Y. Dumas M.M. Solomon F. Soumis Time constrained routing and scheduling Network routing Handbooks Operation Research and Management Science vol. 8 1995 North-Holland Amsterdam 35-139
4. M. Dror P. Trudeau Saving by split delivery routing Transportation Science 23 1989 141-145
5. M. Dror P. Trudeau Split delivery routing Naval Research Logistics 37 1990 383-402
6. M. Dror G. Laporte P. Trudeau Vehicle routing with split deliveries Discrete Applied Mathematics 50 1994 239-254
7. P. Frizzell J. Griffin The split delivery vehicle scheduling problem with time windows and grid network distances Computers and Operations Research 22 1995 655-667
8. S.C. Ho D. Haugland A tabu search heuristic for the vehicle routing problem with time windows and split deliveries Computers and Operations Research 31 2004 1947-1964
9. E.L. Lawler J.K. Lenstra A.H.G.R. Kan D.B. Shmoys The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization 1985 John Wiley & Sons New York
10. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving 1984 Addison-Wesley MA
11. G. Sierksma G.A. Tijssen Routing helicopters for crew exchanges on off-shore locations Annals of Operations Research 76 1998 261-286