Pickup and delivery planning for the crowdsourced freight delivery routing problem.
Pickup and delivery problem (PDP) and dynamic vehicle routing problem (DVRP) are two key components of crowdsourced freight delivery services. Although previous research has focused predominantly on static vehicle routing problems, this study formally defines the dynamic problem specific to crowdsou...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0318432 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850190180197072896 |
|---|---|
| author | Jingxian Zhang |
| author_facet | Jingxian Zhang |
| author_sort | Jingxian Zhang |
| collection | DOAJ |
| description | Pickup and delivery problem (PDP) and dynamic vehicle routing problem (DVRP) are two key components of crowdsourced freight delivery services. Although previous research has focused predominantly on static vehicle routing problems, this study formally defines the dynamic problem specific to crowdsourced freight delivery and presents a mixed-integer linear programming model based on a rolling-horizon framework. The objective is to minimize total service costs, including fixed vehicle costs, transportation costs, and penalty costs for delays, while planning routes that cover all orders. To solve this combinatorial optimization problem, we propose an improved partheno genetic algorithm (IPGA) and a simulated annealing algorithm (SA). Numerical experiments demonstrate that the IPGA outperforms the SA, reducing the total service costs by over 10% on average. In addition, a real-world case study illustrates the practical applicability of our model and algorithms, providing a solid foundation for real-world implementation. |
| format | Article |
| id | doaj-art-c2f4afb3380d418f97d5546b1619f8a8 |
| institution | OA Journals |
| issn | 1932-6203 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj-art-c2f4afb3380d418f97d5546b1619f8a82025-08-20T02:15:23ZengPublic Library of Science (PLoS)PLoS ONE1932-62032025-01-01202e031843210.1371/journal.pone.0318432Pickup and delivery planning for the crowdsourced freight delivery routing problem.Jingxian ZhangPickup and delivery problem (PDP) and dynamic vehicle routing problem (DVRP) are two key components of crowdsourced freight delivery services. Although previous research has focused predominantly on static vehicle routing problems, this study formally defines the dynamic problem specific to crowdsourced freight delivery and presents a mixed-integer linear programming model based on a rolling-horizon framework. The objective is to minimize total service costs, including fixed vehicle costs, transportation costs, and penalty costs for delays, while planning routes that cover all orders. To solve this combinatorial optimization problem, we propose an improved partheno genetic algorithm (IPGA) and a simulated annealing algorithm (SA). Numerical experiments demonstrate that the IPGA outperforms the SA, reducing the total service costs by over 10% on average. In addition, a real-world case study illustrates the practical applicability of our model and algorithms, providing a solid foundation for real-world implementation.https://doi.org/10.1371/journal.pone.0318432 |
| spellingShingle | Jingxian Zhang Pickup and delivery planning for the crowdsourced freight delivery routing problem. PLoS ONE |
| title | Pickup and delivery planning for the crowdsourced freight delivery routing problem. |
| title_full | Pickup and delivery planning for the crowdsourced freight delivery routing problem. |
| title_fullStr | Pickup and delivery planning for the crowdsourced freight delivery routing problem. |
| title_full_unstemmed | Pickup and delivery planning for the crowdsourced freight delivery routing problem. |
| title_short | Pickup and delivery planning for the crowdsourced freight delivery routing problem. |
| title_sort | pickup and delivery planning for the crowdsourced freight delivery routing problem |
| url | https://doi.org/10.1371/journal.pone.0318432 |
| work_keys_str_mv | AT jingxianzhang pickupanddeliveryplanningforthecrowdsourcedfreightdeliveryroutingproblem |