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 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/Territory | Netherlands |
City | Delft |
Period | 24/08/15 → 24/08/15 |
Keywords
- Urban distribution
- Transportation planning
- Consolidation
- Approximate dynamic programming