Liu, J orcid.org/0000-0002-3808-5957, Chen, L, Roberts, C et al. (2 more authors) (2019) Algorithm and peer‐to‐peer negotiation strategies for train dispatching problems in railway bottleneck sections. IET Intelligent Transport Systems, 13 (11). pp. 1717-1725. ISSN 1751-956X
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Environment (Leeds) > Institute for Transport Studies (Leeds) > ITS: Spatial Modelling and Dynamics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 30 Mar 2022 11:40 |
Last Modified: | 30 Mar 2022 11:40 |
Status: | Published |
Publisher: | Institution of Engineering and Technology |
Identification Number: | 10.1049/iet-its.2019.0020 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:185157 |