Worst-Case Analysis for Split Delivery Vehicle Routing Problems

Published Online:https://doi.org/10.1287/trsc.1050.0117

References

  • Archetti C., Mansini R., Speranza M. G. Complexity and reducibility of the skip delivery problem. Transportation Sci. (2005) 39:182–187LinkGoogle Scholar
  • Belenguer J. M., Martinez M. C., Mota E. A lower bound for the split delivery vehicle routing problem. Oper. Res. (2000) 48:801–810LinkGoogle Scholar
  • Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254CrossrefGoogle Scholar
  • Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145LinkGoogle Scholar
  • Dror M., Trudeau P. Split delivery routing. Naval Res. Logist. (1990) 37:383–402CrossrefGoogle Scholar
  • Frizzell P. W., Giffin J. W. The split delivery vehicle scheduling problem with time windows and grid network distances. Comput. Oper. Res. (1995) 22:655–667CrossrefGoogle Scholar
  • Gendreau M., Dejax P., Feillet D., Gueguen C. Vehicle routing with time windows and split deliveries. (2005) . Working paperGoogle Scholar
  • Gueguen C. Méthodes de résolution exacte pour les problèmes de tournées de véhicules. (1999) . Ph.D. thesis, École Centrale Paris, Paris, FranceGoogle Scholar
  • Mullaseril P. A., Dror M., Leung J. Split-delivery routing in livestock feed distribution. J. Oper. Res. Soc. (1997) 48:107–116CrossrefGoogle Scholar
  • Sierksma G., Tijssen G. A. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.