Scheduling Additional Train Unit Services on Rail Transit Lines

Jiang, Zhibin; Tan, Yuyan; Yalçınkaya, Özgür

doi:10.1155/2014/954356

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In , the problem of train unit scheduling with bi-level capacity requirements is studied and an integer multicommodity flow model is proposed based on previous research. Jiang et al (2014) propose a model for scheduling additional train unit services in a double parallel rail transit line such that timetable scheduling and train unit scheduling are integrated into the model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. Computational experiments on real rail transit line 16 in Shanghai were tested yielding a reasonable new timetable.…”

Section: The Train Unit Assignment Problem and Train Unit Scheduling mentioning

confidence: 99%

A branch-and-price approach for solving the train unit scheduling problem

Lin

Kwan

2016

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

We propose a branch-and-price approach for solving the integer multicommodity flow model for the network-level train unit scheduling problem (TUSP). Given a train operator's fixed timetable and a fleet of train units of different types, the TUSP aims at determining an assignment plan such that each train trip in the timetable is appropriately covered by a single or coupled train units. The TUSP is challenging due to its complex nature. Our branch-and-price approach includes a branching system with multiple branching rules for satisfying real-world requirements that are difficult to realize by linear constraints, such as unit type coupling compatibility relations and locations banned for coupling/decoupling. The approach also benefits from an adaptive node selection method, a column inheritance strategy and a feature of estimated upper bounds with node reservation functions. The branch-and-price solver designed for TUSP is capable of handling instances of up to about 500 train trips. Computational experiments were conducted based on real-world problem instances from First ScotRail. The results are satisfied by rail practitioners and are generally competitive or better than the manual ones.

show abstract

Section: The Train Unit Assignment Problem and Train Unit Scheduling mentioning

confidence: 99%

A branch-and-price approach for solving the train unit scheduling problem

Lin

Kwan

2016

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

Train unit scheduling guided by historic capacity provisions and passenger count surveys

2016

View full text Add to dashboard Cite

Train unit scheduling concerns the assignment of train unit vehicles to cover all the journeys in a fixed timetable. Coupling and decoupling activities are allowed in order to achieve optimal utilization while satisfying passenger demands. While the scheduling methods usually assume unique and well-defined train capacity requirements, in practice most UK train operators consider different levels of capacity provisions. Those capacity provisions are normally influenced by information such as passenger count surveys, historic provisions and absolute minimums required by the authorities. In this paper, we study the problem of train unit scheduling with bi-level capacity requirements and propose a new integer multicommodity flow model based on previous research. Computational experiments on real-world data show the effectiveness of our proposed methodology.

show abstract