{"id":"W4402615264","doi":"10.1016/j.ejtl.2024.100143","title":"A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Metaheuristic; Synchronization (alternating current); Computer science; Arrival time; Travel time; Time synchronization; Routing (electronic design automation); Fleet management; Real-time computing; Engineering; Transport engineering; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0006404264,0.0002223182,0.0002369655,0.0001127811,0.0002114082,0.0002430259,0.00006180187,0.0000675971,0.00002938142],"category_scores_gemma":[0.00006452072,0.0001927291,0.00004167568,0.0002338089,0.00004019441,0.0001299414,0.00000207772,0.0003377049,0.00001353497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005733429,"about_ca_system_score_gemma":0.00003947698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000196446,"about_ca_topic_score_gemma":0.000004010296,"domain_scores_codex":[0.998736,0.00009106292,0.0004072752,0.0002481353,0.0002420234,0.0002754887],"domain_scores_gemma":[0.9992597,0.0003224796,0.00009015686,0.00008893336,0.00009893526,0.000139852],"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.0001284388,0.00002366387,0.0002981761,0.000127903,0.00009075161,0.00007050129,0.0003651512,0.9797353,0.000519114,0.001328788,0.0001439006,0.01716831],"study_design_scores_gemma":[0.001117575,0.0005276068,0.002474643,0.0003775401,0.0001975538,0.00004894432,0.00001895617,0.9938599,0.0001446706,0.000423111,0.0005600483,0.0002493947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0427496,0.0005651257,0.9548364,0.0002351205,0.0002161259,0.0004593701,0.00005413368,0.0003603947,0.0005237182],"genre_scores_gemma":[0.9667211,0.0001379303,0.03238757,0.0001291652,0.0002504434,0.00001241422,0.00004989477,0.00008879405,0.0002227533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9239714,"threshold_uncertainty_score":0.7859265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01312235701810524,"score_gpt":0.2496270787101207,"score_spread":0.2365047216920155,"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."}}