Dynamic Capacitated Vehicle Routing Problem with Stochastic Requests Using Deep Reinforcement Learning
With the rapid growth of industries like e-commerce, food delivery, and ride-hailing, research on the Vehicle Routing Problem (VRP) is becoming increasingly relevant. However, most of the research in the field of VRP is based on static delivery tasks. In such tasks, the information about customer and order requests is provided before the delivery vehicle departs from the depot, and it remains constant during delivery. However, in the real world, the delivery tasks are often dynamic, where only some orders are known before the vehicle departs from the depot, and the rest of the orders are disclosed over time [1].
Authors
- Huiqiao Fu (ORCID: https://orcid.org/0000-0001-9403-2449)
- Kaiqiang Tang (ORCID: https://orcid.org/0000-0002-7456-0962)
- Guizhou Deng (ORCID: https://orcid.org/0000-0001-6589-4402)
- Jiasheng Liu (ORCID: https://orcid.org/0000-0001-6094-3420)
- Yun Lu (ORCID: https://orcid.org/0000-0001-8865-4452)
- Chunlin Chen (ORCID: https://orcid.org/0000-0003-3929-4707)
Institutions
- Nanjing University (CN)
Publication Details
- Published
- 2024-10-06
- DOI
- https://doi.org/10.1109/smc54092.2024.10831573
- Primary Topic
- Traffic control and management
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China