Train delays occur often in daily railway operations due to a variety of initiating incidents. On a heavily loaded mainline railway, a single train delay may lead to a series of secondary delays across the network. In this study, the authors describe a peer-to-peer system to solve train rescheduling problems in railway network bottlenecks. A designed Genetic Algorithm is chosen as the local search algorithm on each side. Based on the local search algorithm, different negotiation protocols are raised to find globally feasible solutions. The proposed approach is tested in a railway bottleneck section in the UK, and the computational result is compared with a centralised method to show its performance in terms of computation time and optimality.
Algorithm and peer-to-peer negotiation strategies for train dispatching problems in railway bottleneck sections
IET Intelligent Transport Systems ; 13 , 11 ; 1717-1725
2019-09-13
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
secondary delays , heavily loaded mainline railway , train rescheduling problems , scheduling , train dispatching problems , railways , daily railway operations , integer programming , railway network bottlenecks , train delays , peer-to-peer system , local search algorithm , initiating incidents , single train delay , designed Genetic Algorithm , peer-to-peer negotiation strategies , delays , railway bottleneck section , genetic algorithms , different negotiation protocols , rail traffic
Metadata by IET is licensed under CC BY 3.0
Wiley | 2019
|Modeling and Solving Real-Time Train Rescheduling Problems in Railway Bottleneck Sections
Online Contents | 2015
|Telephone train dispatching on Oregon electric railway
Engineering Index Backfile | 1914
|Engineering Index Backfile | 1892