Haiying Li

Haiying Li

Auto-generated profile, based on publicly available information

Haiying Li

Beijing Jiaotong University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2016 in Sustainability
Verified
Journal Article
Open access
PDF file
CDChuan Ding
Chuan Ding
DWDonggen Wang
Donggen Wang
Xiaolei MaXiaolei Ma
Xiaolei Ma
HLHaiying Li
Haiying Li
Understanding the relationship between short-term subway ridership and its influential factors is crucial to improving the accuracy of short-term subway ridership prediction. Although there has been a growing body of studies on short-term ridership prediction approaches, limited effort is made to investigate the short-term subway ridership prediction considering bus transfer activities and temporal features. To fill this gap, a relatively recent data mining approach called gradient boosting decision trees (GBDT) is applied to short-term subway ridership prediction and used to capture the associations with the independent variables. Taking three subway stations in Beijing as the cases, the short-term subway ridership and alighting passengers from its adjacent bus stops are obtained based on transit smart card data. To optimize the model performance with different combinations of regularization parameters, a series of GBDT models are built with various learning rates and tree complexities by fitting a maximum of trees. The optimal model performance confirms that the gradient boosting approach can incorporate different types of predictors, fit complex nonlinear relationships, and automatically handle the multicollinearity effect with high accuracy. In contrast to other machine learning methods—or “black-box” procedures—the GBDT model can identify and rank the relative influences of bus transfer activities and temporal features on short-term subway ridership. These findings suggest that the GBDT model has considerable advantages in improving short-term subway ridership prediction in a multimodal public transportation system.

12 February 2018 in Transportmetrica B: Transport Dynamics
Verified
Journal Article
Closed access
XXXinyue Xu
Xinyue Xu
HLHaiying Li
Haiying Li
JLJun Liu
Jun Liu
BRBin Ran
Bin Ran
LQLingqiao Qin
Lingqiao Qin
This paper addresses the problem of passenger flow control in a multi-line subway network during peak hours. A new multi-station coordinated passenger flow control model is proposed to simultaneously adjust the number of inbound and transfer passengers entering multiple stations or lines. The implementation of passenger flow control governs the redundant passengers to queue at given facilities, which is similar to ramp metering that regulates the number of vehicles entering a highway segment. The proposed model is a bi-level programming, whose upper level aims to optimize the system performance with different passenger flow control strategies, while the lower level is a logit-based stochastic user equilibrium assignment problem under a given strategy, considering passenger flow evolution, dynamic path cost, and route choice. An algorithm, integrating the method of successive averages with genetic algorithm, is developed to solve the model. A real-world case study is conducted to examine the validity.

15 March 2020 in Transportation Letters
Verified
Journal Article
Closed access
FJFeifan Jia
Feifan Jia
XJXi Jiang
Xi Jiang
HLHaiying Li
Haiying Li
XYXueqiao Yu
Xueqiao Yu
XXXinyue Xu
Xinyue Xu
MJMan Jiang
Man Jiang
The calculation and analysis of subway network capacity is one of the core issues of network operation. This paper focuses on this topic and proposes a passenger-oriented network capacity calculation method. First, subway network capacity is defined as maximum passenger demand that the network can serve under certain level of service requirement. Next, a method to calculate network capacity based on pressure test and simulation experiment is proposed. The key steps of this method such as level of service estimation and passenger demand loading in this method are studied. And then a mesoscopic model and simulation system of subway system are built as method implementation platform. Finally, Beijing subway network is taken as the case study to calculate and analyze network capacity in different level of service requirement during peak hours. It is found out that transfer stations are the bottlenecks that constrain network capacity, and congestion usually performs clustering characteristics taking transfer stations as centers.

18 August 2022 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
JZJunduo Zhao
Junduo Zhao
HLHaiying Li
Haiying Li
LMLingyun Meng
Lingyun Meng
JMJianrui Miao
Jianrui Miao
In the rapidly changing multimodal transportation market, not only the obligation in providing train services but also the responsibility in helping other transportation modes to meet emergencies are instrumental for maximizing the generalized benefit of railway companies, leading to an increased utilization. This paper proposes an optimization framework, which includes multiple dispatching measures of arranging residual seats, modifying stopping plans, and inserting additional trains, to design a rescheduling operation plan on a high-speed rail corridor to meet the passenger demand of unexpected large passenger flow (ULPF), which is generated from the disruption of other transportation modes. Considering the revenues of shifting passengers and the costs of the three dispatching measures as two objectives, we formulate a linear integer programming (LIP) model by employing a time-space network to obtain an optimization rescheduling operation plan. Several experiments based on the Beijing-Shanghai high-speed railway corridor are conducted to evaluate the effectiveness and efficiency of the proposed model. The experimental results demonstrate that the proposed model can be used to obtain a reasonable rescheduling operation plan for serving the passengers from ULPF within an acceptable calculation timeframe.

1 January 2024 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
ZLZhengwen Liao
Zhengwen Liao
HLHaiying Li
Haiying Li
JMJianrui Miao
Jianrui Miao
LMLingyun Meng
Lingyun Meng
Railway capacity estimation problem is typically defined as estimating the maximum number of trains that can be operated in a railway section within a given time interval. However, trains with different speeds, routes, and stopping patterns in a railway network will likely compete for the limited capacity of network nodes and sections. As these trains may provide different services, it is ambiguous to simply indicate the network capacity by a scalar number of trains. To comprehensively estimate and interpret the railway capacity considering the capacity competition between heterogeneous trains, we propose a multiobjective perspective for the capacity estimation problem to enrich the capacity theory while handling the competition among trains with different routes and stopping patterns. Based on a time‐space network timetable saturation model, we extend the multiobjective capacity estimation approach to the detailed timetable level by optimizing the saturated timetable under capacity estimation objectives with respect to different routes and stopping patterns. With the ε‐constraint method, we can obtain the Pareto front of saturated timetables, i.e., a set of nondominated optimized timetables that no more candidate train can be additionally scheduled. The result is a more comprehensive capacity representation than a single absolute scalar number. A case study is conducted on a combined high‐speed and intercity network of Zhengzhou Railway group in China. An extensive set of Pareto‐optimal saturated timetables describing the effects on the capacity of the railway network is obtained. The results can help infrastructure managers select saturated timetables as the capacity utilization reference by considering the trade‐off between time indexes from passengers’ and operators’ perspectives.

11 March 2016
Verified
Book Chapter
Closed access
PDF file
MJMan Jiang
Man Jiang
HLHaiying Li
Haiying Li
LMLingyun Meng
Lingyun Meng