{"id":"W1992769367","doi":"10.1016/j.disopt.2014.03.001","title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Mathematics; Upper and lower bounds; Algorithm; Branch and cut; Computer science; Linear programming","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.0006728916,0.0002335159,0.0002132236,0.0000580319,0.0002816804,0.000177938,0.000149092,0.0001302753,0.00003126754],"category_scores_gemma":[0.0001633348,0.0001984911,0.00006194803,0.0002056574,0.00008324117,0.0002750282,0.00004001522,0.0001739979,0.000002415621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006732005,"about_ca_system_score_gemma":0.0000271129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004917153,"about_ca_topic_score_gemma":0.00001120429,"domain_scores_codex":[0.9987642,0.0001126712,0.0003349766,0.0002926137,0.0001561221,0.0003394526],"domain_scores_gemma":[0.9990881,0.0003551917,0.000101339,0.0002453136,0.00008818936,0.0001218316],"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.000002741908,0.00000518919,0.0001835761,0.00002022924,0.0000409158,8.767663e-8,0.0003288847,0.889507,0.0001256492,0.0007839664,0.00003766554,0.1089641],"study_design_scores_gemma":[0.001087617,0.0000252518,0.0004906297,0.00003776944,0.00005809483,0.0000057035,0.0001431237,0.9971173,0.0004856923,0.000121615,0.0001723056,0.0002548579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006707916,0.00007005527,0.9973019,0.0002099704,0.000181108,0.000637273,0.00002525652,0.00037809,0.0005255567],"genre_scores_gemma":[0.1594348,0.00004275813,0.8400558,0.00007686715,0.0001252011,0.00003826369,0.00003975519,0.00007175963,0.00011478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.158764,"threshold_uncertainty_score":0.809423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02244022931863883,"score_gpt":0.2567384899092984,"score_spread":0.2342982605906596,"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."}}