多峰函數(shù)優(yōu)化的黃金分割斐波那契樹優(yōu)化算法
發(fā)布時(shí)間:2018-07-10 01:37
本文選題:多峰優(yōu)化 + 斐波那契樹優(yōu)化算法; 參考:《電子學(xué)報(bào)》2017年04期
【摘要】:針對(duì)多峰函數(shù)優(yōu)化問題,基于斐波那契樹優(yōu)化算法,結(jié)合黃金分割思想,提出一種黃金分割斐波那契樹優(yōu)化算法.該算法利用斐波那契樹優(yōu)化算法全局局部交替尋優(yōu)特性,通過在尋優(yōu)過程中對(duì)優(yōu)化問題解空間進(jìn)行黃金分割比例壓縮,從而提高算法局部搜索能力與小峰值搜索能力.多峰函數(shù)優(yōu)化的仿真結(jié)果表明,該算法多峰優(yōu)化能力強(qiáng)、速度快、精度高.
[Abstract]:For multi peak function optimization problem, a golden split Fibonacci tree optimization algorithm is proposed based on Fibonacci tree optimization and gold segmentation. The algorithm uses the Fibonacci tree optimization algorithm to optimize the global local optimization characteristics, and through the optimization of optimal solution space for gold segmentation in proportion to the optimization problem. The simulation results of multimodal function optimization show that the algorithm has high multimodal capability, high speed and high precision.
【作者單位】: 云南大學(xué)信息學(xué)院;
【基金】:國家自然科學(xué)基金(No.61261007) 云南省自然科學(xué)基金重點(diǎn)項(xiàng)目(No.2013FA008) 云南省科技廳(No.2013FB048)
【分類號(hào)】:TP18
,
本文編號(hào):2111515
本文鏈接:http://sikaile.net/kejilunwen/zidonghuakongzhilunwen/2111515.html
最近更新
教材專著