Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2017 International Conference on Computer Science and Engineering (UBMK) 2017
DOI: 10.1109/ubmk.2017.8093444
|View full text |Cite
|
Sign up to set email alerts
|

Public transport route planning: Modified dijkstra's algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
3

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 41 publications
(23 citation statements)
references
References 4 publications
0
16
0
3
Order By: Relevance
“…If the i-th intersection to the j-th intersection are not directly connected or i = j, d i,j and tr i,j are assigned ∞. In this paper, the travelling time is calculated by vehicle license plate data collected by video-imaging detectors referring to [22][23][24].…”
Section: Preparations For the Trip Chain Buildingmentioning
confidence: 99%
“…If the i-th intersection to the j-th intersection are not directly connected or i = j, d i,j and tr i,j are assigned ∞. In this paper, the travelling time is calculated by vehicle license plate data collected by video-imaging detectors referring to [22][23][24].…”
Section: Preparations For the Trip Chain Buildingmentioning
confidence: 99%
“…Using one parameter can"t say we have achieved the optimal path between source and destination. To resolve this above problem, in [26], A. Bozyiğit, G. Alankuş and E. Nasiboğlu, proposed a modified Dijkstra's algorithm and it is implemented in a real-world public transport network. In this approach, the author assigned some negative value for each path and found the alternate road to achieve a good result.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A. Bozyigit et al [2] also proposed another technique to calculate the shortest path. Dijkstra's algorithm is mostly used in order to find the shortest path, but it is not efficient for public transport route planning because it ignores the number of transfer and walking distances.…”
Section: Related Workmentioning
confidence: 99%