{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006404488,0.0003113605,0.0004190296,0.0003032049,0.0001397843,0.0003448848,0.001462928,0.0001587113,0.0001486275],"category_scores_gemma":[0.0001758545,0.0003120852,0.0001529623,0.0007230495,0.00004959549,0.0003679435,0.0004509178,0.0003367606,0.00009407925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243646,"about_ca_system_score_gemma":0.0002244852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001209727,"about_ca_topic_score_gemma":0.000002957911,"domain_scores_codex":[0.9973287,0.00002984791,0.0004840111,0.0007399892,0.0006178926,0.0007995574],"domain_scores_gemma":[0.9981374,0.0002507102,0.0001026333,0.001044207,0.0001758554,0.0002892489],"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.00005654688,0.00128883,0.0007226063,0.0008574116,0.0005365413,0.0001784584,0.001679769,0.4941112,0.03688966,0.09023022,0.020707,0.3527417],"study_design_scores_gemma":[0.0005456857,0.0001832265,0.0002350501,0.00004855683,0.000007724123,0.0000344823,0.000005725972,0.9464256,0.0002395129,0.00007996101,0.05182087,0.0003736652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001007929,0.0002885838,0.9954466,0.0005583941,0.0003368127,0.001260953,0.00002853278,0.0008539401,0.00112536],"genre_scores_gemma":[0.07472306,0.00008013568,0.9235098,0.00009427631,0.0001090146,0.000499049,0.00001915493,0.00006099704,0.000904532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4523143,"threshold_uncertainty_score":0.9999331,"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."}}