Year-end Sale % OFF 
Abstract
This paper focuses on optimizing passenger train timetable on an urban transit network with given predetermined long and short routing operation mode. A double objective integer programming model is established in order to reduce the difficulty of solving train timetabling problem of large transit network. A Lagrangian relaxation algorithm was designed to decrease the complexity of solving the problem by transforming the complicated coupling problem into two independent sub-problems of trains and agents respectively. In response to two sub-problems of Lagrangian relaxation, a time-space network was constructed to solve the shortest path problem of passengers and trains by dynamic programming. Finally, the model and algorithm are verified and analyzed by a simple example.
Published Version (
Free)
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 callMore From: DEStech Transactions on Computer Science and Engineering
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.
