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
This is a preview of subscription content, log in to check access.
Boardman BS, Malstrom EM, Butler DP, Cole MH (1997) Computer assisted routing of intermodal shipments. Comput Ind Eng 33(1):311–314CrossRefGoogle Scholar
Caris A, Macharis C, Janssens GK (2008) Planning problems in Intermodal freight transport: accomplishments and prospects. Transp Planning Technol 31(3):277–302CrossRefGoogle Scholar
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
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
Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. Eur J Oper Res 153(2):400–416CrossRefMATHGoogle Scholar
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