Abstract
It is necessary to determine real path for urban railway users in order to allocate revenues between urban railwayorganizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label hasbeen utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on thetravel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics ofusers, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimalroute based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.
Translated title of the contribution | Railway Timetable Considering Optimal Path Finding Method in Rail Network(Focused on Revenue Allocation) |
---|---|
Original language | Korean |
Pages (from-to) | 149-156 |
Number of pages | 8 |
Journal | 한국철도학회논문집 |
Volume | 18 |
Issue number | 2 |
DOIs | |
State | Published - Apr 2015 |