Using Machine Learning to Include Planners’ Preferences in Railway Crew Scheduling Optimization

Published Online:https://doi.org/10.1287/trsc.2022.1196

References

  • Abbink E, Fischetti M, Kroon L, Timmer G, Vromans M (2005) Reinventing crew scheduling at Netherlands Railways. Interfaces 35(5):393–401.LinkGoogle Scholar
  • Ait Haddadene SR, Labadie N, Prodhon C (2019) Bicriteria vehicle routing problem with preferences and timing constraints in home healthcare services. Algorithms (Basel) 12(8):152.CrossrefGoogle Scholar
  • Archetti C, Cordeau JF, Desaulniers G (2020) Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling. EURO J. Transportation Logist. 9(4):100024.CrossrefGoogle Scholar
  • Bach L, Dollevoet T, Huisman D (2016) Integrating timetabling and crew scheduling at a freight railway operator. Transportation Sci. 50(3):878–891.LinkGoogle Scholar
  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.LinkGoogle Scholar
  • Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2):405–421.CrossrefGoogle Scholar
  • Bertsimas D, Farias VF, Trichakis N (2012) On the efficiency-fairness trade-off. Management Sci. 58(12):2234–2250.LinkGoogle Scholar
  • Beulen M, Scherp L, Santos BF (2020) Dynamic evaluation of airline crew’s flight requests using a neural network. EURO J. Transportation Logist. 9(4):100020.CrossrefGoogle Scholar
  • Borndörfer R, Reuther M, Schlechte T, Schulz C, Swarat E, Weider S (2015) Duty rostering in public transport—facing preferences, fairness, and fatigue. Technical Report No. 15-44, Zuse Institute Berlin, Berlin.Google Scholar
  • Breiman L (2001) Random forests. Machine Learn. 45(1):5–32.CrossrefGoogle Scholar
  • Cacchiani V, Caprara A, Galli L, Kroon L, Maróti G, Toth P (2012) Railway rolling stock planning: Robustness against large disruptions. Transportation Sci. 46(2):217–232.LinkGoogle Scholar
  • Chen C, Liaw A, Breiman L (2004) Using random forest to learn imbalanced data. Working paper No. 666, University of California, Berkeley, CA.Google Scholar
  • Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32(4):380–404.LinkGoogle Scholar
  • Crainic TG, Rousseau JM (1987) The column generation principle and the airline crew scheduling problem. INFOR Inform. Systems Oper. Res. 25(2):136–151.Google Scholar
  • Desaulniers G, Desrosiers J, Solomon M (2006) Column Generation, vol. 5 (Springer Science & Business Media, New York).Google Scholar
  • Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1):3–27.CrossrefGoogle Scholar
  • Er-Rbib S, Desaulniers G, Elhallaoui I, Munroe P (2021) Preference-based and cyclic bus driver rostering problem with fixed days off. Public Transport 13(2):251–286.CrossrefGoogle Scholar
  • Espinosa-Aranda JL, García-Ródenas R, Ramírez-Flores MDC, López-García ML, Angulo E (2015) High-speed railway scheduling based on user preferences. Eur. J. Oper. Res. 246(3):772–786.CrossrefGoogle Scholar
  • Fawcett T (2006) An introduction to ROC analysis. Pattern Recognition Lett. 27(8):861–874.CrossrefGoogle Scholar
  • Friedman JH (2001) Greedy function approximation: A gradient boosting machine. Ann. Statist. 29:1189–1232.CrossrefGoogle Scholar
  • Gopalakrishnan B, Johnson EL (2005) Airline crew scheduling: State-of-the-art. Ann. Oper. Res. 140(1):305–337.CrossrefGoogle Scholar
  • Hadwan M, Ayob M, Sabar NR, Qu R (2013) A harmony search algorithm for nurse rostering problems. Inform. Sci. 233:126–140.CrossrefGoogle Scholar
  • Hastie T, Tibshirani R, Friedman J (2009) The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd ed. (Springer, New York).CrossrefGoogle Scholar
  • Huisman D (2007) A column generation approach for the rail crew re-scheduling problem. Eur. J. Oper. Res. 180(1):163–173.CrossrefGoogle Scholar
  • Jütte S, Thonemann UW (2012) Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems. Eur. J. Oper. Res. 219(2):214–223.CrossrefGoogle Scholar
  • Jütte S, Albers M, Thonemann UW, Haase K (2011) Optimizing railway crew scheduling at DB Schenker. Interfaces 41(2):109–122.LinkGoogle Scholar
  • Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.LinkGoogle Scholar
  • Morabit M, Desaulniers G, Lodi A (2021) Machine-learning-based column selection for column generation. Transportation Sci. 55(4):815–831.LinkGoogle Scholar
  • Pang B, Lee L, Vaithyanathan S (2002) Thumbs up? Sentiment classification using machine learning techniques. Proc. 2002 Conf. Empirical Methods Natural Language Processing (Association for Computational Linguistics, Stroudsberg, PA), 79–86.Google Scholar
  • Quesnel F, Desaulniers G, Soumis F (2020) Improving air crew rostering by considering crew preferences in the crew pairing problem. Transportation Sci. 54(1):97–114.LinkGoogle Scholar
  • Quesnel F, Wu A, Desaulniers G, Soumis F (2022) Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering. Comput. Oper. Res. 138:105554.CrossrefGoogle Scholar
  • Rählmann C, Wagener F, Thonemann UW (2021) Robust tactical crew scheduling under uncertain demand. Transportation Sci. 55(6):1392–1410.LinkGoogle Scholar
  • Tahir A, Quesnel F, Desaulniers G, Hallaoui IE, Yaakoubi Y (2021) An improved integral column generation algorithm using machine learning for aircrew pairing. Transportation Sci. 55(6):1411–1429.LinkGoogle Scholar
  • Veelenturf LP, Kidd MP, Cacchiani V, Kroon LG, Toth P (2016a) A railway timetable rescheduling approach for handling large-scale disruptions. Transportation Sci. 50(3):841–862.LinkGoogle Scholar
  • Veelenturf LP, Potthoff D, Huisman D, Kroon LG, Maróti G, Wagelmans AP (2016b) A quasi-robust optimization approach for crew rescheduling. Transportation Sci. 50(1):204–215.LinkGoogle Scholar
  • Yaakoubi Y, Soumis F, Lacoste-Julien S (2020) Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation. EURO J. Transportation Logist. 9(4):100020.CrossrefGoogle Scholar
  • Yura K (1994) Production scheduling to satisfy worker’s preferences for days off and overtime under due-date constraints. Internat. J. Production Econom. 33(1–3):265–270.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.