检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄霞[1,2] 叶春明 郑军[1] HUANG Xia;YE Chunming;ZHENG Jun(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China;Jiangsu University of Science and Technology,Zhangjiagang,Jiangsu 215600,China)
机构地区:[1]上海理工大学管理学院,上海200093 [2]江苏科技大学张家港校区,江苏张家港215600
出 处:《计算机工程与应用》2018年第7期176-181,共6页Computer Engineering and Applications
基 金:国家自然科学基金(No.71271138);上海理工大学科技发展项目(No.16KJFZ028);上海市高原学科项目"管理科学与工程"(No.GYXK1201);江苏省现教课题(No.48888);江苏高等教育科学研究"十三五"规划课题(No.16YB064)
摘 要:针对鸡群算法易陷入局部最优和出现早熟收敛的情况,提出一种混合改进搜索策略的鸡群优化算法。该算法通过种内和种间竞争,确定子群规模及等级次序,子群角色通过竞争繁殖进行动态更新。种群进化寻优中引入全局最优引导策略和动态惯性策略,个体的寻食学习通过动态惯性策略进行自我调整,并同时接受子群与种群中的最优个体引导,以平衡局部搜索和全局搜索之间的关系。仿真实验结果表明,与基本鸡群算法和粒子群算法等相比,改进后的鸡群算法能有效提高算法的收敛精度和收敛速度。Considering the problem that the original chicken swarm optimization algorithm is easy to fall into local optimum and becomes premature convergence,a chicken swarm optimization of hybrid evolutionary searching strategy is proposed.In this algorithm,subgroup size and hierarchy order are determined by interspecific and intraspecific competition,and subgroup roles are dynamically updated by competitive breeding.The global optimal guidance strategy and dynamic inertia strategy are introduced into the evolution optimization of population.Individual learning in search of food is adjusted through dynamic inertia strategy and guided by the optimal individual of the subgroup and populations,in order to balance the relationship between the global search and local search.The simulated experimental results show that the proposed algorithm is able to effectively improve the convergence speed and convergence precision compared with particle swarm optimization and original chicken swarm optimization.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.229.189