Raymond S. K. Kwan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2022

A K-Prototype Clustering Assisted Hybrid Heuristic Approach for Train Unit SchedulingPedro J. Copado-Méndez, Zhiyuan Lin 0002, Eva Barrena, Raymond S. K. Kwan. edcc 2022: 114-125 [doi]

Resolution of coupling order and station level constraints in train unit schedulingLi Lei, Raymond S. K. Kwan, Zhiyuan Lin 0002, Pedro J. Copado-Méndez. pubtrans, 14(1):27-61, 2022. [doi]

2020

Avoiding unnecessary demerging and remerging of multi-commodity integer flowsZhiyuan Lin 0002, Raymond S. K. Kwan. networks, 76(2):206-231, 2020. [doi]

2018

Redundant Coupling/decoupling in Train Unit Scheduling OptimizationZhiyuan Lin 0002, Raymond S. K. Kwan. endm, 64:45-54, 2018. [doi]

2017

Train unit scheduling guided by historic capacity provisions and passenger count surveysZhiyuan Lin, Eva Barrena, Raymond S. K. Kwan. pubtrans, 9(1-2):137-154, 2017. [doi]

2016

Local convex hulls for a special class of integer multicommodity flow problemsZhiyuan Lin, Raymond S. K. Kwan. coap, 64(3):881-919, 2016. [doi]

2014

A two-phase approach for real-world train unit schedulingZhiyuan Lin, Raymond S. K. Kwan. pubtrans, 6(1-2):35-65, 2014. [doi]

2013

An integer fixed-charge multicommodity flow (FCMF) model for train unit schedulingZhiyuan Lin, Raymond S. K. Kwan. endm, 41:165-172, 2013. [doi]

2011

Case studies of successful train crew scheduling optimisationRaymond S. K. Kwan. scheduling, 14(5):423-434, 2011. [doi]

2009

Critical time windowed train driver relief opportunitiesIgnacio Eduardo Laplagne, Raymond S. K. Kwan, Ann S. K. Kwan. pubtrans, 1(1):73-85, 2009. [doi]

2007

Effective search space control for large and/or complex driver scheduling problemsRaymond S. K. Kwan, Ann S. K. Kwan. anor, 155(1):417-435, 2007. [doi]

2004

A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules PlanningIgnacio Laplagne, Raymond S. K. Kwan, Ann S. K. Kwan. patat 2005: 71-85 [doi]

A Meta-heuristic with Orthogonal Experiment for the Set Covering ProblemJingpeng Li, Raymond S. K. Kwan. jmma, 3(3):263-283, 2004. [doi]

Distributed Choice Function Hyper-heuristics for Timetabling and SchedulingPrapa Rattadilok, Andy Gaw, Raymond S. K. Kwan. patat 2005: 51-67 [doi]

2003

2002

A fuzzy evolutionary approach with Taguchi parameter setting for the set covering problemJingpeng Li, Raymond S. K. Kwan. cec 2002: 1203-1208 [doi]

2001

Evolutionary Driver Scheduling with Relief ChainsRaymond S. K. Kwan, Ann S. K. Kwan, Anthony Wren. ec, 9(4):445-460, 2001.

A fuzzy simulated evolution algorithm for the driver scheduling problemJingpeng Li, Raymond S. K. Kwan. cec 2001: 1115-1122 [doi]

2000

Hybrid genetic algorithms for scheduling bus and train driversRaymond S. K. Kwan, Anthony Wren, Ann S. K. Kwan. cec 2000: 285-292 [doi]

Sign in or sign up to see more results.

runs on WebDSL