{"id":"W2536571921","doi":"10.4230/oasics.atmos.2016.6","title":"Multi-Column Generation Model for the Locomotive Assignment Problem","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Column generation; Train; Decomposition; Column (typography); Computer science; Set (abstract data type); Decomposition method (queueing theory); Generator (circuit theory); Heuristics; Assignment problem; Process (computing); Fraction (chemistry); Mathematical optimization; Algorithm; Mathematics; Power (physics)","routes":{"ca_aff":true,"ca_fund":true,"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.0007862958,0.001222226,0.0009704854,0.0006828526,0.0003755508,0.00128186,0.001696456,0.001112376,0.005777049],"category_scores_gemma":[0.00126027,0.0005635593,0.00124271,0.001471523,0.0005260389,0.001050085,0.0007723781,0.001686562,0.001185857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009713882,"about_ca_system_score_gemma":0.001211096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006739357,"about_ca_topic_score_gemma":0.009555783,"domain_scores_codex":[0.9993435,0.0002615446,0.00002654274,0.0001421654,0.0001285553,0.00009773551],"domain_scores_gemma":[0.9993312,0.0003668396,0.00007811955,0.00006691797,0.0001069019,0.00005006526],"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.00004037831,0.00005457301,0.0002842892,0.0000795786,0.00002692778,0.00008139609,0.00002441294,0.9712154,0.000841736,0.008944994,0.002452315,0.01595403],"study_design_scores_gemma":[0.000008629134,0.00001123187,0.00004397252,0.000003272649,0.00000466895,0.00001587801,0.000005366952,0.9958846,0.0001776487,0.003197331,0.0006440364,0.000003423286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009716976,0.0002242432,0.9867019,0.0002022135,0.00005731641,0.00009003199,0.0004838612,0.0003255577,0.002197824],"genre_scores_gemma":[0.2630185,0.0005371039,0.7260481,0.0002806864,0.0001126029,0.0006207917,0.002238727,0.000248086,0.006895384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006739357,"threshold_uncertainty_score":0.01932621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02992468883635889,"score_gpt":0.2324706783762818,"score_spread":0.2025459895399229,"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."}}