{"id":"W4255726574","doi":"10.32920/ryerson.14647050","title":"Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Meta-optimization; Metaheuristic; Imperialist competitive algorithm; Multi-swarm optimization; Derivative-free optimization; Algorithm; Mathematical optimization; Hybrid algorithm (constraint satisfaction); Computer science; Optimization problem; Particle swarm optimization; Test functions for optimization; Continuous optimization; Benchmark (surveying); Convergence (economics); Bees algorithm; Cuckoo search; Ant colony optimization algorithms; Mathematics; Artificial intelligence; Probabilistic logic; Constraint satisfaction","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.0008636926,0.0009388672,0.0007856278,0.0009346237,0.0004265779,0.001132778,0.001157108,0.001169538,0.002738956],"category_scores_gemma":[0.00137212,0.0004109626,0.00112637,0.0008598616,0.000456105,0.000765695,0.0006962609,0.0008653055,0.0007930652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008765612,"about_ca_system_score_gemma":0.001037927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005593099,"about_ca_topic_score_gemma":0.003689766,"domain_scores_codex":[0.9996819,0.0000985499,0.00002008368,0.00005101776,0.0001164718,0.00003190546],"domain_scores_gemma":[0.9996001,0.0002126969,0.00004562835,0.00002685613,0.0001028767,0.00001189277],"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.00002539154,0.00002221194,0.0004907376,0.00008416197,0.00005129941,0.0000340874,0.0000311992,0.9529837,0.0009600275,0.01322892,0.0008251586,0.0312631],"study_design_scores_gemma":[0.000002704278,0.000008780975,0.0000415662,0.000006142761,0.00000389643,0.000005942916,0.000002164153,0.9978968,0.0001652087,0.001140312,0.0007241227,0.000002354742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008967975,0.0008003214,0.98058,0.0001393935,0.0000743344,0.00006969664,0.00005436803,0.0004259938,0.008887868],"genre_scores_gemma":[0.5392398,0.001541418,0.4417317,0.0001960568,0.00009851601,0.0008736184,0.0004108755,0.0002788171,0.01562912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005593099,"threshold_uncertainty_score":0.01112109,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04353849727071869,"score_gpt":0.2966537671727526,"score_spread":0.2531152699020339,"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."}}