IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v333y2026i3p746-761.html

A decomposition-based approach for large-scale pickup and delivery problems

Author

Listed:
  • Hiermann, Gerhard
  • Schiffer, Maximilian

Abstract

With the advent of self-driving cars, experts envision autonomous mobility-on-demand services as a promising solution to improve the status quo in overloaded transportation systems. In this context, we are interested in solving very large-scale pickup and delivery routing problems that arise in the context of on-demand mobility. We provide an algorithmic framework that sets a new state of the art in solving instances with more than 20,000 requests. Our framework comprises a decomposition based matheuristic, an iterative local search (ILS), and a hybrid algorithm that uses the matheuristic to warmstart the ILS. We provide thorough computational analyses of each algorithm’s performance, advantages, and disadvantages. Moreover, we show that our algorithmic framework allows to improve upon the state of the art for existing large-scale benchmark instances. We round off our analyses by providing managerial insights based on system improvement bounds from a full-information perspective, analyzing a real-world case study with more than 20,000 requests.

Suggested Citation

  • Hiermann, Gerhard & Schiffer, Maximilian, 2026. "A decomposition-based approach for large-scale pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 333(3), pages 746-761.
    • Handle: RePEc:eee:ejores:v:333:y:2026:i:3:p:746-761
    DOI: 10.1016/j.ejor.2026.01.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221726000779
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2026.01.037?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:ejores:v:333:y:2026:i:3:p:746-761. 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/locate/eor .

    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.