摘要
传统粒子群算法采用整体维度更新策略,常因某一维或某几维未达到最优解,导致粒子适应值变差。针对此问题,提出具有动态子空间的随机单维变异粒子群优化算法,从优质粒子全维空间中,构造动态子空间,并随机选择异于子空间的一维进行变异。子空间大小动态变化:前期选取多数维度组成子空间,增大变异维度的多样性;后期选取少数维度组成子空间,增强粒子精细搜索的能力。同时,根据Pareto定律,使种群在前期20%迭代次数内,探索新解空间区域,后期80%迭代次数内,进行有效的平衡搜索,加快种群收敛速度。使用多类型基准测试函数,在30、50和100维下进行仿真实验,结果表明,该算法在收敛速度和精度上,不仅优于新改进的粒子群算法,而且优于新改进的人工蜂群算法和萤火虫算法。
The traditional particle swarm optimization algorithm adopts the overall dimension updating strategy,and the particles fitness value deteriorates frequently because the optimal solution is not reached in a certain dimension or a few dimensions.Aiming at this problem,a stochastic single-dimensional mutated particle swarm optimization algorithm with dynamic subspace is proposed.The dynamic subspace is constructed from the high-quality particles dimension,and one-dimension different from the subspace is randomly selected to mutate.The subspace size changes dynamically.In the early stage,most of the dimensions are used to form the subspace,which increases the diversity of the mutated dimension.Later,a few dimensions are selected to form the subspace,which enhances the ability of the particle to search fine.At the same time,according to Paretos law,the population explores the new solution space region within the first 20%iterations,and performs an effective balanced search within 80%of the iterations in the later period to accelerate the population convergence speed.Simulation experiments are carried out in 30,50 and 100 dimensions using multi-type benchmark functions.The results show that the proposed algorithm is not only superior to state of the art particle swarm optimization algorithms,but also the artificial bee colony and firefly algorithm in convergence speed and precision.
作者
邓志诚
孙辉
赵嘉
王晖
DENG Zhicheng;SUN Hui;ZHAO Jia;WANG Hui(School of Information Engineering,Nanchang Institute of Technology,Nanchang 330099,China;Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing,Nanchang 330099,China;National-Local Joint Engineering Laboratory of Water Engineering Safety and Effective Utilization of Resources in Poyang Lake Area,Nanchang 330099,China)
出处
《计算机科学与探索》
CSCD
北大核心
2020年第8期1409-1426,共18页
Journal of Frontiers of Computer Science and Technology
基金
国家自然科学基金Nos.61663029,51669014,61663028
江西省2018年度研究生创新专项资金项目No.YC2018-S422
江西省杰出青年基金项目Nos.2018ACB21029,20171BCB23075
江西省自然科学基金Nos.20192BAB207031,20171BAB202035。
作者简介
邓志诚(1995-),男,江西丰城人,南昌工程学院硕士研究生,主要研究领域为群智能算法;通信作者:孙辉(1959-),男,江西九江人,2002年于南昌大学获得博士学位,现为南昌工程学院二级教授、硕士生导师,主要研究领域为群智能算法,粗糙集,变分不等原理。E-mail:sun_hui2006@163.com;赵嘉(1981-),男,安徽桐城人,南昌工程学院教授、硕士生导师,主要研究领域为群智能算法,数据挖掘;王晖(1982-),男,湖北红安人,南昌工程学院教授、硕士生导师,主要研究领域为群智能算法,水资源优化。
