{"id":"W2912697490","doi":"10.3311/ppci.12813","title":"Parallel Ant Colony Algorithm for Shortest Path Problem","year":2019,"lang":"en","type":"article","venue":"Periodica Polytechnica Civil Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Transport Canada","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Shortest path problem; Ant colony; Novelty; Cloud computing; Path (computing); Routing (electronic design automation); Algorithm; State (computer science); Swarm intelligence; Mathematical optimization; Artificial intelligence; Theoretical computer science; Particle swarm optimization; Mathematics; Computer network","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.0003128824,0.0007791363,0.0009465083,0.0005839947,0.0005569232,0.0008567537,0.00113273,0.000873205,0.002942161],"category_scores_gemma":[0.001032715,0.0002557305,0.0005485914,0.0009814636,0.0003477519,0.00071762,0.0006794105,0.001054338,0.0006150409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004957011,"about_ca_system_score_gemma":0.001385056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004660624,"about_ca_topic_score_gemma":0.003525676,"domain_scores_codex":[0.9996333,0.0001000382,0.00001836037,0.0000776473,0.0001268424,0.0000437982],"domain_scores_gemma":[0.9997653,0.0001024475,0.00002800574,0.00002086751,0.00006693153,0.00001633897],"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.00007747239,0.00006713992,0.000406538,0.0002587684,0.00004871253,0.0001656783,0.00007256249,0.8691355,0.00337679,0.02050595,0.006161964,0.09972287],"study_design_scores_gemma":[0.0000261771,0.00003055895,0.00008276783,0.000009516018,0.000008869617,0.00007105603,0.00001778778,0.9839308,0.0005115767,0.01050239,0.004801214,0.000007211669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01702514,0.001801257,0.9623774,0.0006171128,0.0002172796,0.0002195205,0.0001975642,0.000592607,0.01695203],"genre_scores_gemma":[0.39355,0.002264715,0.5882786,0.0001713725,0.0001464469,0.0006036361,0.0006078889,0.0001934626,0.01418387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004660624,"threshold_uncertainty_score":0.009842575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009268536292438226,"score_gpt":0.2346189388027018,"score_spread":0.2253504025102636,"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."}}