Abstract

Rescheduling disrupted railway traffic is computationally hard even for small problem instances. Disruptions may not be known beforehand and can manifest themselves even when trains are en-route, and they are usually resolved by human experts. Wide geographical distribution, a dynamically changing environment, complex interdependencies between multiple components, operational criticality and uncertainty being characteristic of railway transportation, human resolutions are inconsistent, scale-inefficient and potentially infeasible with deadlocks. We present a multi-agent system (MAS) model for dynamic and real-time rescheduling (DRR) of bi-directional railway traffic on a single track in this paper. A computational framework to dynamically dispatch the disrupted trains in real-time, based on instantaneous system parameters and to reschedule conflicting trains with inherent deadlock avoidance is incorporated in the agents’ model. A learning architecture is implemented as a proof-of concept to resolve disruptions quickly and to enhance autonomy. The model is evaluated against integer optimal solutions generated by a Mixed-Integer Linear Programming (MILP) model using realistic data. Detailed discussions on architecture, implementation using JADE (Java Agent DEvelopment) toolkit, experimental results, performance analysis, evaluation of the model, insights and limitations are reported. The numerical performance measures of the model are total weighted delay of all trains at their destination terminals and computational time for resolution. The distinguishing research contributions in this paper are a MAS architecture for railway rescheduling, dynamic dispatch priority assignment using bidding and a learning procedure that enhances autonomy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.