Search

• Substantial surveys identify that bus queuing, merging, and repeated opening doors can significantly affect bus dwell time. • A Markov chain is designed to characterize the effect of vehicles in adjacent lane and passengers on bus merging. • A comprehensive model is proposed to estimate bus dwell time and bus queuing time. • The actual performance of the comprehensive model is validated in real cases in three cities. • The probability of bus overtaking is highly correlated with bus service time and average stop service time. The precise estimation of bus dwell time (BDT) is immensely important as it directly impacts the reliability of bus schedules and the accuracy of arrival time predictions. Various factors—such as the behavior of buses merging into the main traffic flow, uneven distribution of passengers on board, and frequent bus queues—jointly lead to a high variability of the BDT. To achieve an accurate estimation of BDT across various stop types, a comprehensive BDT model is developed in this paper. First, based on berth occupancy, probabilistic models are constructed for different bus arrival scenarios, which are then used to study corresponding bus queuing times. Second, the Bureau of Public Roads function is employed to characterize the obstruction effect occupants on the bus impose on boarding passengers. Combined with this function, a bus service time model is proposed considering the bus opening doors more than once and in-vehicle crowding. Third, the bus merging process is discretized to cope with the volatility of the time interval required for a bus to leave the bus bay. A Markov chain model is designed to calculate the time buses have to wait before merging. Case studies conducted in Qingdao, Chongqing and Beijing, China, demonstrate the effectiveness of the comprehensive model both during off-peak and peak periods. Furthermore, this paper incorporates overtaking rules into the comprehensive model to examine the influence of bus overtaking willingness and various overtaking policies on bus queuing times. Through numerical analysis, the key link is between willingness to overtake, service time and the likelihood of bus overtaking is disclosed. [ABSTRACT FROM AUTHOR]

Road disruptions frequently occur in practice, resulting in a productivity loss of bus services and widespread passenger delays. These negative impacts are significant, especially when multiple routes are influenced at the same time. In order to mitigate these impacts, this paper proposes a multi-route coordination approach that collaboratively adjusts multiple bus routes and optimizes bus timetables to provide effective alternative bus services for passengers. Three adjusting strategies are adopted for bus routes with varying passenger demand: detouring, short-running, and cancellation. To address the multi-route coordination problem, a column-generation-based two-stage framework is developed. Concretely, a column generation technique is utilized in the first stage to iteratively generate candidate adaptive bus routes and passenger paths. Following that, an integrated integer programming model is built in the second stage to simultaneously determine bus timetables and the combinations of those adaptive bus routes. After realizing the low computational efficiency for large-scale problems, this paper designs a customized decomposition algorithm based on set partitioning to solve the presented model and obtain near-optimal solutions efficiently. Finally, the proposed methodology is applied to an illustrative Sioux Falls network and a real-world bus network in Beijing to verify its validity and effectiveness. Three comparative analyses are conducted to discuss the advantages of the three adjusting strategies, to investigate the benefits of coordinating bus timetables, and to explore the applicability of different adjusting strategies, respectively. • A multi-route coordination problem for bus systems in response to road disruptions. • A column-generation-based two-stage framework to address the problem. • A customized decomposition algorithm based on set partitioning for model solving. • The framework and algorithm are applied to a real-world bus network in Beijing. [ABSTRACT FROM AUTHOR]

User profiles, considered as one of the fundamental inputs of recommendation systems and customized services, can be rationally applied in the public transport domain to represent passengers' characteristics and behavioral preferences. A user profile of a bus passenger, termed as a bus passenger profile (BPP), is an assortment of labels containing passengers' travel features. This paper proposes a data-driven framework for developing BPP so as to provide guidance on how to create and estimate user profiles for bus passengers based on smart card data. The proposed method comprises three steps. (i) Data preprocessing aimed at extracting key information and preparing passenger profiling. (ii) A tag system aimed at storing the estimated travel features of passengers. (iii) Knowledge graphs aimed at connecting various BPP with semantic edges for practical application of prior knowledge in downstream tasks. The developed framework is implemented in a case study of the Beijing bus system. Deployment of the developed framework has demonstrated that it can satisfactorily develop BPP, while prior knowledge from the BPP-based knowledge graphs can benefit downstream tasks. [ABSTRACT FROM AUTHOR]