An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

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

References

  • Archetti C., Hertz A., Speranza M. G. A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. (2006) 40:64–73LinkGoogle Scholar
  • Archetti C., Mansini R., Speranza M. G. Complexity and reducibility of the skip delivery problem. Transportation Sci. (2005) 39:182–187LinkGoogle Scholar
  • Archetti C., Savelsbergh M. W. P., Speranza M. G. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. (2006) 40:226–234LinkGoogle 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
  • Chen S., Golden B., Wasil E. The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks (2007) 49:318–329CrossrefGoogle Scholar
  • De Franceschi R., Fischetti M., Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming (2006) 105:471–499CrossrefGoogle 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
  • Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254CrossrefGoogle Scholar
  • Espinoza D., García R., Goycoolea M., Nemhauser G. L., Savelsbergh M. W. P. Per-seat, on-demand air transportation Part I: Problem description and an integer multi-commodity flow model. Transportation Sci. (2008a) . ForthcomingLinkGoogle Scholar
  • Espinoza D., García R., Goycoolea M., Nemhauser G. L., Savelsbergh M. W. P. Per-seat, on-demand air transportation Part II: Parallel local search. Transportation Sci. (2008b) . ForthcomingLinkGoogle 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. (2006) . Technical Report 2006-851, Laboratoire d'Informatique d'Avignon, Université d'Avignon, d'Avignon, FranceGoogle Scholar
  • Gueguen C. Méthodes de résolution exacte pour les problèmes de tournées de véhicules. (1999) . Unpublished doctoral thesis, École Centrale, Paris, ParisGoogle 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.