• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.146-164
• /
• 2022

Recently, the Korean government promoted the construction of metropolitan express subway to connect major transportation hub in the metropolitan area within 30 minutes. Most stations of the metropolitan express subway are connected to existing subway stations, so the importance of transfer increased. Although many studies have been conducted on the effect of transfer penalty on route choice, there are few studies on the transfer behavior of the metropolitan express subway. Therefore, in this study, a transfer behavior analysis was conducted on the Shinbundang Line, a representative metropolitan express subway. To analyze the transfer behavior according to the degree of traffic congestion and the presence of fare payment, route choice models were made using transport card data divided according to week, time, and user characteristics. As a result of the analysis, users of the metropolitan express subway had greater disutility to the transfer waiting time compared to the transfer moving time. Furthermore, especially during the peak time, EIVM(Equivalent in-vehicle minutes) of the transfer waiting time was 3.51. In this study, EIVM for metropolitan express subway users were analyzed to be 2.6 minutes, which is significantly lower than the results of previous studies on subways. This suggests that there is a difference in the transfer penalty between subways and metropolitan express subway, and that it is necessary to apply the transfer penalty between subways and express subway differently when forecasting subway traffic demand.

• Journal of Korean Society of Transportation
• /
• v.27 no.3
• /
• pp.49-58
• /
• 2009

Four alternative plans for the bus network in Daejeon metropolitan city, which have different hierarchical structure, were proposed : Alternative 1 represents a bus network without hierarchical structure, and Alternative 2, 3, and 4 represent bus networks with primary, intermediate, and advanced hierarchical structures, respectively. Efficiency of the alternative plans were evaluated based on the evaluation index including travel time cost, waiting time cost, and transition penalty cost. The travel time cost was decreased as the level of hierarchical structure gets higher until it reaches the extremely high level. As the level of hierarchical structure get higher, the waiting time cost significantly decreased while the transition penalty cost increased. Collectively, a bus network with hierarchical structure was shown to be more efficient than without it in the light of total travel cost. For the bus network with hierarchical structure, total travel cost shows a concave curve, which implies that there exists an optimal level of hierarchical structure in a bus network.

• 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.