检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张航 杨靖[1] ZHANG Hang;YANG Jing(The Electrical Engineering College,Guizhou University,Guiyang 550025,China)
出 处:《智能计算机与应用》2021年第2期145-148,154,共5页Intelligent Computer and Applications
摘 要:针对传统鸡群优化算法存在求解精度偏低、局部搜索能力弱等问题,提出了一种改进的鸡群优化算法。改进算法选择利用动态簇解决单一工作节点能力有限问题,提出一种基于网格的序列鸡群算法,优化标准鸡群算法的种群分组更新机制,仿真和实验结果表明该算法相比传统算法具有定位精度高、收敛速度快、实时性好等优点。Aiming at the problems of low accuracy and weak local search ability in traditional chicken flock optimization algorithms,an improved chicken flock optimization algorithm is proposed.Improved algorithm selection uses dynamic clusters to solve the problem of limited capacity of a single working node.A grid-based sequential chicken flock algorithm is proposed to optimize the population grouping update mechanism of the standard chicken flock algorithm.Simulation and experimental results show that compared with traditional algorithms,this algorithm has the advantages of high positioning accuracy,fast convergence speed and good real-time performance.
分 类 号:TP312[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7