Development of the Algorithm of a Public Transportation Route Search Considering the Resistance Value of Traffic Safety and Environmental Index

Kim, Young Ho; Lee, Seon-Ha; Cheon, Choon-Keun; Yu, Byung-Young

doi:10.12815/kits.2017.16.1.78

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And as for their data structure, they use networks consisting of nodes, which represent stops, and links, which represent connection between nodes, and each link stores cost such as travel time, travel distance, etc. In addition, transfer penalty that influences path selection is also used as the cost of a link (Kim et al, 2017).…”

Section: Introductionmentioning

confidence: 99%

Improved Public Transit Routing Algorithm for Finding the Shortest K-Path

Jeon

Nam

Chulmin

2018

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

<p><strong>Abstract.</strong> Most of the existing public transit routing algorithms were developed on the basis of graph theory. Recently, algorithms are being developed that can compute for O-D public transit paths by using timetable information only, not using network structure consisting of nodes and links. The timetable-based public transit routing algorithm produces one shortest path to destination, using departure time and arrival time by stop. But it has limitations in reflecting additional factors, such as transfer penalty and alternative path selection, in the process of path calculation. In addition, since public transit passengers tend to choose one among various alternative paths, it is necessary to calculate multiple paths rather than a single path as in the existing methods. Therefore, this study proposes an improved RAPTOR algorithm that can consider transfer penalty and produce multiple paths, while it is based on RAPTOR, the existing timetable-based public transit routing algorithm. The transfer penalty was applied at the point of transfer, and differently according to transfer types. As a result of analyzing computed paths of the algorithms before and after improvement, it was found that computed paths with the improved RAPTOR algorithm proposed by this study were more similar to Seoul public transit passengers' actual travel paths than computed paths by the existing RAPTOR alone.</p>

show abstract

Section: Introductionmentioning

confidence: 99%