{"id":"W4308232794","doi":"10.1145/3557991.3567776","title":"Solving a multi-trip VRP with real heterogeneous fleet and time windows based on ant colony optimization","year":2022,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"National Research Council Canada; University of Calgary","funders":"","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Computer science; Heuristics; TRIPS architecture; Constructive; Heuristic; Mathematical optimization; Metaheuristic; Routing (electronic design automation); Operations research; Algorithm; Artificial intelligence; Engineering; Process (computing); Mathematics; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0003405004,0.0001712145,0.0001801926,0.0001409929,0.0002165703,0.00005176232,0.0000962908,0.00004703924,0.000420004],"category_scores_gemma":[0.0000332629,0.0001680785,0.00002588604,0.0002782246,0.00002127581,0.000066397,0.00004909157,0.0001625864,0.00000524212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384491,"about_ca_system_score_gemma":0.0000291344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002227755,"about_ca_topic_score_gemma":0.000005002568,"domain_scores_codex":[0.9989523,0.0001456121,0.0001938249,0.0002495197,0.0002216455,0.000237153],"domain_scores_gemma":[0.9994907,0.0001361457,0.00004413876,0.000211757,0.00003477391,0.00008252403],"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.000050039,0.00003703104,0.0005381877,0.00001426776,0.00001831413,0.00001719285,0.0001157559,0.9976795,0.0007865009,0.000008094474,0.00009827829,0.0006367801],"study_design_scores_gemma":[0.001064434,0.0002174513,0.0001541291,0.00001133668,0.00001692373,0.00002564548,0.00002618489,0.9971373,0.0009995262,7.951982e-7,0.0001287213,0.0002175192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04346943,0.00003565447,0.951337,0.00007191456,0.0001032852,0.0004936563,0.00002261916,0.0008762723,0.00359015],"genre_scores_gemma":[0.4505236,0.00001039971,0.5486961,0.0001899227,0.00002502213,0.00006415877,0.00004129088,0.0000780253,0.000371505],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4070542,"threshold_uncertainty_score":0.6854041,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01195415939112946,"score_gpt":0.2306156497395923,"score_spread":0.2186614903484628,"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."}}