Synchromodal Transport Planning at a Logistics Service Provider
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.