IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0318432.html
   My bibliography  Save this article

Pickup and delivery planning for the crowdsourced freight delivery routing problem

Author

Listed:
  • Jingxian Zhang

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.

Suggested Citation

  • Jingxian Zhang, 2025. "Pickup and delivery planning for the crowdsourced freight delivery routing problem," PLOS ONE, Public Library of Science, vol. 20(2), pages 1-10, February.
    • Handle: RePEc:plo:pone00:0318432
    DOI: 10.1371/journal.pone.0318432
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0318432
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0318432&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0318432?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0318432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.