• Title/Summary/Keyword: Station transfer penalty

Search Result 2, Processing Time 0.016 seconds

Link Label-Based Optimal Path Algorithm Considering Station Transfer Penalty - Focusing on A Smart Card Based Railway Network - (역사환승페널티를 고려한 링크표지기반 최적경로탐색 - 교통카드기반 철도네트워크를 중심으로 -)

  • Lee, Mee Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.6
    • /
    • pp.941-947
    • /
    • 2018
  • 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.

Micro-scale Public Transport Accessibility by Stations - KTX Seoul Station Case Study - (정류장 단위의 미시적 대중교통 접근성 분석 - KTX 서울역 사례연구 -)

  • Choi, Seung U;Jun, Chul Min;Cho, Seong Kil
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.9-16
    • /
    • 2016
  • As the need of eco-friendly transportation systems for sustainable development increases, public transport accessibility has been considered as an important element of transportation system design. When analyzing the accessibility, shortest path algorithms can be utilized to reflect the actual movement and we can obtain high resolution accessibility for all other stations on the network with shortest distance and time. This study used the algorithm improved by reflecting the penalty of number of transfers and waiting time of overlapped routes to get the accessibility. KTX Seoul Station is a target place and this algorithm is applied to multi-layer subway bus network of Seoul to calculate the accessibility, therefore this study presented the accessibility of KTX Seoul station by stations.