{"id":"W2069736946","doi":"10.1007/s10288-013-0238-z","title":"A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration","year":2013,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRIPS architecture; Vehicle routing problem; Duration (music); Column generation; Computer science; Set (abstract data type); Routing (electronic design automation); Mathematical optimization; Time complexity; Variable (mathematics); Algorithm; Mathematics; Parallel computing; Computer network","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.0002570733,0.0001478957,0.0001342458,0.00005543892,0.0001117338,0.000154648,0.0001039804,0.00006159545,0.00008062124],"category_scores_gemma":[0.00006653072,0.0001065387,0.00001926038,0.0003023044,0.00001501549,0.0002247137,0.00003628394,0.0001414786,0.0001403653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004123386,"about_ca_system_score_gemma":0.00002050845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001015336,"about_ca_topic_score_gemma":0.000007636083,"domain_scores_codex":[0.9991913,0.00004045445,0.000206957,0.0001814807,0.0001309407,0.0002489034],"domain_scores_gemma":[0.9994695,0.0001019756,0.00004390033,0.000195532,0.00006552569,0.0001235804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001482577,0.00003187798,0.001661676,0.00004174207,0.0001049079,0.000004608669,0.004588134,0.4235827,0.03307216,0.00005501843,0.002610543,0.5342318],"study_design_scores_gemma":[0.000564494,0.00004740663,0.006275844,0.0000400327,0.00001592698,0.00001089877,0.00007816911,0.9891842,0.003080282,0.00001495258,0.0005166891,0.0001710987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05121062,0.00005507725,0.9462666,0.0006955229,0.00004587692,0.0008715627,0.000002590159,0.0004076361,0.0004445083],"genre_scores_gemma":[0.07440457,0.000004355293,0.9244876,0.0001549358,0.0001130751,0.00006101099,0.000006103662,0.00005505052,0.0007133252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5656015,"threshold_uncertainty_score":0.4344524,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01179034511206651,"score_gpt":0.2266155954218323,"score_spread":0.2148252503097658,"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."}}