Zhiming Yuan

Zhiming Yuan

Auto-generated profile, based on publicly available information

Zhiming Yuan

Scientific and Technological Information Research Institute, China Academy of Railway Sciences Corporation Limited, Beijing, China

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
6 May 2020 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
Peng LinPeng Lin
Peng Lin
YHYi Huang
Yi Huang
QZQi Zhang
Qi Zhang
ZYZhiming Yuan
Zhiming Yuan
This article investigates the velocity and input constrained tracking control problem of discrete-time high-speed train systems. A distributed cooperative tracking control algorithm is proposed for each train using the local information from its adjacent trains. Based on model transformation and the convex analysis approach, it is shown that all trains eventually cooperative run in a stable mode while tracking the desired speed. Finally, a simulation example is given to demonstrate the obtained theoretical results.

23 March 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ZYZhiming Yuan
Zhiming Yuan
LYLu Yan
Lu Yan
YGYing Gao
Ying Gao
TZTao Zhang
Tao Zhang
SGShigen Gao
Shigen Gao
This article addresses the speed-distance trajectory tracking control problem for railway trains to facilitate the effectuation of automation train operation (ATO). By proposing a new virtual parameter learning-based approach, we develop an adaptive control that exhibits twofold new features with comparison to the existing literatures: i) , while the nonlinear operational resistance and railway line gradient profile are unknown, the proposed control not only bears a quite computationally inexpensive simplicity in structure but also achieves accurate tracking control with respect to the speed-distance trajectory benefiting by the virtual parameter learning approach and requiring no function approximators with linearized structure, for example, common utilization of neural or fuzzy approximations, to cope with the uncertain dynamic nonlinearities in real-time, and ii) , by introducing a nonlinear error transformation, the protection enveloping problem, which is generally introduced by the onboard automatic train protection and wayside subsystems, operating independently from the ATO subsystem in practice, are considered explicitly to the control design for ATO for the first time. By invoking Lyapunov stability theorem, the resulting closed-loop system is guaranteed to be globally stable with rigorously analysis and proof. Meanwhile, in order to verify and validate the effectiveness and advantages of theoretical findings, experimental and comparative results, by applying the designed controller to the whole Beijing railway Yizhuang line, are shown.

18 December 2023 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
RLRuiguang Liu
Ruiguang Liu
DCDongliang Cui
Dongliang Cui
XDXuewu Dai
Xuewu Dai
PYPeng Yue
Peng Yue
ZYZhiming Yuan
Zhiming Yuan
In High-Speed Railway (HSR) networks with hub stations connecting multiple HSR lines, Train Timetable Rescheduling (TTR) under disruptions (such as speed restrictions caused by high wind) has been a challenging problem, which requires collaborative consideration of the traffic and impacts on all lines. Compared to the first principle model of complex railway networks, data-driven modeling provides a better solution to describe how the performance of one HSR line is affected by a train rescheduling decision made for another lines, but it faces the challenges of incompleteness, imbalance and lack of comprehensiveness of history data as disruptions in railways (e.g. delays, accidents) are relatively rare compared to normal operations. This paper proposes a multi-line rescheduling framework consisting of an interactive railway operation simulation and experiment (iROSE) system, a surrogate model and a heuristic algorithm to enable network-wise optimal rescheduling of multiple lines. To compensate for the limits of incomplete history data, a relatively low-cost but accurate enough surrogate model is developed from simulation data of the realistic but computation-intensive iROSE simulator. To reduce the demand for data and the time on running the costly simulator, a multi-surrogate search method is developed. A data expansion-based knowledge transfer method and joint distribution adaptation and tradaboost are also adopted to further improve the accuracy of the surrogate model. Our extensive experiments show that the proposed method can obtain higher precision fine search models with few simulations and solve the problem of TTR under wind-caused speed restrictions in complex railway networks with multiple lines. Note to Practitioners —This paper was motivated by the Train Timetable Rescheduling problem of complex high-speed railway networks of multiple lines connected via hub stations, in which the delays caused by high-wind speed restrictions on one line may easily affect trains on other lines in the network. Thus the impacts of a local-line TTR decision on other parts of the HSR network should be evaluated appropriately in the sense of precision and real-time, to assist the local dispatcher in making a network-wise decision. However, the incomplete and imbalanced historical data may not accurately capture how the system behaves during disruptions. In order to address these challenges, this paper proposes a data-driven rescheduling optimization framework to allow network-wise optimal decision-making. The proposed framework consists of an on-demand iROSE system, a surrogate model representing the operation performance of the whole railway network, and a heuristic method responsible for the traffic rescheduling of partial HSR lines. The realistic iROSE simulator is able to compensate the imbalanced actual history operation data by giving a precise evaluation of the network’s performance. Then a multi-surrogate search method and a knowledge transfer method are developed to avoid the time-consuming caused by expensive simulation. The developed surrogate model is able to capture the insights of delay propagation in a multi-line HSR network and enable the dispatchers to have a quick and comprehensive evaluation of how a TTR rescheduling decision made for one line affects other lines in the network. As a result, a network-wise better decision on train rescheduling can be made.

20 September 2023 in Journal of Advanced Computational Intelligence and Intelligent Informatics
Verified
Journal Article
Open access
SDShuxin Ding
Shuxin Ding
TZTao Zhang
Tao Zhang
RWRongsheng Wang
Rongsheng Wang
YSyanhao sun
yanhao sun
XZXiaozhao Zhou
Xiaozhao Zhou
ZYZhiming Yuan
Zhiming Yuan
In this study, the train platform rescheduling problem (TPRP) at a high-speed railway station is analyzed. The adjustments of the train track assignment and train arrival/departure times under train arrival delays are addressed in the TPRP. The problem is formulated as a mixed-integer nonlinear programming model that minimizes the weighted sum of total train delays and rescheduling costs. An improved genetic algorithm (GA) is proposed, and the individual is represented as a platform track assignment and train departure priority, which is a mixed encoding scheme with integers and permutations. The individual is decoded into a feasible schedule comprising the platform track assignment and arrival/departure times of trains using a rule-based method for conflict resolution in the platform tracks and arrival/departure routes. The proposed GA is compared with state-of-the-art evolutionary algorithms. The experimental results confirm the superiority of the GA, which uses the mixed encoding and rule-based decoding, in terms of constraint handling and solution quality.

4 August 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYukun Wang
Yukun Wang
XDXuewu Dai
Xuewu Dai
DCDongliang Cui
Dongliang Cui
GFGuoqi Feng
Guoqi Feng
ZYZhiming Yuan
Zhiming Yuan
QZQi Zhang
Qi Zhang
In railway transportation systems, train section running times are usually uncertain due to the influence of various complex factors, making rescheduled timetables difficult to use continually, and rescheduling has to be repeated. When acceptable, rescheduled timetables should have a certain degree of robustness against such uncertainty. We use the empirical statistical distribution of the deviation between actual and scheduled train arrival times to capture this uncertainty. To equip timetables with acceptable robustness, a chance-constrained programming model is established for the robust rescheduling problem. We design a two-stage hybrid heuristic algorithm to solve the proposed model. In the first stage, a hybrid intelligent algorithm combining ant colony optimization and Monte Carlo simulations is used to solve the model initially, and bisection method is embedded into it to improve solving efficiency. Then, the chance-constrained programming model is transformed into its deterministic equivalent form to generate a better solution by utilizing the solution result of the hybrid intelligent algorithm. Finally, we test our method on the realistic dataset of Elizabeth Line to verify its effectiveness and robustness. Compared to the deterministic rescheduling method, our algorithm, with a confidence level of 0.6-0.7, reduces the number of rescheduling times by 22.2%-100% while only increasing delays by 0.5%-3.7%. The experimental results demonstrate that we propose an effective and adjustable method to enhance the robustness of timetables, allowing operators to formulate an ideal timetable with acceptable robustness while minimizing adverse effects on punctuality.

9 May 2024 in Railway Sciences
Verified
Journal Article
Open access
PDF file
YSyanhao sun
yanhao sun
TZTao Zhang
Tao Zhang
SDShuxin Ding
Shuxin Ding
ZYZhiming Yuan
Zhiming Yuan
SYShengliang Yang
Shengliang Yang
Purpose: In order to solve the problem of inaccurate calculation of index weights, subjectivity and uncertainty of index assessment in the risk assessment process, this study aims to propose a scientific and reasonable centralized traffic control (CTC) system risk assessment method.Design/methodology/approach: First, system-theoretic process analysis (STPA) is used to conduct risk analysis on the CTC system and constructs risk assessment indexes based on this analysis. Then, to enhance the accuracy of weight calculation, the fuzzy analytical hierarchy process (FAHP), fuzzy decision-making trial and evaluation laboratory (FDEMATEL) and entropy weight method are employed to calculate the subjective weight, relative weight and objective weight of each index. These three types of weights are combined using game theory to obtain the combined weight for each index. To reduce subjectivity and uncertainty in the assessment process, the backward cloud generator method is utilized to obtain the numerical character (NC) of the cloud model for each index. The NCs of the indexes are then weighted to derive the comprehensive cloud for risk assessment of the CTC system. This cloud model is used to obtain the CTC system's comprehensive risk assessment. The model's similarity measurement method gauges the likeness between the comprehensive risk assessment cloud and the risk standard cloud. Finally, this process yields the risk assessment results for the CTC system.Findings: The cloud model can handle the subjectivity and fuzziness in the risk assessment process well. The cloud model-based risk assessment method was applied to the CTC system risk assessment of a railway group and achieved good results.Originality/value: This study provides a cloud model-based method for risk assessment of CTC systems, which accurately calculates the weight of risk indexes and uses cloud models to reduce uncertainty and subjectivity in the assessment, achieving effective risk assessment of CTC systems. It can provide a reference and theoretical basis for risk management of the CTC system.