default search action
Raymond S. K. Kwan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j14]Li Lei
, Raymond S. K. Kwan, Zhiyuan Lin, Pedro J. Copado-Méndez:
Resolution of coupling order and station level constraints in train unit scheduling. Public Transp. 14(1): 27-61 (2022) - [c8]Pedro J. Copado-Méndez, Zhiyuan Lin, Eva Barrena, Raymond S. K. Kwan:
A K-Prototype Clustering Assisted Hybrid Heuristic Approach for Train Unit Scheduling. EDCC Workshops 2022: 114-125 - 2020
- [j13]Zhiyuan Lin
Avoiding unnecessary demerging and remerging of multi-commodity integer flows. Networks 76(2): 206-231 (2020)
2010 – 2019
- 2018
- [j12]Zhiyuan Lin, Raymond S. K. Kwan:
Redundant Coupling/decoupling in Train Unit Scheduling Optimization. Electron. Notes Discret. Math. 64: 45-54 (2018) - 2017
- [j11]Zhiyuan Lin, Eva Barrena
Train unit scheduling guided by historic capacity provisions and passenger count surveys. Public Transp. 9(1-2): 137-154 (2017) - 2016
- [j10]Zhiyuan Lin
Local convex hulls for a special class of integer multicommodity flow problems. Comput. Optim. Appl. 64(3): 881-919 (2016) - 2014
- [j9]Zhiyuan Lin
A two-phase approach for real-world train unit scheduling. Public Transp. 6(1-2): 35-65 (2014) - 2013
- [j8]Zhiyuan Lin
An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling. Electron. Notes Discret. Math. 41: 165-172 (2013) - 2011
- [j7]Raymond S. K. Kwan:
Case studies of successful train crew scheduling optimisation. J. Sched. 14(5): 423-434 (2011)
2000 – 2009
- 2009
- [j6]Ignacio Eduardo Laplagne, Raymond S. K. Kwan, Ann S. K. Kwan:
Critical time windowed train driver relief opportunities. Public Transp. 1(1): 73-85 (2009) - 2007
- [j5]Raymond S. K. Kwan, Ann S. K. Kwan:
Effective search space control for large and/or complex driver scheduling problems. Ann. Oper. Res. 155(1): 417-435 (2007) - 2004
- [j4]Jingpeng Li
A Meta-heuristic with Orthogonal Experiment for the Set Covering Problem. J. Math. Model. Algorithms 3(3): 263-283 (2004) - [c7]Prapa Rattadilok
Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling. PATAT 2004: 51-67 - [c6]Ignacio Eduardo Laplagne, Raymond S. K. Kwan, Ann S. K. Kwan:
A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules Planning. PATAT 2004: 71-85 - [r1]Raymond S. K. Kwan:
Bus and Train Driver Scheduling. Handbook of Scheduling 2004 - 2003
- [j3]Jingpeng Li
A fuzzy genetic algorithm for driver scheduling. Eur. J. Oper. Res. 147(2): 334-344 (2003) - [j2]Anthony Wren, Sarah Fores
A Flexible System for Scheduling Drivers. J. Sched. 6(5): 437-455 (2003) - [c5]Raymond S. K. Kwan, Paavan Mistry:
A co-evolutionary algorithm for train timetabling. IEEE Congress on Evolutionary Computation 2003: 2142-2148 - [c4]Paavan Mistry, Raymond S. K. Kwan:
Generation and Optimization of Train Timetables Using Coevolution. GECCO 2003: 693-694 - 2002
- [c3]Jingpeng Li
A fuzzy evolutionary approach with Taguchi parameter setting for the set covering problem. IEEE Congress on Evolutionary Computation 2002: 1203-1208 - 2001
- [j1]Raymond S. K. Kwan, Ann S. K. Kwan, Anthony Wren:
Evolutionary Driver Scheduling with Relief Chains. Evol. Comput. 9(4): 445-460 (2001) - [c2]Jingpeng Li
A fuzzy simulated evolution algorithm for the driver scheduling problem. CEC 2001: 1115-1122 - 2000
- [c1]Raymond S. K. Kwan, Anthony Wren, Ann S. K. Kwan:
Hybrid genetic algorithms for scheduling bus and train drivers. CEC 2000: 285-292
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: