A mathematical for periodic scheduling problems
SIAM Journal on Discrete Mathematics
Periodic network optimization with different arc frequencies
Discrete Applied Mathematics
Discrete optimization in public rail transport
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A Survey of Optimization Models for Train Routing and Scheduling
Transportation Science
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Transportation Science
Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
Transportation Science
Domain-dependent distributed models for railway scheduling
Knowledge-Based Systems
Multicommodity network flow approach to the railroad crew-scheduling problem
IBM Journal of Research and Development - Business optimization
Distributed search in railway scheduling problems
Engineering Applications of Artificial Intelligence
Feasible distributed CSP models for scheduling problems
Engineering Applications of Artificial Intelligence
The train driver recovery problem-A set partitioning based model and solution method
Computers and Operations Research
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
Transportation Science
Railway track allocation: models and methods
OR Spectrum
The periodicity and robustness in a single-track train scheduling problem
Applied Soft Computing
A scheduling order-based method to solve timetabling problems
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
New heuristics to solve the “CSOP” railway timetabling problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Solving a periodic single-track train timetabling problem by an efficient hybrid algorithm
Engineering Applications of Artificial Intelligence
Modelling disruptions and resolving conflicts optimally in a railway schedule
Computers and Industrial Engineering
Reoptimizing the rural postman problem
Computers and Operations Research
| Hi-index | 0.01 |
This paper describes the development and implementation of an optimization model used to resolve disruptions to an operating schedule in the rail industry. Alterations to the existing train timetable and crewing roster are made simultaneously in real time--previous treatments in the literature have always decoupled these two problems and solved them in series. An integer programming model is developed that constructs a train timetable and crew roster. This model contains two distinct blocks, with separate variables and constraints for the construction of the train timetable and crew roster, respectively. These blocks are coupled by piece of work sequencing constraints and shift length constraints, which involve variables from both blocks. This unique parallel construction process is then used as the basis of a method to deal with the resolution of train disruptions in realtime. Favourable results are presented for both the combined train/driver scheduling model and the real-time disruption recovery model.