Raymond S. K. Kwan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Raymond S. K. Kwan has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Zhiyuan Lin
Institute for Transport Studies, University of Leeds, Leeds, UK
5 shared publications - Eva Barrena
Univ Pablo de Olavide, Dept Econ Quantitat Methods & Econ Hist, ES-41013 Seville, Spain
2 shared publications - Pedro Jesus Copado Mendez
Universitat Politècnica de Catalunya (UPC Barcelona Tech)
2 shared publications Ann Kwan
TRACSiS Limited
1 shared publication- Li Lei
School of Computing, University of Leeds, Leeds, UK
1 shared publication - Stefan Voß
Institute of Information Systems, University of Hamburg, 20146 Hamburg, Germany
1 shared publication
Latest Publications
- 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.
- Open Access
- 8 November 2017
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 14, 00003
Multicommodity Flow Problems with Commodity Compatibility Relations
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.
- 8 November 2017
- Published by EDP Sciences in ITM Web of Conferences
- Vol. 14, 00003
Open AccessMulticommodity Flow Problems with Commodity Compatibility Relations
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.
- Open Access
- 8 September 2016
- Published by Springer Nature in Public Transport
- Vol. 9 (1-2) , 137-154
Train unit scheduling guided by historic capacity provisions and passenger count surveys
- 8 September 2016
- Published by Springer Nature in Public Transport
- Vol. 9 (1-2) , 137-154
Open AccessTrain unit scheduling guided by historic capacity provisions and passenger count surveys
- Open Access
- 12 February 2016
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 64 (3) , 881-919
Local convex hulls for a special class of integer multicommodity flow problems
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.
- 12 February 2016
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 64 (3) , 881-919
Open AccessLocal convex hulls for a special class of integer multicommodity flow problems
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.
- 6 September 2013
- Published by Springer Nature in Public Transport
- Vol. 6 (1-2) , 35-65
A two-phase approach for real-world train unit scheduling
- 6 September 2013
- Published by Springer Nature in Public Transport
- Vol. 6 (1-2) , 35-65
A two-phase approach for real-world train unit scheduling
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 165-172
An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 165-172
An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling
- 10 December 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 14 (5) , 423-434
Case studies of successful train crew scheduling optimisation
- 10 December 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 14 (5) , 423-434
Case studies of successful train crew scheduling optimisation
- 31 March 2009
- Published by Springer Nature in Public Transport
- Vol. 1 (1) , 1-3
Editorial
- 10 July 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 155 (1) , 417-435
Effective search space control for large and/or complex driver scheduling problems
- 10 July 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 155 (1) , 417-435
Effective search space control for large and/or complex driver scheduling problems