The scheduling of train services is subject to a number of constraints describing railway infrastructure, required train services and reasonable time-intervals for waiting and transits. Timetable planners at Dutch Railways are nowadays supported by a software tool, called CADANS, which produces a feasible timetable on an hourly basis. In this paper, connection requirements between train series are written in the format of the CADANS model. It turns out that this leads to nontrivial combinatorial scheduling issues.

MILP constraint, cyclic timetable, periodic set, railway scheduling, train series connection
Business Administration and Business Economics; Marketing; Accounting (jel M), Transportation Systems (jel R4), Transportation Systems: Other (jel R49)
Erasmus Research Institute of Management
hdl.handle.net/1765/14
ERIM Report Series Research in Management
Copyright 2000, R.A. Zuidwijk, L.G. Kroon, This report in the ERIM Report Series Research in Management is intended as a means to communicate the results of recent research to academic colleagues and other interested parties. All reports are considered as preliminary and subject to possibly major revisions. This applies equally to opinions expressed, theories developed, and data used. Therefore, comments and suggestions are welcome and should be directed to the authors.
Erasmus Research Institute of Management

Zuidwijk, R.A, & Kroon, L.G. (2000). Integer Constraints for Train Series Connections (No. ERS-2000-05-LIS). ERIM Report Series Research in Management. Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/14