IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v205y2026ics1366554525005332.html

An integrated optimization approach for e-order fulfillment using self-owned and crowdsourced delivery

Author

Listed:
  • Jiang, Dapei
  • Li, Xiangyong
  • Yang, Wei
  • Zhao, Yuxuan

Abstract

In this paper, we investigate the e-order fulfillment problem with crowdsourced delivery personnel (EOFP-CDP), which aims to enhance order fulfillment performance by integrating crowdsourced delivery with self-owned logistics. We begin by presenting a mixed-integer programming formulation that enables the determination of optimal solutions for small-scale instances, capturing the complexities of the problem. We then propose a heuristic algorithm that combines adaptive large neighborhood search with variable neighborhood search. Through extensive experiments, we demonstrate the effectiveness of this algorithm in improving e-order fulfillment performance. We also conduct a comprehensive sensitivity analysis to examine the impact of crowdsourced delivery on e-order fulfillment. Specifically, we explore the role of key cost factors–such as travel, loading, and time costs–associated with crowdsourced delivery personnel and their influence on fulfillment outcomes. Finally, a case study based on JD.com validates the practical advantages of the consolidation-delivery mode within e-tailer fulfillment systems.

Suggested Citation

  • Jiang, Dapei & Li, Xiangyong & Yang, Wei & Zhao, Yuxuan, 2026. "An integrated optimization approach for e-order fulfillment using self-owned and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    • Handle: RePEc:eee:transe:v:205:y:2026:i:c:s1366554525005332
    DOI: 10.1016/j.tre.2025.104505
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525005332
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104505?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transe:v:205:y:2026:i:c:s1366554525005332. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.