Browsing by Author "Bozyigit, Alican"

Now showing 1 - 2 of 2

Citation - WoS: 28
Citation - Scopus: 50
Public Transport Route Planning: Modified Dijkstra's Algorithm
(IEEE, 2017-10) Bozyigit, Alican; Alankus, Gazihan; Nasiboglu, Efendi
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.
Citation - WoS: 3
A Public Transport Route Recommender Minimizing the Number of Transfers
(Yildiz Technical Univ, 2018) Bozyigit, Alican; Alankus, Gazihan; Nasibov, Efendi
Public transport is preferred by most of the people since it provides various advantages. As a result, many route-planning applications are developed for users of public transport. The general aim of these applications is proposing the ideal route for a given destination; however, there are various route-planning criteria for public transport. According to our research, the number of transfers is seen as the primary criterion for the route planning by most users. In this study, an approach for public transport is proposed in order to recommend the route that is comprised of minimum number of transfers. In this approach, Space P and a pareto optimal solution are used for modelling network, then Breadth First Search is modified to plan the ideal route on the modelled network. Furthermore, the proposed approach is experimented on the public transport network of Izmir. It is proved that from any source to any target, our route recommender returns the path with the minimum number of transfers optimally within milliseconds.