Synchromodal Transport Planning at a Logistics Service Provider

Part of the Lecture Notes in Logistics book series (LNLO)


In this chapter, we consider synchromodal planning of transport orders with the objective to minimize costs, delays, and CO2 emissions. Synchromodal planning is a form of multimodal planning in which the best possible combination of transport modes is selected for every transport order. The underlying problem is known as the multi-objective k-shortest path problem, in which we search for the k-shortest paths through a multimodal network, taking into account time-windows of orders, schedules for trains and barges, and closing times of hubs. We present a synchromodal planning algorithm that is implemented at a 4PL service provider located in the Netherlands. We illustrate our approach using simulation with order and network data from this logistics service provider. On the corridor from the Netherlands to Italy, an average cost reduction of 10.1 % and a CO2 reduction of 14.2 % can be achieved with synchromodal planning.


Synchromodal transport Intermodal transport Transportation planning Shortest path problem Decision support systems 


  1. Boardman BS, Malstrom EM, Butler DP, Cole MH (1997) Computer assisted routing of intermodal shipments. Comput Ind Eng 33(1):311–314CrossRefGoogle Scholar
  2. Caris A, Macharis C, Janssens GK (2008) Planning problems in Intermodal freight transport: accomplishments and prospects. Transp Planning Technol 31(3):277–302CrossRefGoogle Scholar
  3. Climaco J, Martins E (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11(4):399–404CrossRefMathSciNetMATHGoogle Scholar
  4. Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28(2):652–673CrossRefMathSciNetMATHGoogle Scholar
  5. Horn ME (2004) Procedures for planning multi-leg journeys with fixed-route and demand responsive passenger transport services. Transp Res Part C Emerg Technol 12(1):33–55CrossRefGoogle Scholar
  6. Iacob ME, van Sinderen MJ, Steenwijk M, Verkroost P (2013) Towards a reference architecture for fuel-based carbon management systems in the logistics industry. Inf Syst Front 15(5):725–745CrossRefGoogle Scholar
  7. Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. Eur J Oper Res 153(2):400–416CrossRefMATHGoogle Scholar
  8. Martins E (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2):236–245CrossRefMATHGoogle Scholar
  9. Mote J, Murthy I, Olson D (1991) A parametric approach to solving bicriterion shortest path problems. Eur J Oper Res 53(1):81–92CrossRefMATHGoogle Scholar
  10. SteadieSeifi M, Dellaert NP, Nuijten W, Van Woensel T, Raoufi R (2014) Multimodal freight transportation planning: a literature review. Eur J Oper Res 233(1):1–15CrossRefGoogle Scholar
  11. Vanhove S, Fack V (2012) An effective heuristic for computing many shortest path alternatives in road networks. Int J Geogr Inf Sci 26(6):1031–1050CrossRefGoogle Scholar
  12. Yen J (1971) Finding the K shortest loopless paths in a network. Manage Sci 17(11):712–716CrossRefMATHGoogle Scholar
  13. Ziliaskopoulos A, Wardell W (2000) An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. Eur J Oper Res 125(3):486–502CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Industrial Engineering and Business Information SystemsUniversity of TwenteEnschedeThe Netherlands

Personalised recommendations