{"id":"W2961079568","doi":"10.5267/j.ijiec.2019.6.002","title":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Algorithm; Simple (philosophy); Dimension (graph theory); Mathematical optimization; Computer science; Optimization problem; Optimization algorithm; Continuous optimization; Process (computing); Mathematics; Multi-swarm optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156638,0.0002359695,0.000395745,0.0009213403,0.00009448045,0.0005909222,0.001658351,0.0001479402,0.00006421501],"category_scores_gemma":[0.0009965538,0.0002348876,0.0002382932,0.0006794871,0.0000256884,0.001117218,0.0002254678,0.0004515509,0.00001324069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256272,"about_ca_system_score_gemma":0.0004399124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002432194,"about_ca_topic_score_gemma":0.000001236722,"domain_scores_codex":[0.9970833,0.00005026234,0.001043031,0.0003285091,0.001149142,0.0003457554],"domain_scores_gemma":[0.9957309,0.0008254338,0.0005910037,0.0002776929,0.002381174,0.0001938191],"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.00001397741,0.00007585101,0.00009781768,0.00001030472,0.0002748065,0.000009834542,0.0001103895,0.9702231,0.0001118496,0.003312417,0.000537629,0.02522201],"study_design_scores_gemma":[0.002246009,0.0001678234,0.00005897533,0.000103196,0.00002519277,0.00009127249,0.0000258298,0.9934305,0.0002753388,0.0006954426,0.002652824,0.000227574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001177318,0.0000950155,0.9922504,0.001253837,0.004453718,0.0005889991,0.00003389355,0.00009175763,0.00005509907],"genre_scores_gemma":[0.05551127,0.00003470882,0.942699,0.00008959315,0.001407023,0.00003833278,0.00006989983,0.00005344081,0.00009673591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05433396,"threshold_uncertainty_score":0.957844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06204859873689692,"score_gpt":0.3061649612971565,"score_spread":0.2441163625602596,"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."}}