Dynamic multi-period freight consolidation

Arturo Eduardo Perez Rivera, Martijn R.K. Mes

Research output: Book/ReportReportProfessional

192 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEindhoven, the Netherlands
PublisherTU Eindhoven, Research School for Operations Management and Logistics (BETA)
Number of pages16
Publication statusPublished - 2016

Publication series

NameBETA working papers
PublisherTU Eindhoven, Research School for Operations Management and Logistics (BETA


  • IR-104016
  • METIS-321868


Dive into the research topics of 'Dynamic multi-period freight consolidation'. Together they form a unique fingerprint.

Cite this