{"id":"W3130000260","doi":"10.1287/trsc.2020.1030","title":"The Locomotive Assignment Problem with Distributed Power at the Canadian National Railway Company","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Fleet management; Integer programming; Time horizon; Mathematical optimization; Decomposition; Linear programming; Assignment problem; Reduction (mathematics); Constraint (computer-aided design); Operations research; Power (physics); Computer science; State (computer science); Constraint programming; Engineering; Transport engineering; Algorithm; Stochastic programming; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0006009403,0.0011098,0.0009889628,0.0006992812,0.001486764,0.001947954,0.001619195,0.001731845,0.008326387],"category_scores_gemma":[0.001380457,0.0005585976,0.0008302329,0.002067854,0.000844638,0.0009852119,0.0006675483,0.001040799,0.0002859732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00787027,"about_ca_system_score_gemma":0.007907415,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.56773,"about_ca_topic_score_gemma":0.5713624,"domain_scores_codex":[0.9994453,0.0001273165,0.00001394974,0.0001343066,0.00008009213,0.0001991113],"domain_scores_gemma":[0.9996518,0.0001602906,0.00003418107,0.00002028585,0.00005632175,0.00007704836],"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.00007644837,0.00006626322,0.0008357693,0.0000570972,0.00001942406,0.0001940352,0.00004908169,0.9750251,0.0004861639,0.01106499,0.003258525,0.008867106],"study_design_scores_gemma":[0.00007159324,0.00004715752,0.001350379,0.00001686806,0.00002572568,0.00006067348,0.0002021977,0.9871487,0.0004098187,0.005849677,0.004797869,0.00001937291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.639223,0.001284108,0.2645065,0.003002545,0.0001828282,0.0006574066,0.003742046,0.000441623,0.08695989],"genre_scores_gemma":[0.9414098,0.0005232086,0.03860408,0.00009990117,0.00003561913,0.000127962,0.001258678,0.00005807804,0.01788265],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.43227,"threshold_uncertainty_score":0.8696314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008333230380190881,"score_gpt":0.2057723298855191,"score_spread":0.1974390995053283,"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."}}