Abstract A basic routing algorithm is presented for finding optimal routes for cars in a rapid transit system. The algorithm uses predicted path cost, depth-first search, and threshold acceptance to minimize computation cost. It is applicable to synchronous, cycle-synchronous, and trans-synchronous control strategies, and will minimize either departure time, transit time, or arrival time as may be needed. Extensions of the algorithm to allow finding empty cars to answer service requests, to dynamically reroute cars in the system, and to handle multistation routes are presented.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Routing algorithms for urban rapid transit


    Beteiligte:
    Rubin, Frank (Autor:in)

    Erscheinungsdatum :

    04.11.1974


    Format / Umfang :

    9 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Robust routing of rapid transit rolling stock

    Cadarso, Luis / Marín, Ángel | Springer Verlag | 2010


    Inter urban rapid transit systems

    King, S.Y. | Tema Archiv | 1975


    Scalable Algorithms for Bicriterion Trip-Based Transit Routing

    Agarwal, Prateek / Rambha, Tarun | IEEE | 2024


    Urban rapid transit : concepts and evaluation

    Hoel, Lester A. | TIBKAT | 1968


    Congestion avoidance routing in urban rail transit networks

    He, Kun / Wang, Junjie / Lianbo Deng et al. | IEEE | 2014