{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005130776,0.00007123507,0.000103015,0.0000970846,0.0001356815,0.0001513274,0.0001969248,0.00001132658,0.0001308467],"category_scores_gemma":[0.0004539261,0.00004541151,0.00002731286,0.0001584742,0.0000891271,0.0001310901,0.0000328233,0.0003626672,0.00002470893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003396492,"about_ca_system_score_gemma":0.00008228647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.59191e-7,"about_ca_topic_score_gemma":4.23518e-7,"domain_scores_codex":[0.9986907,0.0003858039,0.0002461307,0.00008502169,0.0004080528,0.0001842646],"domain_scores_gemma":[0.9983035,0.001042429,0.00004092155,0.0001035554,0.0004367818,0.00007277155],"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.0001795531,0.0000368663,0.002587152,0.0002656851,0.0002275683,0.0000775892,0.00396305,0.9231994,0.01763209,0.004012316,0.001975308,0.0458434],"study_design_scores_gemma":[0.008305898,0.002049703,0.0718723,0.001295976,0.00007795921,0.001827211,0.003717812,0.8835362,0.004166943,0.0002275147,0.02213811,0.0007844392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3434312,0.001072578,0.6325219,0.001311281,0.0001445994,0.0007094691,0.00001110784,0.00004201928,0.02075583],"genre_scores_gemma":[0.9427631,0.0000429827,0.05646884,0.0000424158,0.0001701316,0.000003229139,0.000001382429,0.00003437891,0.0004734875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5993319,"threshold_uncertainty_score":0.1851828,"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."}}