Pickup and Delivery with Split Loads

References

• Archetti C., Hertz A., Speranza M. G. A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. (2006) 40:64–73Link, Google Scholar
• Archetti C., Savelsbergh M. W. P., Speranza M. G. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. (2006) 40:226–234Link, Google Scholar
• Archetti C., Savelsbergh M. W. P., Speranza M. G. To split or not to split: That is the question. Transportation Res. E (2008) . ForthcomingCrossref, Google Scholar
• Bent R., Hentenryck P. V. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. (2006) 33:875–893Crossref, Google Scholar
• Clarke C., Wright J. Q. Scheduling of vehicle from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
• Dror M., Trudeau P. Split delivery routing. Naval Res. Logist. (1990) 37:383–402Crossref, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254Crossref, Google Scholar
• Frizzell P. W., Giffin J. W. The split delivery vehicle scheduling problem with time windows and grid network distance. Comput. Oper. Res. (1995) 22:655–667Crossref, Google Scholar
• Ho S. C., Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. (2004) 31:1947–1964Crossref, Google Scholar
• Landrieu A., Mati Y., Binder Z. A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. J. Intelligent Manufacturing (2001) 12:497–508Crossref, Google Scholar
• Li H., Lim A., Bansal A. K. A metaheuristic for the pickup and delivery problem with time windows. 13th IEEE Internat. Conf. Tools with Artificial Intelligence (ICTAI) (2001) Dallas:160–170Crossref, Google Scholar
• Nanry W. P., Barnes J. W. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Res. Part B (2000) 34:107–121Crossref, Google Scholar
• Savelsbergh M., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29(1):17–29Link, Google Scholar
• Sierksma G., Tijssen G. A. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286Crossref, Google Scholar
• Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Toth P., Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Sci. (1997) 31(1):60–71Link, Google Scholar