z-logo
open-access-imgOpen Access
Analysis of overlapping origin–destination pairs between bus stations to enhance the efficiency of bus operations
Author(s) -
Seo Jeongwook,
Cho ShinHyung,
Kim DongKyu,
Park Peter YoungJin
Publication year - 2020
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2019.0158
Subject(s) - public transport , transit (satellite) , transport engineering , computer science , point (geometry) , smart card , operations research , engineering , mathematics , computer security , geometry
Public transit has a significant impact on minimising traffic congestion and reducing the cost of travelling in urban areas. It is necessary to evaluate the efficiency of the public transit operation in response to the individual traveller's demands for transit. This study aims to analyse the demand for transit with overlapping origin–destination ( OD ) pairs to enhance the efficiency of transit operations. To achieve this, disaggregated‐level travel demand data, i.e. individual traveller's data are collected from an automatic fare collection system called smart card. The Kneedle algorithm is used to calculate the knee point of travel demand. The overlapping OD pairs, which are higher than the knee point value, are calculated and displayed in a map format. On the basis of the overlapping OD pairs, the demand‐based overlap index for each bus route is defined to evaluate the efficiency of bus operations. The proposed method is applied to six districts with higher transit demands than other districts in Seoul. On the basis of the results, discussion on the action plans to enhance the efficiency of bus operations are presented. The method proposed in this study contributes to improving the efficiency of the bus system by reflecting individual users’ travel demands.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here