Abstract
| Original language | English |
|---|---|
| Title of host publication | Computational Logistics |
| Subtitle of host publication | 6th International Conference, ICCL 2015, Delft, The Netherlands, September 23-25, 2015, Proceedings |
| Editors | Francesco Corman, Stefan Voβ, Rudy R. Negenborn |
| Place of Publication | Cham |
| Publisher | Springer |
| Pages | 61-75 |
| ISBN (Electronic) | 978-3-319-24264-4 |
| ISBN (Print) | 978-3-319-24263-7 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 6th International Conference on Computational Logistics, ICCL 2015 - Delft, Netherlands Duration: 24 Aug 2015 → 24 Aug 2015 Conference number: 6 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 9335 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 6th International Conference on Computational Logistics, ICCL 2015 |
|---|---|
| Abbreviated title | ICCL |
| Country | Netherlands |
| City | Delft |
| Period | 24/08/15 → 24/08/15 |
Fingerprint
Keywords
- METIS-313576
- IR-98418
- Urban distribution
- Transportation planning
- Consolidation
- Approximate Dynamic Programming
Cite this
}
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 proceeding › Conference contribution › Academic › peer-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 -