Abstract

In many cities and regions, decision makers independently develop Train Operation Plan (TOP) for each line in the rail transit network, resulting in a lack of TOP Synchronization (TOPS). Considering the entire network as a whole, researchers have realized that synchronous optimization is of great significance. In this paper, we formulate two Mixed-Integer Linear Programming (MILP) models to optimize demand-driven TOP in the network. The former is an Asynchronous TOP Optimization (ATOPO) model, while the latter is a Synchronous TOP Optimization (STOPO) model. The bi-objective models simultaneously determine train frequency, train timetable, and rolling stock circulation under small-granularity passenger demand to minimize trains’ total cost and passengers’ total time. Then, we propose the Nondominated Sorting Coevolutionary Memetic Algorithm (NSCMA) to solve the combinatorial optimization problems. The hybrid heuristic algorithm incorporates Coevolutionary Memetic Algorithm (CMA) into Advanced and Adaptive Nondominated Sorting Genetic Algorithm II (AANSGA-II) to ameliorate the evolution process for elite individuals. On this basis, we study the case of Shenyang Metro to verify the models and the algorithm. The results demonstrate that the STOPO model is better than the ATOPO model in reducing trains’ total cost and passengers’ total time. In addition, NSCMA is better than AANSGA-II in obtaining elite individuals.

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.