{"id":"W2060355705","doi":"10.1504/ijica.2011.039593","title":"Particle swarm optimisation with simple and efficient neighbourhood search strategies","year":2011,"lang":"en","type":"article","venue":"International Journal of Innovative Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Particle swarm optimization; Neighbourhood (mathematics); Computer science; Locality; Mathematical optimization; Benchmark (surveying); Simple (philosophy); Local search (optimization); Swarm behaviour; Algorithm; Artificial intelligence; 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.0005485378,0.00008683933,0.0001153769,0.0001903596,0.0001232691,0.0002477506,0.0004246854,0.00002210597,0.0000128293],"category_scores_gemma":[0.00005260975,0.00006903146,0.00001409907,0.0005678262,0.0001272758,0.0002654277,0.0001789568,0.0001705821,0.000002153344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002996412,"about_ca_system_score_gemma":0.0001473878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001554716,"about_ca_topic_score_gemma":4.368336e-7,"domain_scores_codex":[0.9988676,0.00005705642,0.0003463899,0.0001786417,0.0004177269,0.0001325271],"domain_scores_gemma":[0.9973406,0.000148076,0.0002455075,0.0001221772,0.00206213,0.00008147824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005543547,0.0003750889,0.006311999,0.00001561932,0.0002104463,0.00002380845,0.004962042,0.02804546,0.0006528731,0.7207953,0.00003413251,0.2385178],"study_design_scores_gemma":[0.00150676,0.000399875,0.04384502,0.00006779237,0.00001093031,0.0004012351,0.00200014,0.9364706,0.00857255,0.005935526,0.0005270136,0.0002626177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213248,0.00005750351,0.877114,0.000431649,0.0000378234,0.0001133718,0.000002229274,0.00001865044,0.0009000017],"genre_scores_gemma":[0.8419948,0.00001942794,0.1578328,0.00006148968,0.0000712625,0.000004366155,0.000001722341,0.000004900568,0.00000931145],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9084251,"threshold_uncertainty_score":0.2815021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03848668812058931,"score_gpt":0.3250332525350805,"score_spread":0.2865465644144912,"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."}}