Zhengwen Liao

Dr. Zhengwen Liao

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 September 2020 in Transportation Letters
Verified
Journal Article
Closed access
ZLZhengwen Liao
Zhengwen Liao
JMJianrui Miao
Jianrui Miao
LMLingyun Meng
Lingyun Meng
HLHaiying Li
Haiying Li
Solving the practical train timetabling problem under complex real-life train operation environment is challenging. This article addresses the train timetabling problem considering the variant parameters (i.e. running time and minimum headway) depending on stop-decisions. Based on a resource-oriented decomposition representation of safety headway, the train timetabling is modeled by cumulative flow variables considering the variant parameters depending on stop-decisions. A Lagrangian relaxation-based approach (LR) is used to decompose the combinatorial train timetabling problem into train-independent shortest path sub-problems, which can be solved simultaneously by parallel computation by relaxing the capacity constraint. A capacity assessment-based heuristic is proposed for improving the feasibility reparing of LR solutions. The solution quality and efficiency are analyzed employing the real-life operational data of Wuhan to Guangzhou high-speed railway in China. The benefits of the improved heuristic and parallel computation are demonstrated in contrast with the existed approach.

22 June 2020 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Closed access
PDF file
NLNuannuan Leng
Nuannuan Leng
ZLZhengwen Liao
Zhengwen Liao
FCFrancesco Corman
Francesco Corman
In the event of public transport disruption, operating companies produce disposition timetables depending on different rescheduling strategies, such as retiming or rerouting, with services fully/partially cancelled, and also taking into account more complex, adjusted, feasible rolling stock circulation. The aim is to reduce passengers’ delays, thereby limiting detriment to passengers’ activities and their related satisfaction. The key relation between the supply of operating companies and passengers’ satisfaction is information disseminated about running services. This paper innovatively combines an optimization model and an agent-based micro-simulation model (MATSim) to explore passengers’ (dis)satisfaction with different disposition timetables and information strategies, which is helpful for operating companies to offer better services to passengers in cases of public transport disruption. Activity-based agent behaviors in a multi-modal network are simulated and agents’ delays and scores for the city of Zürich, Switzerland, analyzed. Passengers’ (dis)satisfaction is indicated by their delays in the directly affected (i.e., disrupted) trip and utility for their whole trips and activities estimated by a score function. Disruption results in immediate delays for passengers whose planned services fail to run, plus delays for passengers on the line where extra services are planned to run (rerouted). The earlier information on the disposition timetable is disseminated to passengers, the higher their satisfaction during disruption. Compared with full cancellation of train services, computing a precise feasible rolling stock circulation able to handle partial train cancellations can significantly benefit passengers, especially those whose planned services are disrupted, against minor delays incurred by other group of passengers.

10 September 2025 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
PHPeiran Han
Peiran Han
LMLingyun Meng
Lingyun Meng
XLXiaojie Luan
Xiaojie Luan
NBNikola Bešinović
Nikola Bešinović
JMJianrui Miao
Jianrui Miao
ZLZhengwen Liao
Zhengwen Liao

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 June 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
ZLZhengwen Liao
Zhengwen Liao
Out-of-gauge trains are trains with loading freight that exceeds the loading limitation border. Considering collision avoidance, the out-of-gauge trains have speed restriction of their own, and the trains running on the parallel track. Therefore, it is necessary to execute a train rescheduling procedure to rearrange the train paths of the out-of-gauge trains and the affected trains based on the fundamental timetable. For rescheduling the timetable, considering the blockades and the speed restrictions caused by the out-of-gauge trains, this paper proposed a time-space-state network representation for describing the out-of-gauge train rescheduling problem. A novel concept, speed allowance, is introduced to describe the train speed restriction due to the out-of-gauge trains. An integer programming model based on the time-space network is proposed to minimize the total train delay when running the out-of-gauge trains. The model can be solved by the rolling-time horizon approach for reducing computational time. A numerical example is conducted based on the conventional railway in China, demonstrating the solution performance of the model and the practical use of the methodology. Gurobi solver cannot obtain an optimal solution within 1 h when the planning-time horizon is greater than 120 min. With the rolling-time horizon approach, the rescheduled timetable can be obtained within 124 s for the 300 min planning-time horizon using 180 min rolling-time window.

30 August 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
ZLZhengwen Liao
Zhengwen Liao
CMCe Mu
Ce Mu
The operations performance of a railway station depends on the compatibility of its layout and the traffic pattern. It is necessary to determining an adaptable station layout for a railway station in accordance with its complex traffic pattern during the design phase. This paper assesses the railway station layout from a capacity perspective. In particular, this paper addresses an optimization-based capacity estimation approach for the layout variants of a railway station (i.e., the number of siding tracks and the structure of the connections in between) considering the traffic pattern variants. A mixed integer programming model for microscopic timetable compression is applied to calculate the occupation rate of the given traffic pattern with flexible route choices and train orders. A novel “schedule-and-fix” heuristic algorithm is proposed to solve large-scale instances efficiently. In the case study, we evaluate the performance of the schedule-and-fix method compared with the benchmark solvers Gurobi and CP-SAT. Applying the proposed method, we compare the capacity performances of the two station design schemes, i.e., one with a flyover and the other without. The result shows that, for the given instance, building a flyover gains capacity benefits as it reduces the potential conflict in the throat area. However, the level of benefit depends on the combination of trains. It is necessary to build the flyover when the proportion of turn-around trains is more than 70% from the perspective of station capacity.