Zhiyuan Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhiyuan Lin has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Raymond S. K. Kwan
University of Leeds
5 shared publications - Ronghui Liu
Institute for Transport Studies, University of Leeds, Leeds, U.K.
3 shared publications - Eva Barrena
Univ Pablo de Olavide, Dept Econ Quantitat Methods & Econ Hist, ES-41013 Seville, Spain
2 shared publications Li Lei
School of Computing, University of Leeds, Leeds, UK
2 shared publications- Pedro Jesus Copado Mendez
Universitat Politècnica de Catalunya (UPC Barcelona Tech)
2 shared publications Ronghui Liu
2 shared publications
Latest Publications
- Open Access
- 19 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 319
Scheduling extra trains to an existing timetable along a railway corridor: An ADMM-based optimisation approach
- 19 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 319
Open AccessScheduling extra trains to an existing timetable along a railway corridor: An ADMM-based optimisation approach
- Open Access
- 26 February 2026
- Published by Elsevier in Journal of Transport Geography
- Vol. 132
Spatial exploration and evaluation of rail and long-distance bus network integration with a multimodal node-place model
- 26 February 2026
- Published by Elsevier in Journal of Transport Geography
- Vol. 132
Open AccessSpatial exploration and evaluation of rail and long-distance bus network integration with a multimodal node-place model
- Open Access
- 14 August 2025
- Published by Springer Nature in Operations Research Forum
- Vol. 6 (3) , 1-42
An Auxiliary Hybrid Heuristic Approach for Objective Function Design Evaluation—Using Train Unit Scheduling as an Example
Real-world combinatorial optimization problems are mostly NP-hard, and often only near-optimal solutions can be obtained practically. To differentiate as fine-grained as possible the near-optimal solutions is therefore desirable. Moreover, a real-world problem may have numerous possible structural properties of concern to the practitioners, too numerous to be all elicited and incorporated as optimization criteria in an objective function. In contrast with pure heuristics, we consider hybrid (meta-)heuristics that utilize an exact solver iteratively to solve a series of significantly reduced problem instances converging to near-optimal solutions within practical time. To avoid the hybrid heuristic being stranded in a “poorly differentiated” solution space, an effective objective function design plays an important role. We propose a methodology to benchmark the effectiveness of alternative objective function designs. The main metric used is the structural similarity between the solutions obtained by the hybrid heuristic and by the exact solver. Several other solution features are also distilled and aggregated in the benchmark. This methodology is explained and demonstrated on a train unit scheduling problem tested with four alternative objective functions. The results show that two of them are significantly more effective than the others in differentiating solutions of different qualities and speeding up the solution process. Moreover, some criteria not modeled explicitly could also be satisfied implicitly in the effective objective designs.
- 14 August 2025
- Published by Springer Nature in Operations Research Forum
- Vol. 6 (3) , 1-42
Open AccessAn Auxiliary Hybrid Heuristic Approach for Objective Function Design Evaluation—Using Train Unit Scheduling as an Example
Real-world combinatorial optimization problems are mostly NP-hard, and often only near-optimal solutions can be obtained practically. To differentiate as fine-grained as possible the near-optimal solutions is therefore desirable. Moreover, a real-world problem may have numerous possible structural properties of concern to the practitioners, too numerous to be all elicited and incorporated as optimization criteria in an objective function. In contrast with pure heuristics, we consider hybrid (meta-)heuristics that utilize an exact solver iteratively to solve a series of significantly reduced problem instances converging to near-optimal solutions within practical time. To avoid the hybrid heuristic being stranded in a “poorly differentiated” solution space, an effective objective function design plays an important role. We propose a methodology to benchmark the effectiveness of alternative objective function designs. The main metric used is the structural similarity between the solutions obtained by the hybrid heuristic and by the exact solver. Several other solution features are also distilled and aggregated in the benchmark. This methodology is explained and demonstrated on a train unit scheduling problem tested with four alternative objective functions. The results show that two of them are significantly more effective than the others in differentiating solutions of different qualities and speeding up the solution process. Moreover, some criteria not modeled explicitly could also be satisfied implicitly in the effective objective designs.
- Open Access
Train Unit Scheduling Optimization Considering Unit Ordering
The train unit scheduling problem (TUSP) is an important part of the scheduling process for passenger railway operators. Currently, scholars in various countries have proposed a variety of optimization models based on specific local railway situations and scheduling needs. This research investigates the train unit scheduling problem in the UK. We propose an Enhanced Train Unit Scheduling Problem with Unit Ordering based on existing integer multicommodity flow models. We innovatively introduce unit ordering variables representing the order in which train units are coupled for serving the same trip as well as train direction parameters so that our model can provide unit order information and avoid unit blockage in stations. We present experimental results based on three different sizes of artificial data, as well as real-world data based on the Trans Pennine Express' Anglo-Scottish route. The experimental results showed that our model is able to provide the ordering information corresponding to each train unit and prevents the blockage in the station.
Open AccessTrain Unit Scheduling Optimization Considering Unit Ordering
The train unit scheduling problem (TUSP) is an important part of the scheduling process for passenger railway operators. Currently, scholars in various countries have proposed a variety of optimization models based on specific local railway situations and scheduling needs. This research investigates the train unit scheduling problem in the UK. We propose an Enhanced Train Unit Scheduling Problem with Unit Ordering based on existing integer multicommodity flow models. We innovatively introduce unit ordering variables representing the order in which train units are coupled for serving the same trip as well as train direction parameters so that our model can provide unit order information and avoid unit blockage in stations. We present experimental results based on three different sizes of artificial data, as well as real-world data based on the Trans Pennine Express' Anglo-Scottish route. The experimental results showed that our model is able to provide the ordering information corresponding to each train unit and prevents the blockage in the station.
- Open Access
- 5 April 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1467
Applying Collaborative Co-Simulation to Railway Traction Energy Consumption
Simulation is a vital tool for understanding rail traction energy consumption. Simulating such energy consumption requires an understanding of the interactions between timetable, infrastructure, and driver behavior to be encapsulated within a multi-train system model. This is critical to simulating systemic interactions that affect energy consumption on a rail network. However, building and executing such a system simulation is challenging because of diverse models, stakeholders, and knowledge, as well as a lack of tools to support flexible and scalable simulation. This paper presents a demonstration of co-simulation—an approach originating in the automotive industry and now being used in other sectors—that enables a system model to be assessed for different configurations of timetable, rolling stock, infrastructure, and driver behavior. This paper describes the co-simulation approach before outlining the development process that allowed three research institutes, each with diverse models, to collaborate and deliver an integrated, holistic modeling approach. The results of this work are presented and discussed, both in terms of the quantified outputs and findings for energy consumption, and the lessons learned through collaborative co-simulation. Future avenues to build on this work are identified.
- 5 April 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1467
Open AccessApplying Collaborative Co-Simulation to Railway Traction Energy Consumption
Simulation is a vital tool for understanding rail traction energy consumption. Simulating such energy consumption requires an understanding of the interactions between timetable, infrastructure, and driver behavior to be encapsulated within a multi-train system model. This is critical to simulating systemic interactions that affect energy consumption on a rail network. However, building and executing such a system simulation is challenging because of diverse models, stakeholders, and knowledge, as well as a lack of tools to support flexible and scalable simulation. This paper presents a demonstration of co-simulation—an approach originating in the automotive industry and now being used in other sectors—that enables a system model to be assessed for different configurations of timetable, rolling stock, infrastructure, and driver behavior. This paper describes the co-simulation approach before outlining the development process that allowed three research institutes, each with diverse models, to collaborate and deliver an integrated, holistic modeling approach. The results of this work are presented and discussed, both in terms of the quantified outputs and findings for energy consumption, and the lessons learned through collaborative co-simulation. Future avenues to build on this work are identified.
- Open Access
- 6 March 2025
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 34
Predicting primary delay of train services using graph-embedding based machine learning
- 6 March 2025
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 34
Open AccessPredicting primary delay of train services using graph-embedding based machine learning
- Open Access
- 19 April 2023
- Published by Springer Nature in Research Square
An auxiliary hybrid heuristic approach for objective function design evaluation
Real-world combinatorial optimization problems are mostly NP-hard, and often only near-optimal solutions can be obtained practically. To differentiate as fine-grained as possible the near-optimal solutions is therefore desirable. Moreover, a real-world problem may have numerous possible structural properties of concern to the practitioners, too numerous to be all elicited and incorporated as optimization criteria in an objective function. In contrast with pure heuristics, we consider hybrid (meta-)heuristics that utilise an exact solver iteratively to solve a series of significantly reduced problem instances converging to near-optimal solutions within practical time. To avoid the hybrid heuristic being stranded in a “poorly differentiated” solution space, an effective objective function design plays an important role. We propose a methodology to benchmark the effectiveness of alternative objective function designs. The main metric used is the structural similarity between the solutions obtained by the hybrid heuristic and by the exact solver. Several other solution features are also distilled and aggregated in the benchmark. This methodology is explained and demonstrated on a train unit scheduling problem tested with four alternative objective functions. The results show that two of them are significantly more effective than the others in differentiating solutions of different qualities and speeding up the solution process. Moreover, some criteria not modeled explicitly could also be satisfied implicitly in the effective objective designs.
- 19 April 2023
- Published by Springer Nature in Research Square
Open AccessAn auxiliary hybrid heuristic approach for objective function design evaluation
Real-world combinatorial optimization problems are mostly NP-hard, and often only near-optimal solutions can be obtained practically. To differentiate as fine-grained as possible the near-optimal solutions is therefore desirable. Moreover, a real-world problem may have numerous possible structural properties of concern to the practitioners, too numerous to be all elicited and incorporated as optimization criteria in an objective function. In contrast with pure heuristics, we consider hybrid (meta-)heuristics that utilise an exact solver iteratively to solve a series of significantly reduced problem instances converging to near-optimal solutions within practical time. To avoid the hybrid heuristic being stranded in a “poorly differentiated” solution space, an effective objective function design plays an important role. We propose a methodology to benchmark the effectiveness of alternative objective function designs. The main metric used is the structural similarity between the solutions obtained by the hybrid heuristic and by the exact solver. Several other solution features are also distilled and aggregated in the benchmark. This methodology is explained and demonstrated on a train unit scheduling problem tested with four alternative objective functions. The results show that two of them are significantly more effective than the others in differentiating solutions of different qualities and speeding up the solution process. Moreover, some criteria not modeled explicitly could also be satisfied implicitly in the effective objective designs.
- 5 September 2022
- Published by Springer Nature
- p. 114-125
A K-Prototype Clustering Assisted Hybrid Heuristic Approach for Train Unit Scheduling
- 5 September 2022
- Published by Springer Nature
- p. 114-125
A K-Prototype Clustering Assisted Hybrid Heuristic Approach for Train Unit Scheduling
- Open Access
- 1 March 2022
- Published by Springer Nature in Public Transport
- Vol. 14 (1) , 27-61
Resolution of coupling order and station level constraints in train unit scheduling
Train unit scheduling assigns vehicles to cover all trips of a fixed timetable satisfying constraints such as seat demands. With a two-phase approach, this problem is first solved in Phase I as an integer multi-commodity flow problem. Train stations are simplified as single points and coupling orders of train units are left undetermined. In this paper, platforms and their layouts at the stations are restored to complete a fully operable schedule, defined as Phase II. An adaptive approach expanding Phase I to Phase II is proposed. The logistics of (de-)coupling operations, coupling orders and re-platforming are determined in detail to prevent unit blockage where possible, particularly focusing on developing a schedule with conflict-free coupling orders. If unresolvable station level conflicts still exist, the process loops back to Phase I with addressed Phase II constraints to avoid identified conflicts. Thus, the schedule is iteratively improved until it is fully operable.
- 1 March 2022
- Published by Springer Nature in Public Transport
- Vol. 14 (1) , 27-61
Open AccessResolution of coupling order and station level constraints in train unit scheduling
Train unit scheduling assigns vehicles to cover all trips of a fixed timetable satisfying constraints such as seat demands. With a two-phase approach, this problem is first solved in Phase I as an integer multi-commodity flow problem. Train stations are simplified as single points and coupling orders of train units are left undetermined. In this paper, platforms and their layouts at the stations are restored to complete a fully operable schedule, defined as Phase II. An adaptive approach expanding Phase I to Phase II is proposed. The logistics of (de-)coupling operations, coupling orders and re-platforming are determined in detail to prevent unit blockage where possible, particularly focusing on developing a schedule with conflict-free coupling orders. If unresolvable station level conflicts still exist, the process loops back to Phase I with addressed Phase II constraints to avoid identified conflicts. Thus, the schedule is iteratively improved until it is fully operable.