An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Downloads (Pure)

Abstract

We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation 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 optimality. For larger instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that ADP closely approximates the optimal values for small instances, and outperforms two myopic benchmark policies for larger instances. We contribute to literature by (i) formulating a DDP with dispatch windows and (ii) proposing an approach to solve this DDP.
Original languageEnglish
Title of host publicationComputational Logistics
Subtitle of host publication6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings
EditorsFrancesco Corman, Stefan Voβ, Rudy R. Negenborn
Place of PublicationCham
PublisherSpringer
Pages61-75
ISBN (Electronic)978-3-319-24264-4
ISBN (Print)978-3-319-24263-7
DOIs
Publication statusPublished - 2015
Event6th International Conference on Computational Logistics, ICCL 2015 - Delft, Netherlands
Duration: 24 Aug 201524 Aug 2015
Conference number: 6

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9335
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Computational Logistics, ICCL 2015
Abbreviated titleICCL
CountryNetherlands
CityDelft
Period24/08/1524/08/15

Fingerprint

Dynamic programming
Consolidation
Costs
Experiments

Keywords

  • METIS-313576
  • IR-98418
  • Urban distribution
  • Transportation planning
  • Consolidation
  • Approximate Dynamic Programming

Cite this

van Heeswijk, W., Mes, M., & Schutten, M. (2015). An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. In F. Corman, S. Voβ, & R. R. Negenborn (Eds.), Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings (pp. 61-75). (Lecture Notes in Computer Science; Vol. 9335). Cham: Springer. https://doi.org/10.1007/978-3-319-24264-4_5
van Heeswijk, Wouter ; Mes, Martijn ; Schutten, Marco. / An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings. editor / Francesco Corman ; Stefan Voβ ; Rudy R. Negenborn. Cham : Springer, 2015. pp. 61-75 (Lecture Notes in Computer Science).
@inproceedings{ae08b1153f8e42259075507e3552be3d,
title = "An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals",
abstract = "We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation 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 optimality. For larger instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that ADP closely approximates the optimal values for small instances, and outperforms two myopic benchmark policies for larger instances. We contribute to literature by (i) formulating a DDP with dispatch windows and (ii) proposing an approach to solve this DDP.",
keywords = "METIS-313576, IR-98418, Urban distribution, Transportation planning, Consolidation, Approximate Dynamic Programming",
author = "{van Heeswijk}, Wouter and Martijn Mes and Marco Schutten",
year = "2015",
doi = "10.1007/978-3-319-24264-4_5",
language = "English",
isbn = "978-3-319-24263-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "61--75",
editor = "Francesco Corman and Stefan Voβ and Negenborn, {Rudy R.}",
booktitle = "Computational Logistics",

}

van Heeswijk, W, Mes, M & Schutten, M 2015, An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. in F Corman, S Voβ & RR Negenborn (eds), Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9335, Springer, Cham, pp. 61-75, 6th International Conference on Computational Logistics, ICCL 2015, Delft, Netherlands, 24/08/15. https://doi.org/10.1007/978-3-319-24264-4_5

An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. / van Heeswijk, Wouter; Mes, Martijn; Schutten, Marco.

Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings. ed. / Francesco Corman; Stefan Voβ; Rudy R. Negenborn. Cham : Springer, 2015. p. 61-75 (Lecture Notes in Computer Science; Vol. 9335).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals

AU - van Heeswijk, Wouter

AU - Mes, Martijn

AU - Schutten, Marco

PY - 2015

Y1 - 2015

N2 - We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation 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 optimality. For larger instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that ADP closely approximates the optimal values for small instances, and outperforms two myopic benchmark policies for larger instances. We contribute to literature by (i) formulating a DDP with dispatch windows and (ii) proposing an approach to solve this DDP.

AB - We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation 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 optimality. For larger instances, we propose an Approximate Dynamic Programming (ADP) approach. Through numerical experiments, we show that ADP closely approximates the optimal values for small instances, and outperforms two myopic benchmark policies for larger instances. We contribute to literature by (i) formulating a DDP with dispatch windows and (ii) proposing an approach to solve this DDP.

KW - METIS-313576

KW - IR-98418

KW - Urban distribution

KW - Transportation planning

KW - Consolidation

KW - Approximate Dynamic Programming

U2 - 10.1007/978-3-319-24264-4_5

DO - 10.1007/978-3-319-24264-4_5

M3 - Conference contribution

SN - 978-3-319-24263-7

T3 - Lecture Notes in Computer Science

SP - 61

EP - 75

BT - Computational Logistics

A2 - Corman, Francesco

A2 - Voβ, Stefan

A2 - Negenborn, Rudy R.

PB - Springer

CY - Cham

ER -

van Heeswijk W, Mes M, Schutten M. An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. In Corman F, Voβ S, Negenborn RR, editors, Computational Logistics: 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings. Cham: Springer. 2015. p. 61-75. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-24264-4_5