吉林大学学报（理学版）2019，Vol.57Issue(3)：607-612,6.DOI:10.13413／j.cnki.jdxblxb.2018235
基于自适应动态重组和极值扰动的人工蜂群算法
ArtificialBeeColonyAlgorithm BasedonAdaptive DynamicReconfigurationandExtremum Disturbance
摘要
Abstract
Aimingattheproblemsofweakoptimizationabilityandslowconvergencespeedofartificial beecolonyalgorithm,weproposedanartificialbeecolonyalgorithm based onadaptivedynamic reconfigurationand extremum disturbance.First,weintroduced chaos optimization operatorto generateinitialsolutionsandcarryoutadaptivedynamicreconfigurationaccordingtothecontribution of hired bees. Then, we introduced extremum disturbance operator to implement random perturbationtotheindividualextremevalueandglobaloptimalvalueofhiredbees.Theexperimental resultsshowthatthealgorithmincreasesthediversityofthepopulation,acceleratesthespeedof convergence,andimprovestheevolutionaryabilityofpopulation.关键词
人工蜂群算法/混沌优化算子/贡献度/自适应动态重组/极值扰动Key words
artificialbeecolony(ABC)algorithm/chaosoptimizationoperator/contribution/adaptive dynamicreconfiguration/extremumdisturbance分类
信息技术与安全科学引用本文复制引用
倪红梅,刘永建,李盼池..基于自适应动态重组和极值扰动的人工蜂群算法[J].吉林大学学报（理学版）,2019,57(3):607-612,6.基金项目
国家自然科学基金(批准号:61170132)、国家科技重大专项基金(批准号:2016ZX05012-001)和东北石油大学培育基金(批准号:NEPUPY120224). （批准号:61170132）
