{"id":"W3027262244","doi":"10.1016/j.ejor.2020.05.005","title":"Alternating Lagrangian decomposition for integrated airline crew scheduling problem","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Crew scheduling; Column generation; Computer science; Scheduling (production processes); Mathematical optimization; Set (abstract data type); Constraint programming; Operations research; Decomposition; Context (archaeology); Assignment problem; Engineering; Mathematics; Aeronautics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00456534,0.0001028305,0.0001544058,0.0001848885,0.0001900443,0.0002081915,0.0002950372,0.00002225957,0.00008208281],"category_scores_gemma":[0.001177812,0.00009433995,0.0000760638,0.0003873623,0.00003142892,0.0002911851,0.00003910645,0.0005654825,0.00003038657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008412829,"about_ca_system_score_gemma":0.0001020264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.227229e-7,"about_ca_topic_score_gemma":3.625248e-7,"domain_scores_codex":[0.9978973,0.0006580175,0.0005706151,0.0001244205,0.0005179717,0.0002316982],"domain_scores_gemma":[0.9980048,0.0003299467,0.00007672306,0.00006704023,0.001327696,0.0001937759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006515261,0.00001711069,0.00008202335,0.00005671351,0.0000475222,0.0000270273,0.0005143803,0.9366309,0.05023668,0.0005505856,0.001076801,0.01069511],"study_design_scores_gemma":[0.0009426834,0.0003212143,0.000241117,0.0001570163,0.000008320714,0.00003961738,0.000164177,0.9844311,0.007981021,0.00004476554,0.005550815,0.0001181477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07759463,0.0002143212,0.9158135,0.002930207,0.0001139212,0.0002258072,0.00001152822,0.00005932776,0.003036726],"genre_scores_gemma":[0.5209129,0.00002696556,0.4782426,0.0001065271,0.0006153524,0.000002164826,0.00001921096,0.00004331043,0.0000309325],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4433183,"threshold_uncertainty_score":0.3847072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0954391724302661,"score_gpt":0.3872762680525461,"score_spread":0.2918370956222799,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}