{"id":"W2991187918","doi":"10.1016/j.ejor.2019.11.043","title":"A branch-and-price heuristic for the crew pairing problem with language constraints","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Computer science; Heuristic; Set (abstract data type); Schedule; Operations research; Tree (set theory); Mathematical optimization; Artificial intelligence; Programming language; Mathematics; Engineering","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.001407024,0.0014177,0.00271884,0.001571473,0.001500511,0.002119323,0.002758955,0.003276285,0.01620441],"category_scores_gemma":[0.003417083,0.001187694,0.001552082,0.002118143,0.001062352,0.002599528,0.002194724,0.002498737,0.001736843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001542428,"about_ca_system_score_gemma":0.004115069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01103009,"about_ca_topic_score_gemma":0.009986639,"domain_scores_codex":[0.9991645,0.0002913012,0.00002958548,0.0001240959,0.0001354188,0.00025523],"domain_scores_gemma":[0.9984218,0.001049591,0.00007394153,0.0001120992,0.0001376109,0.0002049965],"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.0003723327,0.000620971,0.000456105,0.0001935391,0.00006540238,0.0002864808,0.000181882,0.8281305,0.002272194,0.02528623,0.009487809,0.1326466],"study_design_scores_gemma":[0.0001377689,0.0001109213,0.00009663567,0.00002050235,0.00002678004,0.00004250556,0.00008743536,0.9857474,0.0005245536,0.01130409,0.001883902,0.00001762098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05463396,0.0005023018,0.9234042,0.0006670528,0.0002624099,0.0006697529,0.0003300762,0.001217237,0.01831304],"genre_scores_gemma":[0.2767183,0.0003343915,0.7120813,0.0002743042,0.0001019676,0.0006027247,0.0006121226,0.0004441601,0.008830652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01620441,"threshold_uncertainty_score":0.05420917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0438936097016484,"score_gpt":0.3347566218631179,"score_spread":0.2908630121614695,"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."}}