Abstract
Trains operating in densely populated metropolitan areas typically encounter complex track configurations. To make optimal use of the available rail capacity, some portions of the rail network may consist of single-track lines whereas other locations may consist of double- or triple-track lines. This paper develops a branch-and-bound procedure that is able to determine the optimal dispatching times for trains traveling in complex rail networks. We demonstrate the efficiency of our branch-and-bound algorithm by comparing it to CPLEX, a commercially available integer program solver, on an actual rail network in Los Angeles County.
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.
