A scalable anticipatory policy for the dynamic pickup and delivery problem. (November 2022)
- Record Type:
- Journal Article
- Title:
- A scalable anticipatory policy for the dynamic pickup and delivery problem. (November 2022)
- Main Title:
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- Authors:
- Ghiani, Gianpaolo
Manni, Andrea
Manni, Emanuele - Abstract:
- Abstract: Dynamic vehicle dispatching and routing problems can be tackled by using either reactive policies (that optimize the overall inconvenience on the pending requests) or anticipatory policies (that consider the possible future demands). The anticipatory policies reported in the literature are typically unsuitable for the large instances often encountered in the real-world, where the inter-arrival time can be as little as a few seconds. In this article, we present a new scalable anticipatory policy for the Dynamic Pickup and Delivery Problem which amounts to design routes for a fleet of vehicles that must service a set of pickup and delivery requests, characterized by different priority classes, arriving according to an unknown (possibly time-varying) stochastic process. The algorithm utilizes a parametric policy function approximation in which the best parameter setting is chosen on-line on the basis of a mapping between instance features and policy parameters learned off-line by using simulation experiments. Computational results on large-scale randomly-generated instances indicate that our anticipatory procedure outperforms two reactive approaches while keeping the computational burden at a level suitable for real-world usage. Highlights: We study the dynamic pickup and delivery problem. Customers' requests are characterized by different priority classes. We propose a new scalable anticipatory policy. The algorithm utilizes a parametric policy functionAbstract: Dynamic vehicle dispatching and routing problems can be tackled by using either reactive policies (that optimize the overall inconvenience on the pending requests) or anticipatory policies (that consider the possible future demands). The anticipatory policies reported in the literature are typically unsuitable for the large instances often encountered in the real-world, where the inter-arrival time can be as little as a few seconds. In this article, we present a new scalable anticipatory policy for the Dynamic Pickup and Delivery Problem which amounts to design routes for a fleet of vehicles that must service a set of pickup and delivery requests, characterized by different priority classes, arriving according to an unknown (possibly time-varying) stochastic process. The algorithm utilizes a parametric policy function approximation in which the best parameter setting is chosen on-line on the basis of a mapping between instance features and policy parameters learned off-line by using simulation experiments. Computational results on large-scale randomly-generated instances indicate that our anticipatory procedure outperforms two reactive approaches while keeping the computational burden at a level suitable for real-world usage. Highlights: We study the dynamic pickup and delivery problem. Customers' requests are characterized by different priority classes. We propose a new scalable anticipatory policy. The algorithm utilizes a parametric policy function approximation. Computational results indicate that our anticipatory procedure outperforms two reactive approaches. … (more)
- Is Part Of:
- Computers & operations research. Volume 147(2022)
- Journal:
- Computers & operations research
- Issue:
- Volume 147(2022)
- Issue Display:
- Volume 147, Issue 2022 (2022)
- Year:
- 2022
- Volume:
- 147
- Issue:
- 2022
- Issue Sort Value:
- 2022-0147-2022-0000
- Page Start:
- Page End:
- Publication Date:
- 2022-11
- Subjects:
- Routing -- Dynamic pickup and delivery -- Anticipatory policies -- Parametric policy function approximation -- Supervised learning
Operations research -- Periodicals
Electronic digital computers -- Periodicals
004.05 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03050548 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cor.2022.105943 ↗
- Languages:
- English
- ISSNs:
- 0305-0548
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.770000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 23055.xml