CDR is responsible for automatic real-time train scheduling and routing. Given the current timetable, a set of constraints, the current traffic disturbances, and the position and speed of each train in the area, CDR detects and solves future conflicts and creates a new conflict-free plan by means of an alternative graph, in which each node represents an event and each arc represents a time precedence relationship between two events. The scheduling algorithm minimises a suitable function of exit delays, acting both on train precedence relations at conflict points and on train routings. The new plan generated by CRS1 consists of time-location-speed goal windows and routes. It exploits allowable alternative routes, order changes and speed variations. CRS1 performs a global optimization. The optimization is over the whole voyage from entry to exit of the network of all trains currently running in the network or expected to enter in the next 15 minutes. So all trains, the whole network and a sufficient part of the future are taken into account. This time horizon is adaptable. Also the optimization criterion itself is adaptable.