{"id":"W2383990091","doi":"","title":"Ant colony algorithm for vehicle routing problem with hard time window","year":2006,"lang":"en","type":"article","venue":"","topic":"Simulation and Modeling Applications","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Ant colony optimization algorithms; Algorithm; Vehicle routing problem; Degree (music); Mathematical optimization; Heuristic; Ant colony; Computer science; Routing (electronic design automation); Process (computing); Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003284452,0.0006785079,0.0007685452,0.0004500444,0.0003762485,0.0006401541,0.0009301365,0.0006873715,0.001138754],"category_scores_gemma":[0.001008038,0.0002844835,0.0004374439,0.0007376985,0.0003029208,0.0006294082,0.000511342,0.0008250381,0.0002248001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003915495,"about_ca_system_score_gemma":0.0008898812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006334772,"about_ca_topic_score_gemma":0.003738005,"domain_scores_codex":[0.9996661,0.0001135482,0.00001912069,0.0000561149,0.0001069327,0.00003828617],"domain_scores_gemma":[0.9997457,0.0001217609,0.0000333819,0.00001977335,0.00006332724,0.00001609077],"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.00005053307,0.0000341369,0.0002784248,0.00009204146,0.00003956831,0.00008278429,0.00005850997,0.9217817,0.0027925,0.01065993,0.002064739,0.06206512],"study_design_scores_gemma":[0.00001523632,0.00001726978,0.00004391649,0.000002908673,0.000004651358,0.00002164297,0.000006893892,0.9961903,0.0002834668,0.002298712,0.001111588,0.000003413863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02081708,0.0006982561,0.9721728,0.0002355825,0.00007984383,0.0001014889,0.00005296964,0.0004453323,0.005396663],"genre_scores_gemma":[0.538993,0.0007959651,0.4527872,0.0001074503,0.00005809701,0.0004320334,0.0002204667,0.0001001961,0.006505629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006334772,"threshold_uncertainty_score":0.01259583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00771435787825425,"score_gpt":0.202737716019745,"score_spread":0.1950233581414907,"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."}}