计算机应用与软件2016，Vol.33Issue(11)：221-225,5.DOI:10.3969/j.issn.1000-386x.2016.11.052
动态搜索半径的果蝇优化算法
FRUIT FLY OPTIMIZATION ALGORITHM WITH DYNAMIC SEARCH RADIUS
摘要
Abstract
Considering the problems that the fixed-scale search radius in conventional fruit fly optimisation algorithm (FOA)causes weak local optimisation performance in algorithm’s later-stage and slow convergence,we propose a fruit fly optimisation algorithm with dynamic search radius (DSR-FOA).In its early-stage the algorithm ensures global optimisation performance by a greater search radius,while in later-stage its radius declines dynamically along with the iterations increasing for having better local optimisation performance.This improvement a-chieves the equilibrium between global and local optimisations effectively.Moreover,in light of the problem of conventional FOA that it is un-suitable for the interval setting of optimised variables,we present an effectual interval-set method which is based on the techniques including setting initial search radius and translation transformation.Numerical experimental results show that the DSR-FOA algorithm has better optimi-sation precision and smaller prediction standard deviation,which verifies the effectiveness and feasibility of the improved algorithm.关键词
果蝇优化算法/搜索半径/平移变换/基准测试函数Key words
Fruit fly optimisation algorithm/Search radius/Translation transformation/Benchmark testing function分类
信息技术与安全科学引用本文复制引用
高雷阜,赵世杰,徒君,于冬梅..动态搜索半径的果蝇优化算法[J].计算机应用与软件,2016,33(11):221-225,5.基金项目
教育部高等学校博士学科点专项科研基金联合项目（20132121110009）；辽宁省教育厅基金项目（L2015208）。 （）
