{"id":"W2121490839","doi":"10.1016/j.cor.2005.07.002","title":"Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Fixed cost; Computer science; Minification; Vehicle routing problem; Scheduling (production processes); Shortest path problem; Lexicographical order; Routing (electronic design automation); Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.002203888,0.0001481819,0.0001769359,0.0003330797,0.0005373975,0.000536463,0.0001976131,0.0001013564,0.0000210794],"category_scores_gemma":[0.0001351309,0.0001809009,0.00002238521,0.0007515256,0.00004839462,0.0004724433,0.0001499491,0.0005016965,0.00002138008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003693749,"about_ca_system_score_gemma":0.00004812058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008263541,"about_ca_topic_score_gemma":0.0004377253,"domain_scores_codex":[0.9980028,0.0003696782,0.0003881023,0.0003505393,0.0003226684,0.0005662238],"domain_scores_gemma":[0.9992831,0.0001539808,0.00001411268,0.0002440806,0.0001827489,0.0001219914],"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.000001675253,0.00003121832,0.0009898772,0.00002416333,0.00001160836,0.000001603794,0.001042426,0.9520383,0.02359293,0.0002783364,0.0007114781,0.0212764],"study_design_scores_gemma":[0.0006826593,0.00002088132,0.0004141475,0.00008170166,0.00000253613,0.000002909576,0.0001566667,0.994784,0.003133674,0.000006466854,0.000534884,0.0001794683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.382472,0.0004968051,0.6151332,0.0008554179,0.00009960152,0.0004722715,0.000005627026,0.0001775856,0.0002874862],"genre_scores_gemma":[0.8104865,0.0001317923,0.1888354,0.0000678726,0.0002100837,0.000064224,0.00005416725,0.00004079642,0.0001091231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4280145,"threshold_uncertainty_score":0.7376922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04871979780575466,"score_gpt":0.3381929753495604,"score_spread":0.2894731775438058,"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."}}