HighlightsWe present an MDP model for selecting freights in intermodal long-haul round-trips.We provide an ADP algorithm to solve the MDP model and compute a look-ahead policy.The approach is illustrated using information from a Dutch Logistic Service Provider.Our experiments show that an ADP policy reduces costs up to 25.5%.We provide managerial insights concerning various problem characteristics.
AbstractWe consider the planning problem faced by Logistic Service Providers (LSPs) transporting freights periodically, using long-haul round-trips. In each round-trip, freights are delivered and picked up at different locations within one region. Freights have time-windows and become known gradually over time. Using probabilistic knowledge about future freights, the LSP’s objective is to minimize costs over a multi-period horizon. We propose a look-ahead planning method using Approximate Dynamic Programming. Experiments show that our approach reduces costs up to 25.5% compared to a single-period optimization approach. We provide managerial insights for several intermodal long-haul round-trips settings and provide directions for further research.
Anticipatory freight selection in intermodal long-haul round-trips
2016-09-03
19 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Anticipatory Freight Selection in Intermodal Long-haul Round-trips
Online Contents | 2017
|Long-Haul Freight Transportation
Springer Verlag | 1999
|INTERMODAL FREIGHT TRANSPORT SYSTEM AND INTERMODAL FREIGHT TRANSPORTING METHOD
Europäisches Patentamt | 2020
INTERMODAL FREIGHT TRANSPORT SYSTEM AND INTERMODAL FREIGHT TRANSPORTING METHOD
Europäisches Patentamt | 2020
|Intermodal freight transportation
SLUB | 1999
|