{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144233,0.0008267137,0.001184043,0.0007597284,0.0005223888,0.0008895861,0.001827124,0.001442613,0.005956143],"category_scores_gemma":[0.002392741,0.0006052779,0.0007221854,0.001085523,0.0004465586,0.001646405,0.001139728,0.001313963,0.001006628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008126027,"about_ca_system_score_gemma":0.002206006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007083558,"about_ca_topic_score_gemma":0.008469872,"domain_scores_codex":[0.9995306,0.00008664564,0.00002482491,0.00009652037,0.0001932847,0.00006826594],"domain_scores_gemma":[0.9994245,0.0002927074,0.00004338191,0.00006288195,0.0001418083,0.00003478405],"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.0001243136,0.0001223733,0.0003188853,0.0001414764,0.00005144408,0.00006927761,0.00005576879,0.7321978,0.002440509,0.02159222,0.005126282,0.2377597],"study_design_scores_gemma":[0.00003256025,0.00002282743,0.00004227169,0.000006571699,0.000006074246,0.00002006394,0.000006248843,0.9942223,0.00026842,0.003874473,0.001492717,0.000005389398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002885137,0.0001684528,0.9942943,0.00007139496,0.0001069626,0.00004063694,0.00004098429,0.0002987373,0.002093274],"genre_scores_gemma":[0.07213869,0.0002372099,0.9219146,0.0001266796,0.00009163186,0.0002385501,0.0001633234,0.0001325581,0.004956712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007083558,"threshold_uncertainty_score":0.0199253,"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."}}