{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009408645,0.001013726,0.00107464,0.0004998425,0.0003487788,0.001057111,0.001085135,0.001083063,0.004269724],"category_scores_gemma":[0.001777815,0.0005609636,0.0008550659,0.0006688505,0.0004860177,0.0009861679,0.001097812,0.001478688,0.0003908705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006563331,"about_ca_system_score_gemma":0.001633475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006027306,"about_ca_topic_score_gemma":0.00429526,"domain_scores_codex":[0.9995722,0.0001950159,0.00001147887,0.00006635486,0.00008123239,0.00007372315],"domain_scores_gemma":[0.9993659,0.0003711062,0.00006400089,0.00003540017,0.00009959898,0.00006408548],"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.00008980231,0.00008283737,0.0002943898,0.000115505,0.0000402594,0.00007378087,0.00003466403,0.9619767,0.001132582,0.0181253,0.002527938,0.01550624],"study_design_scores_gemma":[0.00001053062,0.0000195096,0.00005807984,0.000005184772,0.000006191226,0.000008948869,0.000008032292,0.995073,0.00009757919,0.004331223,0.000379223,0.000002450937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03007238,0.0003726132,0.9578394,0.0003686507,0.0001164655,0.00007408344,0.0002429638,0.0001011449,0.01081238],"genre_scores_gemma":[0.546667,0.0006769077,0.4365542,0.0002561624,0.000167087,0.0004620293,0.0008589249,0.000240154,0.01411748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006027306,"threshold_uncertainty_score":0.01428366,"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."}}