Dynamic multi-period freight consolidation

Arturo Eduardo Perez Rivera, Martijn R.K. Mes

Research output: Book/ReportReportProfessional

55 Downloads (Pure)

Abstract

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
No.473

Fingerprint

Consolidation
Dynamic programming
Logistics
Costs

Keywords

  • IR-104016
  • METIS-321868

Cite this

Perez Rivera, A. E., & Mes, M. R. K. (2016). Dynamic multi-period freight consolidation. (BETA working papers; No. 473). Eindhoven, the Netherlands: TU Eindhoven, Research School for Operations Management and Logistics (BETA).
Perez Rivera, Arturo Eduardo ; Mes, Martijn R.K. / Dynamic multi-period freight consolidation. Eindhoven, the Netherlands : TU Eindhoven, Research School for Operations Management and Logistics (BETA), 2016. 16 p. (BETA working papers; 473).
@book{741c79e0bf344ae3ae1025c33f44c292,
title = "Dynamic multi-period freight consolidation",
abstract = "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.",
keywords = "IR-104016, METIS-321868",
author = "{Perez Rivera}, {Arturo Eduardo} and Mes, {Martijn R.K.}",
year = "2016",
language = "English",
series = "BETA working papers",
publisher = "TU Eindhoven, Research School for Operations Management and Logistics (BETA)",
number = "473",
address = "Netherlands",

}

Perez Rivera, AE & Mes, MRK 2016, Dynamic multi-period freight consolidation. BETA working papers, no. 473, TU Eindhoven, Research School for Operations Management and Logistics (BETA), Eindhoven, the Netherlands.

Dynamic multi-period freight consolidation. / Perez Rivera, Arturo Eduardo; Mes, Martijn R.K.

Eindhoven, the Netherlands : TU Eindhoven, Research School for Operations Management and Logistics (BETA), 2016. 16 p. (BETA working papers; No. 473).

Research output: Book/ReportReportProfessional

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 -

Perez Rivera AE, Mes MRK. Dynamic multi-period freight consolidation. Eindhoven, the Netherlands: TU Eindhoven, Research School for Operations Management and Logistics (BETA), 2016. 16 p. (BETA working papers; 473).