基于维度分区的果蝇优化新算法-计算机科学.PDFVIP

Vo 1. 43 No. 12 第 43 卷第12 期 计算机科学 2016 年 12 月 Computer Science Dec 2016 基于维度分区的果蝇优化新算法 王友卫1 凤丽如w 朱建明1 (中央财经大学信息学院 北京 100081) 1 (吉林大学计算机科学与技术学院 长春 130012)2 摘 要 为提高采蝇算法的收敛稳定性，提出了一种基于维度分区的采蝇优化新算法。将采蝇种群均分为两纽:跟随 采蝇和搜索采蝇。跟随采蝇在全局最优采蝇附近实现精细化局部搜索，而搜索采蝇则将位置向量的每个维度搜索范 围划分为若干个区间，通过比较各个区间的最优位置来更新采蝇位置。为加快算法收敛速度，若某搜索采蝇在连续若 干次迭代过程中均表现最差，则在当前最优采蝇位置附近产生该采蝇的新位置。针对8 种典型函数的仿真实验表明: 与传统算法相比，所提算法所需参数较少，收敛稳定性高，并且在收敛精度及收敛速度等方面具有明显优势。 关键词 采蝇算法，收敛稳定性，维度分区，全局最优采蝇，收敛精度 中圄法分类号 TP30 1. 6 文献标识码 A DOI 10. 11896/j. issn. 1002-137X. 2016. 12.048 Novel Fruit Fly Optimization Algorithm ßased on Dimension Partition WANG You-wei1 FENG Li-zhou2 ZHU Jian-ming1 (School of Information ,Central University of Finance and Economics ,Beijing 100081 ,China) 1 (College of Computer Science and Technology ,Jilin University ,Changchun 130012 ,China) 2 Abstract In order to improve the convergence stability of fruit fly algorithm ,a novel dimension partition based fruit fly optimization algorithm was proposed. The fruit fly population is divided into two groups: the following fruit flies and the searching fruit flies. A following fruit fly realizes the accurate local searching near the global best fruit fly ,and a sear- ching fruit fly divides each searching dimension of the position vector into several partitions and updates its position by comparing the performances of all partitions. In order to improve the convergence speed ,if a searching fruit fly performs worst during several iterations ,its new position will be generated near the g