{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004858437,0.000676622,0.0006481441,0.0004037028,0.0003694771,0.0007375467,0.00094902,0.0007890787,0.00114405],"category_scores_gemma":[0.001041399,0.0003627749,0.0005883667,0.0006099339,0.0003463295,0.0007735589,0.0005792069,0.0005719447,0.00009495518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004777716,"about_ca_system_score_gemma":0.0009848736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008297337,"about_ca_topic_score_gemma":0.007161213,"domain_scores_codex":[0.9996928,0.0000938153,0.00001403915,0.00008715467,0.00005636086,0.00005584264],"domain_scores_gemma":[0.9995663,0.00026715,0.00006179055,0.0000293866,0.00004276475,0.0000325617],"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.00001739221,0.00001679389,0.0002515234,0.0000256,0.00001717297,0.00005946319,0.00001315508,0.9892643,0.0008227736,0.001426334,0.0001849917,0.007900502],"study_design_scores_gemma":[0.000004959555,0.00001521199,0.00008049358,0.000001274438,0.000003997699,0.00001614912,0.0000117835,0.9989466,0.000180786,0.0005442852,0.0001926438,0.000001859489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1123025,0.0002827407,0.8812062,0.000228996,0.00005509211,0.000115962,0.000130067,0.00025814,0.005420301],"genre_scores_gemma":[0.7262916,0.0002042662,0.2706576,0.00005360242,0.00002183161,0.0001500607,0.0001677411,0.00006678014,0.002386415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008297337,"threshold_uncertainty_score":0.01649803,"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."}}