Jianrui Miao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jianrui Miao has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Lingyun Meng
Beijing Jiaotong University
8 shared publications Lingyun Meng
7 shared publications- Zhengwen Liao
Beijing Jiaotong University
6 shared publications - Xiaojie Luan
IVT-Institute for Transport Planning and Systems, ETH Zurich, Zurich, Switzerland
4 shared publications - Xiaojie Luan
Beijing Jiaotong University
3 shared publications Andrea D’ARiano
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
- 2 September 2026
- Published by Springer Nature
- p. 87-94
Research on Railway Bottleneck Identification Method Based on Correlation Analysis of Train Delay Data
- 2 September 2026
- Published by Springer Nature
- p. 87-94
Research on Railway Bottleneck Identification Method Based on Correlation Analysis of Train Delay Data
- 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.
- 19 April 2025
- Published by Springer Nature
- p. 1-11
Methods for State Sensing and Early Warning of Operating Conditions
- 19 April 2025
- Published by Springer Nature
- p. 1-11
Methods for State Sensing and Early Warning of Operating Conditions
- 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
- 18 August 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-16
An Optimization Method of High-Speed Railway Rescheduling to Meet Unexpected Large Passenger Flow
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.
- 18 August 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-16
Open AccessAn Optimization Method of High-Speed Railway Rescheduling to Meet Unexpected Large Passenger Flow
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.