Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem

  • Juliette Medina
  • Mike Hewitt
  • Fabien LehuédéEmail author
  • Olivier Péton
Research Paper


We introduce a new optimization problem, the Service Network Design and Routing Problem that integrates long-haul and local transportation planning decisions. Such a problem is particularly important for consolidation carriers that face customer demands for fast delivery and thus must synchronize the different levels of their transportation operations. We present two formulations of the problem: (1) a route-based formulation that allows for the modeling of a rich set of rules governing local delivery routes at the expense of increased instance size and computational solve time, and, (2) an arc-based formulation that can be solved more quickly but has less modeling power. We solve each with a Dynamic Discretization Discovery algorithm that was recently proposed and designed for solving Service Network Design problems that require the precise modeling of time. With an extensive computational study, we examine the benefits of each formulation.


Service Network Design Vehicle Routing Problem 



This material is based upon work supported by the National Science Foundation under Grant no. CMMI-1435625.


  1. Anderluh A, Hemmelmayr VC, Nolz PC (2017) Synchronizing vans and cargo bikes in a city distribution network. Cent Eur J Oper Res 25(2):345–376CrossRefGoogle Scholar
  2. Andersen J, Crainic TG, Christiansen M (2009a) Service network design with asset management: formulations and comparative analyses. Transp Res Part C Emerg Technol 17(2):197–207CrossRefGoogle Scholar
  3. Andersen J, Crainic TG, Christiansen M (2009b) Service network design with management and coordination of multiple fleets. Eur J Oper Res 193(2):377–389CrossRefGoogle Scholar
  4. Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. Top 15(1):1–31CrossRefGoogle Scholar
  5. Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper Res.
  6. Cortés CE, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method. Eur J Oper Res 200(3):711–724CrossRefGoogle Scholar
  7. Crainic TG (2000) Service network design in freight transportation. Eur J Oper Res 122(2):272–288CrossRefGoogle Scholar
  8. Crainic TG, Ricciardi N, Storchi G (2009) Models for evaluating and planning city logistics systems. Transp Sci 43(4):432–454CrossRefGoogle Scholar
  9. Crainic TG, Hewitt M, Toulouse M, Vu D (2016) Service network design with resource constraints. Transp Sci 50(4):1380–1393CrossRefGoogle Scholar
  10. Dellaert N, Saridarq FD, Van Woensel T, Crainic TG (2016) Branch and price based algorithms for the two-echelon vehicle routing problem with time windows. Les cahiers du CIRRELT (CIRRELT-2016-45)Google Scholar
  11. Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation. Springer Science and Business Media, BerlinGoogle Scholar
  12. Dondo RG, Mendez CA (2014) A branch-and-price approach to manage cargo consolidation and distribution in supply chains. Ind Eng Chem Res 53(44):17226–17239CrossRefGoogle Scholar
  13. Drexl M (2012) Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297–316CrossRefGoogle Scholar
  14. Erera A, Hewitt M, Savelsbergh M, Zhang Y (2013a) Improved load plan design through integer programming based local search. Transp Sci 47(3):412–427CrossRefGoogle Scholar
  15. Erera AL, Hewitt M, Savelsbergh MW, Zhang Y (2013b) Creating schedules and computing operating costs for LTL load plans. Comput Oper Res 40(3):691–702CrossRefGoogle Scholar
  16. Grangier P, Gendreau M, Lehuédé F, Rousseau LM (2016a) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur J Oper Res 254(1):80–91CrossRefGoogle Scholar
  17. Grangier P, Gendreau M, Lehuédé F, Rousseau LM (2016b) A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Les cahiers du CIRRELT CIRRELT-2016-09Google Scholar
  18. Guastaroba G, Speranza MG, Vigo D (2016) Intermediate facilities in freight transportation planning: a survey. Transp Sci 50(3):763–789CrossRefGoogle Scholar
  19. Jarrah AI, Johnson E, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper Res 57(3):609–625CrossRefGoogle Scholar
  20. Masson R, Lehuédé F, Péton O (2013a) An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transp Sci 47:356–379CrossRefGoogle Scholar
  21. Masson R, Lehuédé F, Péton O (2013b) Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper Res Lett 41(3):211–215CrossRefGoogle Scholar
  22. Mitrović-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44(3):217–228Google Scholar
  23. Morais VW, Mateus GR, Noronha TF (2014) Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst Appl 41(16):7495–7506CrossRefGoogle Scholar
  24. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. Journal für Betriebswirtschaft 58(1):21–51CrossRefGoogle Scholar
  25. Pedersen MB, Crainic TG, Madsen OB (2009) Models and tabu search metaheuristics for service network design with asset-balance requirements. Transp Sci 43(2):158–177CrossRefGoogle Scholar
  26. Petersen HL, Ropke S (2011) The pickup and delivery problem with cross-docking opportunity. In: Proceedings of the second international conference on computational logistics, Springer, Berlin, Heidelberg, ICCL’11, pp 101–113Google Scholar
  27. Qu Y, Bard JF (2012) A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput Oper Res 39(10):2439–2456CrossRefGoogle Scholar
  28. Santos FA, Mateus GR, da Cunha AS (2011) A novel column generation algorithm for the vehicle routing problem with cross-docking. In: Pahl J, Reiners T, Voss S (eds) Network optimization, vol 6701. Lecture notes in computer science. Springer, Berlin, pp 412–425CrossRefGoogle Scholar
  29. Santos FA, Mateus GR, da Cunha AS (2013) The pickup and delivery problem with cross-docking. Comput Oper Res 40(4):1085–1093CrossRefGoogle Scholar
  30. Tarantilis CD (2013) Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim Lett 7(7):1583–1596CrossRefGoogle Scholar
  31. Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, vol 18. SIAM, PhiladelphiaCrossRefGoogle Scholar
  32. Wen M, Larsen J, Clausen J, Cordeau JF, Laporte G (2008) Vehicle routing with cross-docking. J Oper Res Soc 60(12):1708–1718CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018

Authors and Affiliations

  1. 1.IMT Atlantique LS2N, UMR CNRS 6004NantesFrance
  2. 2.Quinlan School of BusinessLoyola University ChicagoChicagoUSA
  3. 3.CRC ServicesRueil MalmaisonFrance

Personalised recommendations