Public transport applications, which aim to propose the ideal route to end users, have commonly been used by passengers. However, the ideal route for public transport varies depending on the preferences of users. The shortest path is preferred by most users as a primary criterion for the ideal route. According to our research, Dijkstra's Algorithm is mostly used in order to find shortest path. However, Dijkstra's Algorithm is not efficient for public transport route planning, because it ignores number of transfers and walking distances. Thus, in order to minimize these shortcomings, Dijkstra's Algorithm is modified by implementing penalty system in our study. Additionally, our modified algorithm is tested on the real world transport network of Izmir and compared with the results of Dijkstra's Algorithm. It is observed that our modified algorithm is quite efficient for route planning in the public transport network in terms of the number of transfers, distance of proposed route and walking distance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Public transport route planning: Modified dijkstra's algorithm


    Contributors:


    Publication date :

    2017-10-01


    Size :

    148343 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Ship voyage optimisation considering environmental forces using the iterative Dijkstra's algorithm

    Bahrami, Navid / Siadatmousavi, Seyed Mostafa | Taylor & Francis Verlag | 2024



    Multimodal Route Planning With Public Transport and Carpooling

    Huang, Haosheng / Bucher, Dominik / Kissling, Julian et al. | IEEE | 2019


    Finding Shortest Path in Road Networks Based on Jam-Distance Graph and Dijkstra’s Algorithm

    Ali, Sarah Fouad / Abdulrazzaq, Musaab Riyadh / Gaata, Methaq Talib | Springer Verlag | 2022