TY - BOOK
T1 - Dynamic multi-period freight consolidation
AU - Perez Rivera, Arturo Eduardo
AU - Mes, Martijn R.K.
PY - 2016
Y1 - 2016
N2 - Logistic Service Providers (LSPs) o ering hinterland transportation face the trade-o between e ciently using the capacity of long-haul vehicles and minimizing the rst and last-mile costs. To achieve the optimal trade-o , freights have to be consolidated considering the variation in the arrival of freight and their characteristics, the applicable transportation restrictions, and the interdependence of decisions over time. We propose the use of a Markov model and an Approximate Dynamic Programming (ADP) algorithm to consolidate the right freights in such transportation settings. Our model incorporates probabilistic knowledge of the arrival of freights and their characteristics, as well as generic de finitions of transportation restrictions and costs. Using small test instances,
we show that our ADP solution provides accurate approximations to the optimal solution of the Markov model. Using a larger problem instance, we show that our modeling approach has signi cant bene ts when compared to common-practice heuristic approaches.
AB - Logistic Service Providers (LSPs) o ering hinterland transportation face the trade-o between e ciently using the capacity of long-haul vehicles and minimizing the rst and last-mile costs. To achieve the optimal trade-o , freights have to be consolidated considering the variation in the arrival of freight and their characteristics, the applicable transportation restrictions, and the interdependence of decisions over time. We propose the use of a Markov model and an Approximate Dynamic Programming (ADP) algorithm to consolidate the right freights in such transportation settings. Our model incorporates probabilistic knowledge of the arrival of freights and their characteristics, as well as generic de finitions of transportation restrictions and costs. Using small test instances,
we show that our ADP solution provides accurate approximations to the optimal solution of the Markov model. Using a larger problem instance, we show that our modeling approach has signi cant bene ts when compared to common-practice heuristic approaches.
KW - IR-104016
KW - METIS-321868
M3 - Report
T3 - BETA working papers
BT - Dynamic multi-period freight consolidation
PB - TU Eindhoven, Research School for Operations Management and Logistics (BETA)
CY - Eindhoven, the Netherlands
ER -