Computing travel plans for desired trips in public transportation systems is not exactly the same as finding a shortest driving path in a given area. Path planning in the context of public transportation systems must consider the route constraint that public vehicles serve on particular paths and that passengers cannot order the drivers to change the bus routes. Explicit representation of the route constraint helps us to design efficient algorithms that focus on viable routes for computing travel plans of interest. This paper presents two strategies for capturing the route constraint. The first strategy employs connectivity matrices, and applies special properties of matrices for quickly identifying feasible travel plans for the desired trips. The second strategy uses hubs where many service routes concentrate for computing travel plans. Our algorithms perform very well in field tests.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Path-planning algorithms for public transportation systems


    Beteiligte:
    Chao-Lin Liu, (Autor:in) / Tun-Wen Pai, (Autor:in) / Chun-Tien Chang, (Autor:in) / Chang-Ming Hsieh, (Autor:in)


    Erscheinungsdatum :

    2001-01-01


    Format / Umfang :

    706473 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Path-Planning Algorithms for Public Transportation Systems

    Liu, C. / Pai, T. / Chang, C. et al. | British Library Conference Proceedings | 2001



    BEST-PATH PLANNING FOR PUBLIC TRANSPORTATION SYSTEMS

    Liu, C.-L. / IEEE | British Library Conference Proceedings | 2002


    PUBLIC TRANSPORTATION OPERATION PLANNING DEVICE, PUBLIC TRANSPORTATION OPERATION PLANNING METHOD, AND PUBLIC TRANSPORTATION OPERATION PLANNING SYSTEM

    NAGAI TORU / SAKAMOTO TOSHIYUKI / OKUDE MARIKO et al. | Europäisches Patentamt | 2019

    Freier Zugriff

    Transportation path planning method

    TAN HANHUA / MAO GUOQING / HAN ZHENZHONG et al. | Europäisches Patentamt | 2021

    Freier Zugriff