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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Parallel Auction Algorithm for Bus Rescheduling


    Beteiligte:
    Hickman, Mark (Herausgeber:in) / Mirchandani, Pitu (Herausgeber:in) / Voß, Stefan (Herausgeber:in) / Li, Jing-Quan (Autor:in) / Mirchandani, Pitu B. (Autor:in) / Borenstein, Denis (Autor:in)


    Erscheinungsdatum :

    2008-01-01


    Format / Umfang :

    19 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    An algorithm for train rescheduling using rescheduling pattern description language R

    Hirai, C. / Tomii, N. / Tashiro, Y. et al. | British Library Conference Proceedings | 2006


    RESCHEDULING SYSTEM, RESCHEDULING METHOD, SCHEDULE PREDICTION SIMULATOR UNIT, RESCHEDULING DECISION UNIT, AND SET OF PROGRAMS FOR RESCHEDULING

    HAYASHI YOSHIHARU / HORI YOSHINARI / SEKIAI TAKAAKI et al. | Europäisches Patentamt | 2022

    Freier Zugriff

    Research on Greedy Train Rescheduling Algorithm

    He, Z. / Li, H. / Miao, J. et al. | British Library Conference Proceedings | 2009


    Train rescheduling algorithm which minimizes passengers' dissatisfaction

    Norio, Tomii / Yoshiaki, Tashiro / Noriyuki, Tanabe et al. | Tema Archiv | 2005