Zhiyuan Lin

Dr. Zhiyuan Lin

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
15 December 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
NBNikola Bešinović
Nikola Bešinović
LDLorenzo De Donato
Lorenzo De Donato
Francesco FlamminiFrancesco Flammini
Francesco Flammini
RGRob M. P. Goverde
Rob M. P. Goverde
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin
VVValeria Vittorini
Valeria Vittorini
Artificial Intelligence (AI) is becoming pervasive in most engineering domains, and railway transport is no exception. However, due to the plethora of different new terms and meanings associated with them, there is a risk that railway practitioners, as several other categories, will get lost in those ambiguities and fuzzy boundaries, and hence fail to catch the real opportunities and potential of machine learning, artificial vision, and big data analytics, just to name a few of the most promising approaches connected to AI. The scope of this paper is to introduce the basic concepts and possible applications of AI to railway academics and practitioners. To that aim, this paper presents a structured taxonomy to guide researchers and practitioners to understand AI techniques, research fields, disciplines, and applications, both in general terms and in close connection with railway applications such as autonomous driving, maintenance, and traffic management. The important aspects of ethics and explainability of AI in railways are also introduced. The connection between AI concepts and railway subdomains has been supported by relevant research addressing existing and planned applications in order to provide some pointers to promising directions.

12 February 2016 in Computational Optimization and Applications
Verified
Journal Article
Open access
PDF file
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin
RKRaymond S. K. Kwan
Raymond S. K. Kwan
Based on previous work in rolling stock scheduling problems (Alfieri et al. in Transp Sci 40:378–391, 2006; Cacchiani et al. in Math Progr B 124:207–231, 2010; Lin and Kwan in Electron Notes Discret Math 41:165–172, 2013; Schrijver in CWI Q 6:205–217, 1993; Ziarati et al. in Manag Sci 45:1156–1168, 1999), we generalize a local convex hull method for a class of integer multicommodity flow problems, and discuss its feasibility range in high dimensional cases. Suppose a local convex hull can be divided into an up hull, a main hull and a down hull if certain conditions are met, it is shown theoretically that the main hull can only have at most two nonzero facets. The numbers of points in the up and down hull are explored mainly on an empirical basis. The above properties of local convex hulls have led to a slightly modified QuickHull algorithm (the “2-facet QuickHull”) based on the original version proposed by Barber et al. (ACM Trans Math Softw 22:469–483, 1996). As for the feasibility in applying this method to rolling stock scheduling, our empirical experiments show that for the problem instances of ScotRail and Southern Railway, two major train operating companies in the UK, even in the most difficult real-world or artificial conditions (e.g. supposing a train can be served by any of 11 compatible types of self-powered unit), the standard QuickHull (Barber et al. in ACM Trans Math Softw 22:469–483, 1996) can easily compute the relevant convex hulls. For some even more difficult artificial instances that may fall outside the scope of rolling stock scheduling (e.g. a node in a graph can be covered by more than 11 kinds of compatible commodities), there is evidence showing that the “2-facet QuickHull” can be more advantageous over the standard QuickHull for our tested instances. When the number of commodity types is even higher (e.g. >19), or the number of points in a high dimensional space (e.g. 15 dimensions) is not small (e.g. >2000), the local convex hulls cannot be computed either by the standard or the 2-facet QuickHull methods within practical time.

8 September 2016 in Public Transport
Verified
Journal Article
Open access
PDF file
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin
EBEva Barrena
Eva Barrena
RKRaymond S. K. Kwan
Raymond S. K. Kwan
Train unit scheduling concerns the assignment of train unit vehicles to cover all the journeys in a fixed timetable. Coupling and decoupling activities are allowed in order to achieve optimal utilization while satisfying passenger demands. While the scheduling methods usually assume unique and well-defined train capacity requirements, in practice most UK train operators consider different levels of capacity provisions. Those capacity provisions are normally influenced by information such as passenger count surveys, historic provisions and absolute minimums required by the authorities. In this paper, we study the problem of train unit scheduling with bi-level capacity requirements and propose a new integer multicommodity flow model based on previous research. Computational experiments on real-world data show the effectiveness of our proposed methodology.

1 March 2022 in Public Transport
Verified
Journal Article
Open access
PDF file
LLLi Lei
Li Lei
RKRaymond S K Kwan
Raymond S K Kwan
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin
PMPedro Jesús Copado Méndez
Pedro Jesús Copado Méndez
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.

8 November 2017 in ITM Web of Conferences
Verified
Journal Article
Open access
PDF file
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin
RKRaymond Kwan
Raymond Kwan
We present a class of Multicommodity Flow Problems with Commodity Compatibility Relations (MCFP-CCR), in which compatibility relations among commodities used at each node are required. This class of problems has application in the Train Unit Scheduling Problem (TUSP) [1, 2], where train units of different traction types may not be coupled with each other to serve the same train trip. Computational complexity issues are discussed and solution methods are proposed. Computational experiments using the proposed solution methods are reported.

6 March 2025 in Journal of Rail Transport Planning & Management
Verified
Journal Article
Open access
RTRuifan Tang
Ruifan Tang
RLRonghui Liu
Ronghui Liu
Zhiyuan LinZhiyuan Lin
Zhiyuan Lin