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

A New Formulation for the Dial-a-Ride Problem

Author

Listed:
  • Yannik Rist

    (School of Maths and Physics, University of Queensland, St. Lucia, Queensland 4072, Australia)

  • Michael A. Forbes

    (School of Maths and Physics, University of Queensland, St. Lucia, Queensland 4072, Australia)

Abstract

This paper proposes a new mixed integer programming formulation and branch and cut (BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning problem where several vehicles must serve a set of customers, each of which has a pickup and delivery location, and includes time window and ride time constraints. We develop “restricted fragments,” which are select segments of routes that can represent any DARP route. We show how to enumerate these restricted fragments and prove results on domination between them. The formulation we propose is solved with a BC algorithm, which includes new valid inequalities specific to our restricted fragment formulation. The algorithm is benchmarked on existing and new instances, solving nine existing instances to optimality for the first time. In comparison with current state-of-the-art methods, run times are reduced between one and two orders of magnitude on large instances.

Suggested Citation

  • Yannik Rist & Michael A. Forbes, 2021. "A New Formulation for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 55(5), pages 1113-1135, September.
    • Handle: RePEc:inm:ortrsc:v:55:y:2021:i:5:p:1113-1135
    DOI: 10.1287/trsc.2021.1044
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1044
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1044?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:55:y:2021:i:5:p:1113-1135. 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.