IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-73312-6_14.html
   My bibliography  Save this book chapter

Parallel Auction Algorithm for Bus Rescheduling

In: Computer-aided Systems in Public Transport

Author

Listed:
  • Jing-Quan Li

    (University of Arizona)

  • Pitu B. Mirchandani

    (University of Arizona)

  • Denis Borenstein

    (Federal University of Rio Grande do Sul)

Abstract

When a bus on a scheduled trip breaks down, one or more buses need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning buses in real-time to this cut trip, as well as to other scheduled trips with given starting and ending times, is referred to as the bus rescheduling problem (BRP). This paper considers modeling, algorithmic, and computational aspects of the single-depot BRP. The paper develops the sequential and parallel auction algorithm to solve the BRP. Computational results show that our approach solves the problem quickly.

Suggested Citation

  • Jing-Quan Li & Pitu B. Mirchandani & Denis Borenstein, 2008. "Parallel Auction Algorithm for Bus Rescheduling," Lecture Notes in Economics and Mathematical Systems, in: Mark Hickman & Pitu Mirchandani & Stefan Voß (ed.), Computer-aided Systems in Public Transport, pages 281-299, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-73312-6_14
    DOI: 10.1007/978-3-540-73312-6_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gkiotsalitis, K. & Cats, O., 2021. "At-stop control measures in public transport: Literature review and research agenda," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).

    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:spr:lnechp:978-3-540-73312-6_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.