Skip to content
naulon
Not checkedNot checked for notices yet.

A new type of sustainable operation method for urban rail transit: Joint optimization of train route planning and timetabling

Guorong Fan, Chao Li, Xinyun Shao and 2 more

Sustainable Futures · 2025

doi:10.1016/j.sftr.2025.101084 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

As key components of the train operation plan, the train route and timetable have significant impacts on the transportation service offered by urban rail transit. To ensure the sustainable development of urban rail transit and address the mismatch between train capacity and passenger demand that arises from the staged preparation of train operation plan, this paper proposes a joint optimization solution for both train route planning and timetabling. Firstly, the set of candidate routes is generated based on the location of the turnaround stations on the line. Secondly, considering the time-varying passenger flow characteristics and the constraints of operation, a mixed integer nonlinear programming model is established for the joint optimization of train route planning and timetabling to minimize the operating cost and enhance passenger service level. A linearization method for the model is proposed. To solve large-scale problems, an improved adaptive large neighborhood search algorithm (ALNS) is designed accordingly. The proposed method's solution efficiency is compared with genetic algorithms (GA) and commercial solvers (CPLEX) through small case studies. Finally, the effectiveness of both the model and algorithm has been validated via a case study of Chongqing Metro Line 3 in China. Results show that the joint optimization model demonstrates more effective adaptability to the passenger flow characteristics while enhancing the quality of train operation plan compared with traditional methods. It further reduces the operating costs of enterprises and enhance the operational sustainability of urban rail transit.

Abstract licence: CC BY-NC-ND

References48

    48 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.