Zhengwen Liao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhengwen Liao has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Lingyun Meng
7 shared publications- Jianrui Miao
Beijing Jiaotong University
6 shared publications - Xiaojie Luan
IVT-Institute for Transport Planning and Systems, ETH Zurich, Zurich, Switzerland
4 shared publications - Peiran Han3 shared publications
- Ranfei Zheng3 shared publications
Haiying Li
2 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 298-308
Research on Optimizing Line Plans of a Regional Rail Transit System Considering Transport Capacity Matching
- 2 September 2026
- Published by Springer Nature
- p. 298-308
Research on Optimizing Line Plans of a Regional Rail Transit System Considering Transport Capacity Matching
- Open Access
- 5 March 2026
- Published by Elsevier in SSRN Electronic Journal
Optimizing Railroad Flat Yard Switching with Reward-Driven Integer Programming: A Sequential Decision Framework With Branch-and-Bound and Remember Algorithm
In railroad freight networks, flat yards equipped with relatively simple facilities account for a substantial proportion of all yards and still undertake essential train sorting operations. Despite their limited infrastructure, efficiently optimizing switching operations in flat yards remains a challenging problem due to the strong combinatorial structure and multi-stage decision-making nature of switching processes. This study addresses the Flat Yard Switching Optimization (FYSO) problem by proposing a novel modeling and solution framework. We formulate FYSO using a graph-based representation, termed the Shunting Action Network (SAN), and express it as a 0–1 integer programming model that captures practical operational requirements in flat yards. To improve solvability, we incorporate symmetry-breaking constraints and problem-specific lazy constraints tailored to the structure of SAN. To efficiently obtain high-quality solutions, we first introduce a reward-guided solution strategy that enables rapid identification of good feasible solutions. Computational experiments on benchmark instances from the 2024 INFORMS Railway Applications Section Problem Solving Competition show that this strategy solves all benchmark instances within 10 seconds while maintaining high solution quality. Building on this initial solution, we further develop a sequential branch-and-bound-and-remember search framework that represents the solution space as a search tree and systematically explores it through a sequence of tractable subproblems. A novel progress indicator, termed the deferred link, is developed as an approximation of the cost-to-go to guide tree traversal and differentiate alternative search strategies. To further improve computational efficiency, we incorporate memorization mechanisms together with additional pruning and dominance rules within the branch-and-bound framework. Computational results demonstrate that the sequential tree framework can rapidly improve solution quality by up to 23% and prove optimality for small-scale instances (e.g., 11 railcars). For larger instances involving over 100 railcars, additional exploration of the solution space yields further improvements in solution quality, with gains of up to 21%, while remaining computationally tractable. Overall, this work advances the modeling and optimization of flat yard switching operations, with potential extensions to other yard configurations and operational scenarios.
- 5 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOptimizing Railroad Flat Yard Switching with Reward-Driven Integer Programming: A Sequential Decision Framework With Branch-and-Bound and Remember Algorithm
In railroad freight networks, flat yards equipped with relatively simple facilities account for a substantial proportion of all yards and still undertake essential train sorting operations. Despite their limited infrastructure, efficiently optimizing switching operations in flat yards remains a challenging problem due to the strong combinatorial structure and multi-stage decision-making nature of switching processes. This study addresses the Flat Yard Switching Optimization (FYSO) problem by proposing a novel modeling and solution framework. We formulate FYSO using a graph-based representation, termed the Shunting Action Network (SAN), and express it as a 0–1 integer programming model that captures practical operational requirements in flat yards. To improve solvability, we incorporate symmetry-breaking constraints and problem-specific lazy constraints tailored to the structure of SAN. To efficiently obtain high-quality solutions, we first introduce a reward-guided solution strategy that enables rapid identification of good feasible solutions. Computational experiments on benchmark instances from the 2024 INFORMS Railway Applications Section Problem Solving Competition show that this strategy solves all benchmark instances within 10 seconds while maintaining high solution quality. Building on this initial solution, we further develop a sequential branch-and-bound-and-remember search framework that represents the solution space as a search tree and systematically explores it through a sequence of tractable subproblems. A novel progress indicator, termed the deferred link, is developed as an approximation of the cost-to-go to guide tree traversal and differentiate alternative search strategies. To further improve computational efficiency, we incorporate memorization mechanisms together with additional pruning and dominance rules within the branch-and-bound framework. Computational results demonstrate that the sequential tree framework can rapidly improve solution quality by up to 23% and prove optimality for small-scale instances (e.g., 11 railcars). For larger instances involving over 100 railcars, additional exploration of the solution space yields further improvements in solution quality, with gains of up to 21%, while remaining computationally tractable. Overall, this work advances the modeling and optimization of flat yard switching operations, with potential extensions to other yard configurations and operational scenarios.
- 28 January 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 214
Reinforcement learning for train timetable rescheduling under perturbation: A general value-based approach
- 28 January 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 214
Reinforcement learning for train timetable rescheduling under perturbation: A general value-based approach
- Open Access
- 1 January 2024
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2024 (1)
Estimating the Railway Network Capacity Utilization with Mixed Train Routes and Stopping Patterns: A Multiobjective Optimization Approach
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.
- 1 January 2024
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2024 (1)
Open AccessEstimating the Railway Network Capacity Utilization with Mixed Train Routes and Stopping Patterns: A Multiobjective Optimization Approach
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.
- Open Access
- 30 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (17) , 3727
Assessing the Compatibility of Railway Station Layouts and Mixed Heterogeneous Traffic Patterns by Optimization-Based Capacity Estimation
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.
- 30 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (17) , 3727
Open AccessAssessing the Compatibility of Railway Station Layouts and Mixed Heterogeneous Traffic Patterns by Optimization-Based Capacity Estimation
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.
- Open Access
- 11 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (12) , 2659
Rescheduling Out-of-Gauge Trains with Speed Restrictions and Temporal Blockades on the Opposite-Direction Track
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.
- 11 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (12) , 2659
Open AccessRescheduling Out-of-Gauge Trains with Speed Restrictions and Temporal Blockades on the Opposite-Direction Track
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.