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

A collaborative evolutionary reinforcement learning approach to dynamic pickup and delivery challenges

Author

Listed:
  • Yang, Xiaoying
  • Li, Yiran
  • Cui, Tianxiang
  • Bai, Ruibin

Abstract

In the contemporary landscape of global logistics, the efficient delivery of commodities at scale has become imperative. Central to this challenge is the Dynamic Pickup and Delivery Problem (DPDP). While DPDP is inherently complex due to stochastic orders and real-time requirements, it becomes particularly formidable in specific supply chain variants constrained by strict loading protocols, such as the Last-In-First-Out (LIFO) requirement found in air cargo and side-loading fleets. Traditional heuristics often struggle to escape local optima under such rigid constraints, while standard Reinforcement Learning (RL) faces difficulties with reward sparsity and high-dimensional action spaces. To address these challenges, we propose Evo-RL, a holistic evolutionary reinforcement learning framework. Unlike disjointed hybrid methods, Evo-RL establishes a synergistic closed loop: the RL agent acts as a strategic planner to capture latent spatiotemporal dependencies and generate feasible initial assignments, while a population-based Genetic Algorithm (GA) serves as an optimization engine to refine sequences and provide dense feedback signals. This collaborative mechanism allows the RL agent to overcome reward sparsity by learning from the diverse evolutionary population. We evaluate our approach on the real-world, large-scale DPDP benchmark from the ICAPS 2021 competition. Empirical results demonstrate that Evo-RL significantly outperforms state-of-the-art heuristics and deep RL baselines in terms of solution quality and convergence speed, proving its efficacy in handling dynamic constraints and large-scale complexities.

Suggested Citation

  • Yang, Xiaoying & Li, Yiran & Cui, Tianxiang & Bai, Ruibin, 2026. "A collaborative evolutionary reinforcement learning approach to dynamic pickup and delivery challenges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 212(C).
  • Handle: RePEc:eee:transe:v:212:y:2026:i:c:s1366554526002243
    DOI: 10.1016/j.tre.2026.104885
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526002243
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104885?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:212:y:2026:i:c:s1366554526002243. 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.