{"id":"W1823652951","doi":"10.1007/3-540-45724-0_5","title":"An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vehicle routing problem; Metaheuristic; Computer science; Heuristics; Ant colony optimization algorithms; Ant colony; Mathematical optimization; Scheduling (production processes); Parallel metaheuristic; Job shop scheduling; Set (abstract data type); Ranging; Routing (electronic design automation); Operations research; Artificial intelligence; Mathematics; Computer network; Meta-optimization","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007729281,0.0002976135,0.0003916721,0.0001677294,0.0002069055,0.0001256691,0.0007220497,0.0001144804,0.000009007937],"category_scores_gemma":[0.00001610437,0.0002160404,0.00004203902,0.000262461,0.000163302,0.0001402893,0.0001146623,0.0002707155,0.000001830993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002335562,"about_ca_system_score_gemma":0.00005075816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001632763,"about_ca_topic_score_gemma":0.00001355151,"domain_scores_codex":[0.9983118,0.00004210495,0.0003933261,0.0004920148,0.0004285609,0.0003321552],"domain_scores_gemma":[0.9986274,0.0004653853,0.0001631101,0.0005637609,0.0001206496,0.0000596781],"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.00001045632,0.00005238331,0.0001004978,0.00005042307,0.00002042676,0.000004805153,0.002794635,0.9843596,0.001245716,0.00006636233,0.000002036318,0.01129268],"study_design_scores_gemma":[0.0005349315,0.0008139667,0.00003175826,0.0001837886,0.00002110683,0.0000158919,0.00001425123,0.9931345,0.004928885,0.00004525932,0.00001990846,0.0002557751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01451567,0.0001117539,0.983059,0.00001043231,0.0001723139,0.001589016,0.000007497457,0.0001962359,0.000338087],"genre_scores_gemma":[0.8252577,6.816487e-7,0.1744868,0.00001945605,0.000121145,0.0000366177,0.000001968906,0.0000540203,0.00002163161],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.810742,"threshold_uncertainty_score":0.8809873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01825213010327444,"score_gpt":0.2586633634801803,"score_spread":0.2404112333769058,"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."}}