Abstract
In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. In this paper, we propose an algorithm for managing traffic considering dynamic problem decompositions. It is an asynchronous algorithm based on the decomposition of the problem considering at each time step the smallest possible portion of the network and subset of trains. We prove that this algorithm guarantees to find an overall feasible solution if it exists, for single track networks with passing loops.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
