{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395439,0.001039491,0.001299452,0.0007477333,0.0007237032,0.00157926,0.001444589,0.001500914,0.004135448],"category_scores_gemma":[0.003722575,0.001012683,0.0006073256,0.001656505,0.0008643492,0.00164781,0.0008325886,0.001350759,0.0002871293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001400832,"about_ca_system_score_gemma":0.001391416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01706259,"about_ca_topic_score_gemma":0.01515183,"domain_scores_codex":[0.9995034,0.0002236927,0.00001311263,0.00005718301,0.00007497465,0.000127686],"domain_scores_gemma":[0.997359,0.002042102,0.0001823793,0.0001055265,0.0001766296,0.0001342605],"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.0000967738,0.00007646544,0.0002725701,0.00006084217,0.00002342795,0.00004293611,0.00002086087,0.9804248,0.0005345471,0.004114615,0.001736884,0.01259511],"study_design_scores_gemma":[0.00001432053,0.00002709549,0.00006721021,0.000002875239,0.000008057864,0.000005936942,0.00001012906,0.9973578,0.0002039443,0.002133608,0.0001658938,0.000003238176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2432397,0.001187398,0.7424142,0.00107348,0.0002807964,0.0003026504,0.00047577,0.000555968,0.01047014],"genre_scores_gemma":[0.8633485,0.0004928595,0.1297835,0.0002237429,0.0001186725,0.0002198305,0.000339132,0.0001845171,0.005289235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01706259,"threshold_uncertainty_score":0.03392661,"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."}}