| 注册
首页|期刊导航|计算机工程与应用|改进步长与策略的果蝇优化算法

改进步长与策略的果蝇优化算法

桂龙 王爱平 丁国绅

计算机工程与应用2018,Vol.54Issue(4):148-153,184,7.
计算机工程与应用2018,Vol.54Issue(4):148-153,184,7.DOI:10.3778/j.issn.1002-8331.1609-0141

改进步长与策略的果蝇优化算法

Improved fruit fly optimization algorithm with changing step and strategy

桂龙 1王爱平 1丁国绅1

作者信息

  • 1. 安徽大学 计算机科学与技术学院,合肥230601
  • 折叠

摘要

Abstract

For the demerits of Fruit Fly Optimization Algorithm(FOA),such as easily relapsing into local optimum,slow convergence rate and low convergence precision,an improved Fruit Fly Optimization Algorithm with Changing Step and Strategy(CSSFOA)is presented.Selecting the historical optimal value randomly as a basis for step changes in a certain range, the changing flight distance of the fruit fly population dynamically can effectively balance the global and local search ability of the algorithm.To avoid falling into local optimum,a certain number of fruit flies are selected to perform variation operation when its population tends to be stable.The experimental results show that the proposed algorithm is much better than basic FOA and its several improved algorithms in convergence rate and convergence precision.

关键词

果蝇优化算法/变步长/变异/收敛精度

Key words

Fruit Fly Optimization Algorithm(FOA)/changing step/variation/convergence precision

分类

信息技术与安全科学

引用本文复制引用

桂龙,王爱平,丁国绅..改进步长与策略的果蝇优化算法[J].计算机工程与应用,2018,54(4):148-153,184,7.

基金项目

国家自然科学基金(No.61573022). (No.61573022)

计算机工程与应用

OA北大核心CSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文