{"id":"W4406959045","doi":"10.1145/3681772.3698216","title":"Clustering-Based Enhanced Ant Colony Optimization for Multi-Trip Vehicle Routing Problem with Heterogeneous Fleet and Time Windows: An Industrial Case Study","year":2024,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"National Research Council Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Cluster analysis; Computer science; ANT; Routing (electronic design automation); Ant colony; Travelling salesman problem; Artificial intelligence; Computer network; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006744003,0.0002898507,0.0002953104,0.0001637927,0.0001800724,0.0003110622,0.00009499746,0.0001561953,0.00003821274],"category_scores_gemma":[0.00005319476,0.0002649586,0.00003722443,0.0003738299,0.00003013612,0.0002785396,0.00003743884,0.0001907479,0.000002460315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001203851,"about_ca_system_score_gemma":0.00006607995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006225502,"about_ca_topic_score_gemma":0.0001626704,"domain_scores_codex":[0.9984449,0.0001523906,0.0004109118,0.0004753457,0.0001585261,0.0003579536],"domain_scores_gemma":[0.9992765,0.0001991105,0.00005166597,0.0002326084,0.00009703817,0.000143136],"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.00008234912,0.0001025358,0.0001970444,0.00008622435,0.00008227665,0.000208806,0.001045336,0.9912485,0.001382417,0.000001446681,0.000009757976,0.005553232],"study_design_scores_gemma":[0.003114382,0.0008395234,0.000005456888,0.00008495538,0.00009134166,0.0002396415,0.0004497691,0.990392,0.00441982,6.022879e-7,0.00001241754,0.0003500314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3707894,0.00002661944,0.6267484,0.00001163931,0.00009716608,0.001456732,0.00001424731,0.0008249189,0.00003084243],"genre_scores_gemma":[0.6817012,9.129841e-7,0.317877,0.00001805676,0.00008528586,0.0001489104,0.00002125674,0.00009288196,0.00005448911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3109118,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04106927700715379,"score_gpt":0.2969030575333903,"score_spread":0.2558337805262365,"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."}}