Abstract
A two-phase approach for the train unit scheduling problem is proposed. The first phase assigns and sequences train trips to train units temporarily ignoring some station infrastructure details. Real-world scenarios such as compatibility among traction types and banned/restricted locations and time allowances for coupling/decoupling are considered. Its solutions would be near-operable. The second phase focuses on satisfying the remaining station detail requirements, such that the solutions would be fully operable.
The first phase is modeled as an integer fixed-charge multicommodity flow (FCMF) problem. A branch-and-price approach is proposed to solve it. Experiments have shown that it is only capable of handling problem instances within about 500 train trips. The train company collaborating in this research operates over 2400 train trips on a typical weekday. Hence, a heuristic has been designed for compacting the problem instance to a much smaller size before the branch-and-price solver is applied. The process is iterative with evolving compaction based on the results from the previous iteration, thereby converging to near-optimal results.
The second phase is modeled as a multidimensional matching problem with a mixed integer linear programming (MILP) formulation. A column-and-dependent-row generation method for it is under development.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alfieri A, Groot R, Kroon LG, Schrijver A (2006) Efficient circulation of railway rolling stock. Transp Sci 40(3):378–391
Alvelos F (2005) Branch-and-price and multicommodity flows. PhD thesis, Escola de Engenharia, Universidade do Minho, Portugal
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316–329
Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper Res 48(2):318–326
Cacchiani V, Caprara A, Toth P (2010) Solving a real-world train-unit assignment problem. Math Program 124(1–2):207–231
Ciriani TA, Colombani Y, Heipcke S (2003) Embedding optimisation algorithms with Mosel. 4OR 1(2):155–167
Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial optimization. Wiley, New York
Fioole PJ, Kroon L, Maróti G, Schrijver A (2006) A rolling stock circulation model for combining and splitting of passenger trains. Eur J Oper Res 174(2):1281–1297
Fores S (1996) Column generation approaches to bus driver scheduling. PhD thesis, University of Leeds, UK
Fores S, Proll L, Wren A (2002) TRACS II: a hybrid IP/heuristic driver scheduling system for public transport. J Oper Res Soc 53(10):1093–1100
Freling R, Lentink RM, Kroon LG, Huisman D (2005) Shunting of passenger train units in a railway station. Transp Sci 39(2):261–272
Geoffrion A (1974) Lagrangean relaxation for integer programming. Math Program Stud 2:82–114
Hennig F, Nygreen B, Christiansen M, Fagerholt K, Furman KC, Song J, Kocis GR, Warrick PH (2012) Maritime crude oil transportation—a split pickup and split delivery problem. Eur J Oper Res 218:764–774
Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, New York, pp 33–65
Kroon LG, Lentink RM, Schrijver A (2008) Shunting of passenger train units: an integrated approach. Transp Sci 42(4):436–449
Kwan RSK (2004) Bus and train driver scheduling In: Leung JY (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton. Chap 51, pp 51(1)–51(19)
Kwan RSK, Kwan A (2007) Effective search space control for large and/or complex driver scheduling problems. Ann Oper Res 155(1):417–435
Maróti G (2006) Operations research models for railway rolling stock planning. PhD thesis, Eindhoven University of Technology, the Netherlands
Maróti G, Kroon LG (2005) Maintenance routing for train units: the transition model. Transp Sci 39(4):518–525
Muter I, Birbil SI, Bulbul K (2012) Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Mathematical Programming. Available online at doi:10.1007/s10107-012-0561-8
Peeters M, Kroon LG (2008) Circulation of railway rolling stock: a branch-and-price approach. Comput OR 35(2):538–556
Savelsbergh MWP (1997) A branch-and-price algorithm for the generalized assignment problem. Oper Res 45:831–841
Schrijver A (1993) Minimum circulation of railway stock. Quart - Cent Wiskd Inform 6:205–217
Tracsis Plc (2013) Tracs-RS—rolling stock planning software. http://www.tracsis.com/software/tracs-rs
Villeneuve D, Desrosiers J, Lübbecke ME, Soumis F (2005) On compact formulations for integer programs solved by column generation. Ann Oper Res 139(1):375–388
Wren A, Fores S, Kwan A, Kwan R, Parker M, Proll L (2003) A flexible system for scheduling drivers. J Sched 6:437–455
Ziarati K, Soumis F, Desrosiers J, Solomon MM (1999) A branch-first, cut-second approach for locomotive assignment. Manag Sci 45:1156–1168
Acknowledgements
This research is sponsored by a Dorothy Hodgkin Scholarship funded by the Engineering and Physical Sciences Research Council (EPSRC) and Tracsis Plc. We would also like to thank Southern Railway for their kind and helpful collaboration.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, Z., Kwan, R.S.K. A two-phase approach for real-world train unit scheduling. Public Transp 6, 35–65 (2014). https://doi.org/10.1007/s12469-013-0073-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12469-013-0073-9
Keywords
- Train unit scheduling
- Railway shunting
- Fixed-charge multicommodity flow
- Branch-and-price
- Hybridization method