@article{BreugemSchlechteSchulzetal., author = {Breugem, Thomas and Schlechte, Thomas and Schulz, Christof and Bornd{\"o}rfer, Ralf}, title = {A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem}, series = {Computers \& Operations Research}, volume = {154}, journal = {Computers \& Operations Research}, doi = {https://doi.org/10.1016/j.cor.2023.106186}, abstract = {The Fairness-Oriented Crew Rostering Problem (FCRP) considers the joint optimization of attractiveness and fairness in cyclic crew rostering. Like many problems in scheduling and logistics, the combinatorial complexity of cyclic rostering causes exact methods to fail for large-scale practical instances. In case of the FCRP, this is accentuated by the additionally imposed fairness requirements. Hence, heuristic methods are necessary. We present a three-phase heuristic for the FCRP combining column generation techniques with variable-depth neighborhood search. The heuristic exploits different mathematical formulations to find feasible solutions and to search for improvements. We apply our methodology to practical instances from Netherlands Railways (NS), the main passenger railway operator in the Netherlands Our results show the three-phase heuristic finds good solutions for most instances and outperforms a state-of-the-art commercial solver.}, language = {en} } @incollection{ŞahinLindnerSchlechte, author = {Şahin, G{\"u}ven{\c{c}} and Lindner, Niels and Schlechte, Thomas}, title = {Line Planning Problem}, series = {Encyclopedia of Optimization}, booktitle = {Encyclopedia of Optimization}, editor = {Pardalos, P. M. and Prokopyev, O. A.}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-030-54621-2}, doi = {10.1007/978-3-030-54621-2_782-1}, pages = {1 -- 6}, language = {en} } @misc{SchlechteBlomeGerberetal., author = {Schlechte, Thomas and Blome, Christian and Gerber, Stefan and Hauser, Stefan and Kasten, Jens and M{\"u}ller, Gilbert and Schulz, Christof and Th{\"u}ring, Michel and Weider, Steffen}, title = {The Bouquet of Features in Rolling Stock Rotation Planning}, series = {Conference Proceedings RailBelgrade 2023}, journal = {Conference Proceedings RailBelgrade 2023}, abstract = {Rolling stock is one of the major assets for a railway transportation company. Hence, their utilization should be as efficiently and effectively as possible. Railway undertakings are facing rolling stock scheduling challenges in different forms - from rather idealized weekly strategic problems to very concrete operational ones. Thus, a vast of optimization models with different features and objectives exist. Thorlacius et al. (2015) provides a comprehensive and valuable collection on technical requirements, models, and methods considered in the scientific literature. We contribute with an update including recent works. The main focus of the paper is to present a classification and elaboration of the major features which our solver R-OPT is able to handle. Moreover, the basic optimization model and algorithmic ingredients of R-OPT are discussed. Finally, we present computational results for a cargo application at SBB CARGO AG and other railway undertakings for passenger traffic in Europe to show the capabilities of R-OPT.}, language = {en} }