An approximate dynamic programming approach to urban freight distribution with batch arrivals

Research output: Book/ReportReportProfessional

4 Citations (Scopus)
98 Downloads (Pure)

Abstract

We study a dispatch problem with uncontrolled batch arrivals of LTL orders at an urban consolidation center. These arrivals re ect the delivery of goods by independent carriers. The speci c order properties (e.g., destination, size, delivery window) may be highly varying in city logistics, and directly distributing an incoming batch may yield high costs. Instead, the hub operator may decide to wait for incoming batches that allow for more e cient distribution. A waiting policy is required to decide which orders to ship and which orders to hold. We model the dispatching problem as a Markov decision problem. Dynamic Programming (DP) is applied to solve toy-sized instances. To solve realistic instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that the ADP approach closely approximates the optimal values of DP for small instances, and outperforms two benchmark policies for larger instances
Original languageEnglish
PublisherBETA Research School for Operations Management and Logistics
Number of pages25
Publication statusPublished - 2015

Publication series

NameBETA working paper
PublisherBeta, Research School for Operations Management and Logistics
No.474

Fingerprint

Dynamic programming
Consolidation
Logistics
Costs
Experiments

Keywords

  • IR-98422
  • METIS-313582

Cite this

van Heeswijk, W. J. A., Mes, M. R. K., & Schutten, J. M. J. (2015). An approximate dynamic programming approach to urban freight distribution with batch arrivals. (BETA working paper; No. 474). BETA Research School for Operations Management and Logistics.
@book{705cbe2223f949e79fbdf30438275741,
title = "An approximate dynamic programming approach to urban freight distribution with batch arrivals",
abstract = "We study a dispatch problem with uncontrolled batch arrivals of LTL orders at an urban consolidation center. These arrivals re ect the delivery of goods by independent carriers. The speci c order properties (e.g., destination, size, delivery window) may be highly varying in city logistics, and directly distributing an incoming batch may yield high costs. Instead, the hub operator may decide to wait for incoming batches that allow for more e cient distribution. A waiting policy is required to decide which orders to ship and which orders to hold. We model the dispatching problem as a Markov decision problem. Dynamic Programming (DP) is applied to solve toy-sized instances. To solve realistic instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that the ADP approach closely approximates the optimal values of DP for small instances, and outperforms two benchmark policies for larger instances",
keywords = "IR-98422, METIS-313582",
author = "{van Heeswijk}, W.J.A. and Mes, {Martijn R.K.} and Schutten, {Johannes M.J.}",
year = "2015",
language = "English",
series = "BETA working paper",
publisher = "BETA Research School for Operations Management and Logistics",
number = "474",

}

van Heeswijk, WJA, Mes, MRK & Schutten, JMJ 2015, An approximate dynamic programming approach to urban freight distribution with batch arrivals. BETA working paper, no. 474, BETA Research School for Operations Management and Logistics.

An approximate dynamic programming approach to urban freight distribution with batch arrivals. / van Heeswijk, W.J.A.; Mes, Martijn R.K.; Schutten, Johannes M.J.

BETA Research School for Operations Management and Logistics, 2015. 25 p. (BETA working paper; No. 474).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - An approximate dynamic programming approach to urban freight distribution with batch arrivals

AU - van Heeswijk, W.J.A.

AU - Mes, Martijn R.K.

AU - Schutten, Johannes M.J.

PY - 2015

Y1 - 2015

N2 - We study a dispatch problem with uncontrolled batch arrivals of LTL orders at an urban consolidation center. These arrivals re ect the delivery of goods by independent carriers. The speci c order properties (e.g., destination, size, delivery window) may be highly varying in city logistics, and directly distributing an incoming batch may yield high costs. Instead, the hub operator may decide to wait for incoming batches that allow for more e cient distribution. A waiting policy is required to decide which orders to ship and which orders to hold. We model the dispatching problem as a Markov decision problem. Dynamic Programming (DP) is applied to solve toy-sized instances. To solve realistic instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that the ADP approach closely approximates the optimal values of DP for small instances, and outperforms two benchmark policies for larger instances

AB - We study a dispatch problem with uncontrolled batch arrivals of LTL orders at an urban consolidation center. These arrivals re ect the delivery of goods by independent carriers. The speci c order properties (e.g., destination, size, delivery window) may be highly varying in city logistics, and directly distributing an incoming batch may yield high costs. Instead, the hub operator may decide to wait for incoming batches that allow for more e cient distribution. A waiting policy is required to decide which orders to ship and which orders to hold. We model the dispatching problem as a Markov decision problem. Dynamic Programming (DP) is applied to solve toy-sized instances. To solve realistic instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that the ADP approach closely approximates the optimal values of DP for small instances, and outperforms two benchmark policies for larger instances

KW - IR-98422

KW - METIS-313582

M3 - Report

T3 - BETA working paper

BT - An approximate dynamic programming approach to urban freight distribution with batch arrivals

PB - BETA Research School for Operations Management and Logistics

ER -

van Heeswijk WJA, Mes MRK, Schutten JMJ. An approximate dynamic programming approach to urban freight distribution with batch arrivals. BETA Research School for Operations Management and Logistics, 2015. 25 p. (BETA working paper; 474).