检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭庆[1] 惠晓滨[1] 张贾奎 李正欣[1] GUO Qing, HUI Xiaobin , ZHANG Jiakui, LI Zhengxin(Equipment Management and Safety Engineering College, Air Foree Engineering University, Xi'an 710051, Chin)
机构地区:[1]空军工程大学装备管理与安全工程学院,西安710051
出 处:《北京航空航天大学学报》2018年第4期828-840,共13页Journal of Beijing University of Aeronautics and Astronautics
基 金:国家自然科学基金(61502521)~~
摘 要:为了探讨花朵授粉算法(FPA)在解算多模函数优化问题中存在的不足,通过定义种群多样性及差异性指标,定性分析了FPA在多模复杂函数优化中的寻优缺点。基于模拟退火思想优化全局授粉过程,并利用Nelder-Mead单纯形搜索技术对花朵局部授粉进行重构,提出一种新的花朵授粉寻优架构。仿真结果表明,相对于基本的FPA、布谷鸟算法、萤火虫算法,改进花朵授粉算法能够有效避免陷入局部最优,具备优异的全局勘探和局部开采能力,对多模优化问题具有一定优势。In order to discuss the defects of flower pollination algorithm(FPA)in solving multimodal optimization problems,the optimal disadvantages of flower pollination algorithm in multimodal function optimization were qualitatively analyzed by defining population diversity and difference index.And then a new framework of FPA was constructed by optimizing the global pollination process based on the simulated annealing idea and using Nelder-Mead simplex search method to reconstruct the local pollination process.The simulation results show that the improved flower pollination algorithm can effectively avoid falling into local optimum and has better global exploration and local exploitation abilities,which has advantages to solve multimodal function optimization,compared with primary flower pollination algorithm,cuckoo search algorithm and firefly algorithm.
关 键 词:花朵授粉算法(FPA) 模拟退火 Nelder-Mead单纯形法 多模函数优化
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229