Abstract

Focusing on reducing the traffic congestion on an oversaturated urban metro system, this study investigates the collaborative passenger flow control problem for a metro line. By introducing the timetable-oriented space-time network representation, the problem of interest is finally formulated as an integer programming model, in which the objective function aims to minimize the total weighted passenger waiting time at different stations. Since the final decision is closely related to the space-time path-finding process, the proposed model can also be regarded as a coordinated path-finding process with train loading capacity constraints. Then, an efficient heuristic algorithm is developed to solve the proposed model. Finally, a series of numerical examples are implemented on a sample metro line and the Beijing Batong metro line. The computational results show that the proposed approach can produce high-quality passenger flow control strategies for the metro system, thereby demonstrating the effectiveness of the proposed model and algorithm.

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.