Pickup and delivery planning for the crowdsourced freight delivery routing problem

Jingxian Zhang

PLOS ONE, 2025, vol. 20, issue 2, 1-10

Abstract: 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.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0318432 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 18432&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0318432

DOI: 10.1371/journal.pone.0318432

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().