Improvement of timetable robustness by analysis of drivers' operation based on decision trees

• Published in: Journal of rail transport planning & management Vol. 9; pp. 57 - 65
• Main Authors: Ochiai, Yasufumi, Masuma, Yoshiki, Tomii, Norio
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.05.2019
• Subjects: Data mining; Decision tree; Drivers' operation; Robustness; Drivers' operation; Robustness; Data mining; Decision tree
• ISSN: 2210-9706; 2210-9714
• DOI: 10.1016/j.jrtpm.2019.03.001

In railways where trains are running densely, once there occurs a delay, even if it is small, the delay easily propagates to other trains. In order to make their timetables more robust, railway companies are making various kinds of efforts. But until now, they have not been interested in analysis of drivers’ operation, although there exists much difference in their manner of driving and the difference is closely related with robustness. Thus, it would be useful if we can know what is “good driving”, in other words, a driving which reduces a delay and what is “poor driving” meaning a driving which increases a delay. If we can know the difference between “good” and “poor” driving, we can give advice to drivers so that they can improve their driving. We have developed an algorithm to find the factors which differentiate between “good” and “poor” driving based on the decision tree, which is a commonly used technique in data mining. The inputs of our algorithm are track occupation records. The algorithm receives “good” examples and “poor” examples as input, then it produces a decision tree from which we can know the dominant factors to differentiate between the good examples and the poor examples. We have applied our algorithm to actual data and proved that the algorithm can find a pattern of driving which is common to poor drivers. •We have introduced an algorithm to find the difference of driving between good drivers who succeeded to reduce delays and poor drivers who failed to reduce delays.•The algorithm was developed based on the decision trees which is one of the commonly used technique in datamining.•We have confirmed our algorithm works successfully using actual data.