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

被引:6
作者
Gattermann-Itschert, Theresa [1 ]
Poreschack, Laura Maria [1 ]
Thonemann, Ulrich W. [1 ]
机构
[1] Univ Cologne, Dept Supply Chain Management & Management Sci, D-50932 Cologne, Germany
关键词
crew scheduling; optimization; machine learning; preferences; COLUMN GENERATION; ALGORITHM; PRICE;
D O I
10.1287/trsc.2022.1196
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In crew scheduling, optimization models can become complex when a large number of penalty terms is included in the objective function to take planners' preferences into account. Planners' preferences often include nonmonetary aspects for which both the mathematical formulation and the assignment of appropriate penalty costs can be difficult. We address this problem by using machine learning to learn and predict planners' preferences. We train a random forest classifier on planner feedback regarding duties from their daily work in railway crew scheduling. Our data set contains over 16,000 duties that planners labeled as good or bad. The trained model predicts the probability that a duty is perceived as bad by the planners. We present a novel approach to replace the large construct of penalty terms in a crew scheduling optimization model by a single term that penalizes duties proportionally to the predicted probability of being assessed as unfavorable by a planner. By integrating this probability into the optimization model, we generate schedules that include more duties with preferred characteristics. We increase the mean planner acceptance probability by more than 12% while only facing a marginal increase in costs compared with the original approach that utilizes a set of multiple penalty terms. Our approach combines machine learning to detect complex patterns regarding favorable duty characteristics and optimization to create feasible and cost-efficient crew schedules.
引用
收藏
页码:796 / 812
页数:18
相关论文
共 37 条
  • [1] Reinventing crew scheduling at Netherlands railways
    Abbink, E
    Fischetti, M
    Kroon, L
    Timmer, G
    Vromans, M
    [J]. INTERFACES, 2005, 35 (05) : 393 - 401
  • [2] Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling
    Archetti, Claudia
    Cordeau, Jean-Francois
    Desaulniers, Guy
    [J]. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2020, 9 (04)
  • [3] Integrating Timetabling and Crew Scheduling at a Freight Railway Operator
    Bach, Lukas
    Dollevoet, Twan
    Huisman, Dennis
    [J]. TRANSPORTATION SCIENCE, 2016, 50 (03) : 878 - 891
  • [4] Branch-and-price: Column generation for solving huge integer programs
    Barnhart, C
    Johnson, EL
    Nemhauser, GL
    Savelsbergh, MWP
    Vance, PH
    [J]. OPERATIONS RESEARCH, 1998, 46 (03) : 316 - 329
  • [5] Machine learning for combinatorial optimization: A methodological tour d'horizon
    Bengio, Yoshua
    Lodi, Andrea
    Prouvost, Antoine
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (02) : 405 - 421
  • [6] On the Efficiency-Fairness Trade-off
    Bertsimas, Dimitris
    Farias, Vivek F.
    Trichakis, Nikolaos
    [J]. MANAGEMENT SCIENCE, 2012, 58 (12) : 2234 - 2250
  • [7] Dynamic evaluation of airline Crew's flight requests using a neural network
    Beulen, M.
    Scherp, L.
    Santos, B. F.
    [J]. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2020, 9 (04)
  • [8] Borndorfer R, 2015, 1544 ZUS I BERL
  • [9] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [10] Railway Rolling Stock Planning: Robustness Against Large Disruptions
    Cacchiani, Valentina
    Caprara, Alberto
    Galli, Laura
    Kroon, Leo
    Maroti, Gabor
    Toth, Paolo
    [J]. TRANSPORTATION SCIENCE, 2012, 46 (02) : 217 - 232