IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v59y2025i1p104-124.html
   My bibliography  Save this article

Optimal Multi-Agent Pickup and Delivery Using Branch-and-Cut-and-Price Algorithms

Author

Listed:
  • Edward Lam

    (Department of Data Science and Artificial Intelligence, Monash University, Clayton, Victoria 3168, Australia)

  • Peter J. Stuckey

    (Department of Data Science and Artificial Intelligence, Monash University, Clayton, Victoria 3168, Australia)

  • Daniel Harabor

    (Department of Data Science and Artificial Intelligence, Monash University, Clayton, Victoria 3168, Australia)

Abstract

Given a set of agents and a set of pickup-delivery requests located on a two-dimensional grid map, the multi-agent pickup and delivery problem assigns the requests to the agents such that every agent moves from its start location to the locations of its assigned requests and finally, to its end location without colliding into other agents and that the sum of arrival times is minimized. This paper proposes two exact branch-and-cut-and-price algorithms for the problem. The first algorithm performs a three-level search. A high-level master problem selects an optimal sequence of requests and a path for every agent from a large collection. A mid-level sequencing problem and a low-level navigation problem are solved simultaneously to incrementally enlarge the collection of request sequences and paths. The second algorithm first solves the sequencing problem to find a set of request sequences and then solves the navigation problem to determine if paths compatible with the request sequences exist. Experimental results indicate that the integrated algorithm solves more instances with higher congestion, and the deferred algorithm solves more instances with lower congestion and could scale to 100 agents and 100 requests, significantly higher than a state-of-the-art suboptimal approach.

Suggested Citation

  • Edward Lam & Peter J. Stuckey & Daniel Harabor, 2025. "Optimal Multi-Agent Pickup and Delivery Using Branch-and-Cut-and-Price Algorithms," Transportation Science, INFORMS, vol. 59(1), pages 104-124, January.
  • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:1:p:104-124
    DOI: 10.1287/trsc.2023.0268
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2023.0268
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2023.0268?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
    ---><---

    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:inm:ortrsc:v:59:y:2025:i:1:p:104-124. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.