{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005139913,0.00006677409,0.0000681189,0.00002354301,0.00006148809,0.00002462768,0.00004020019,0.00003052636,0.00002683434],"category_scores_gemma":[0.000001200102,0.00005820591,0.00001874534,0.00007338377,0.000007375924,0.00004350443,0.000004291792,0.00003388814,0.00004963064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675442,"about_ca_system_score_gemma":0.000009311429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003514499,"about_ca_topic_score_gemma":0.000009270148,"domain_scores_codex":[0.9996026,0.000002130503,0.0001085605,0.00009621612,0.00005588854,0.0001345629],"domain_scores_gemma":[0.9997961,0.00002980456,0.00001246811,0.00009248317,0.00004410389,0.00002505337],"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.000003738565,0.00003260531,0.0002882156,0.00001220796,0.00001988758,3.21668e-7,0.00005658162,0.9589775,0.01198857,0.001910714,0.005071857,0.02163783],"study_design_scores_gemma":[0.0004134309,0.00001525772,0.0005033173,0.000006211706,0.000008201354,0.000001154526,0.000007610287,0.9884857,0.0032566,0.0002098308,0.006997836,0.00009487609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0419145,0.00001476592,0.9467406,0.0001150617,0.00001661514,0.0004035439,0.00001135372,0.0006024824,0.01018109],"genre_scores_gemma":[0.7467915,5.358769e-7,0.2496428,0.00004860391,0.00008774126,0.0001065082,0.0000394266,0.00002790976,0.003255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.704877,"threshold_uncertainty_score":0.2373568,"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."}}