ABSTRACT
This paper describes research in modelling train timetable and route generation as a constraint-satisfaction problem (CSP). The key objective of this research is to design a constraint-based scheduling algorithm that can be used to generate a train timetable given headway requirements at different times of the day. The key constraint is to avoid track circuit or route contentions while maximising train utilisation. The objective of the scheduling algorithm is to determine how service levels can be increased without jeopardising passenger safety. This research investigated traffic at a train terminus where two types of trains are competing for the use of the same tracks; trains that are reversing and trains that are being dispatched from the depot. The contention problem is particularly serious during the rush hour train build-up. The current timetable and train routing are generated using two separate rule-based systems. However, due to the complexity of constraints involved, the current systems cannot generate a plan that can meet the desired service levels.
