Resolution of coupling order and station level constraints in train unit scheduling
Open Access
- 1 March 2022
- journal article
- research article
- Published by Springer Nature in Public Transport
- Vol. 14 (1) , 27-61
Abstract
Train unit scheduling assigns vehicles to cover all trips of a fixed timetable satisfying constraints such as seat demands. With a two-phase approach, this problem is first solved in Phase I as an integer multi-commodity flow problem. Train stations are simplified as single points and coupling orders of train units are left undetermined. In this paper, platforms and their layouts at the stations are restored to complete a fully operable schedule, defined as Phase II. An adaptive approach expanding Phase I to Phase II is proposed. The logistics of (de-)coupling operations, coupling orders and re-platforming are determined in detail to prevent unit blockage where possible, particularly focusing on developing a schedule with conflict-free coupling orders. If unresolvable station level conflicts still exist, the process loops back to Phase I with addressed Phase II constraints to avoid identified conflicts. Thus, the schedule is iteratively improved until it is fully operable.Keywords
This publication has 15 references indexed in Scilit:
- Local convex hulls for a special class of integer multicommodity flow problemsComputational Optimization and Applications, 2016
- A two-phase approach for real-world train unit schedulingPublic Transport, 2013
- A Lagrangian heuristic for a train-unit assignment problemDiscrete Applied Mathematics, 2013
- On integer polytopes with few nonzero verticesOperations Research Letters, 2013
- Solving a real-world train-unit assignment problemMathematical Programming, 2010
- Shunting of Passenger Train Units: An Integrated ApproachTransportation Science, 2008
- Operations Research in passenger railway transportationStatistica Neerlandica, 2005
- Shunting of Passenger Train Units in a Railway StationTransportation Science, 2005
- An Algorithm for Station Shunting Scheduling Problems Combining Probabilistic Local Search and PERTLecture Notes in Computer Science, 1999
- Canonical Cuts on the Unit HypercubeSIAM Journal on Applied Mathematics, 1972