Multicommodity vs. Single-Commodity Routing

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

References

  • Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Internat. Trans. Oper. Res. 19:3–22.CrossrefGoogle Scholar
  • Archetti C, Bianchessi N, Speranza MG (2014) Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res.238:685–698.CrossrefGoogle Scholar
  • Archetti C, Savelsbergh MWP, Speranza MG (2006) Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40:226–234.LinkGoogle Scholar
  • Archetti C, Savelsbergh MWP, Speranza MG (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42:22–31.LinkGoogle Scholar
  • Christofides N, Mingozzi A, Toth P (1979) The Vehicle Routing Problem (John Wiley & Sons, Chichester, UK), 315–338.Google Scholar
  • Cruijssen F, Salomon M (2004) Empirical study: Order sharing between transportation companies may result in cost reductions between 5 to 15 percent. Technical report, CentER Discussion Paper 2004-80, Faculty of Economics and Business Administration, Tilburg University, Tilburg, Netherlands.Google Scholar
  • Cruijssen F, Cools M, Dullaert W (2007) Horizontal cooperation in logistics: Opportunities and impediments. Transportation Res. Part E 43:129–142.CrossrefGoogle Scholar
  • Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U (2011) Vehicle routing with compartments: Applications, modelling and heuristics. OR Spectrum 33:885–914.CrossrefGoogle Scholar
  • Dror M, Trudeau P (1989) Savings by split delivery routing. Transportation Sci. 23:141–145.LinkGoogle Scholar
  • Golden B, Raghavan R, Wasil E (2008) The Vehicle Routing Problem. Latest Advances and New Challenges, Oper. Res./Comput. Sci. Interfaces Ser., Vol. 43 (Springer-Verlag, New York).CrossrefGoogle Scholar
  • Krajewska MA, Kopfer H, Laporte G, Ropke S, Zaccour G (2008) Horizontal cooperation among freight carriers: Request allocation and profit sharing. J. Oper. Res. Soc. 59:1483–1491.CrossrefGoogle Scholar
  • Özener OÖ, Ergun Ö, Savelsbergh M (2011) Lane-exchange mechanisms for truckload carrier collaboration. Transportation Sci. 45:1–17.LinkGoogle Scholar
  • Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33:60–100.CrossrefGoogle Scholar
  • Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math. Programmming 94:343–359.CrossrefGoogle Scholar
  • Toth P, Vigo D (2002) The Vehicle Routing Problem. Monographs on Discrete Mathematics and Its Applications (SIAM, Philadelphia).CrossrefGoogle 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.