| Title |
Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network - |
| DOI |
https://doi.org/10.12652/Ksce.2018.38.6.0941 |
| Keywords |
교통카드 단말기ID;빅노드;역사환승 패널티;링크표지기반 경로탐색 Ticket Gate ID;BigNode;Station transfer penalty;Link label-based path searching |
| Abstract |
Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed. |