Algorithm and peer‐to‐peer negotiation strategies for train dispatching problems in railway bottleneck sections. Issue 11 (13th September 2019)

• Record Type: Journal Article
• Authors: Liu, Jin; Chen, Lei; Roberts, Clive; Nicholson, Gemma; Ai, Bo
• Is Part Of: IET intelligent transport systems. Volume 13:Issue 11(2019)
• Page Start: 1717
• Page End: 1725
• Publication Date: 2019-09-13
• Subjects: railways -- genetic algorithms -- rail traffic -- delays -- integer programming -- scheduling; train rescheduling problems -- railway network bottlenecks -- designed Genetic Algorithm -- local search algorithm -- different negotiation protocols -- railway bottleneck section -- peer‐to‐peer negotiation strategies -- train dispatching problems -- train delays -- daily railway operations -- initiating incidents -- heavily loaded mainline railway -- single train delay -- secondary delays -- peer‐to‐peer system; Intelligent transportation systems -- Periodicals; Electronics in transportation -- Periodicals; 388.31205
• DOI: 10.1049/iet-its.2019.0020
• Languages: English
• ISSNs: 1751-956X

Abstract

Abstract : 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.