基于TS模糊推理的粒子群算法
發(fā)布時(shí)間：2018-10-25 06:53
【摘要】：粒子群優(yōu)化算法(Particle Swarm Optimization PSO)是一種新興的群體智能優(yōu)化算法,具有分布式、協(xié)同合作性、自組織性和實(shí)現(xiàn)簡單等特點(diǎn),這使得該算法能夠在全局信息缺乏時(shí)能夠迅速地處理各種復(fù)雜問題,也為典型的復(fù)雜性問題的求解開辟了新的途徑,但該算法在處理高維復(fù)雜問題時(shí)仍有相當(dāng)大的可能陷入局部最優(yōu),如何通過保障Exploration和Exploitation之間的均衡來加強(qiáng)全局搜索能力,是該領(lǐng)域的研究熱點(diǎn)和難點(diǎn)。從兩個(gè)方面對(duì)PSO算法進(jìn)行了改進(jìn),其一是基于孫俊等人的量子行為粒子群優(yōu)化算法(Quantum-behaved Particle Swarm Optimization QPSO),提出了基于Takagi-Sugeno(TS)模糊推理的自適應(yīng)量子行為粒子群優(yōu)化算法(Adaptive Quantum-behaved Particle Swarm Optimization AQPSO),在慣性權(quán)重和種群多樣性上對(duì)粒子群優(yōu)化算法進(jìn)行了改進(jìn)。該算法利用群體分布和探索進(jìn)程信息,由TS模糊推理動(dòng)態(tài)地調(diào)整算法參數(shù)及其迭代方式,從而保證種群在更大的空間探索,減少陷入局部最優(yōu)的概率。其二是基于Riget等人提出的attractive and repulsive PSO(ARPSO)算法,提出了動(dòng)態(tài)地調(diào)整慣性權(quán)重的算法(Dynamic attractive and repulsive PSO DARPSO),該算法不是簡單地用線性遞減策略,而是根據(jù)粒子是收縮狀態(tài)還是擴(kuò)張狀態(tài)而動(dòng)態(tài)地調(diào)整慣性權(quán)重,同時(shí)根據(jù)TS模糊推理設(shè)計(jì)了一種新的粒子位置更新方式。若干標(biāo)準(zhǔn)測試函數(shù)仿真和威氏(Wilcoxon)符號(hào)秩檢驗(yàn)的結(jié)果顯示,AQPSO算法在處理多個(gè)局部最優(yōu)解相差較小時(shí)效果較好,而DARPSO算法在處理全局最優(yōu)解與局部最優(yōu)解相差較大的問題時(shí)效果較好。同時(shí),在處理復(fù)雜高維函數(shù)的優(yōu)化問題上,本文提出的AQPSO算法、DARPSO算法,與QPSO算法、ARPSO算法以及PSO算法相比具有更好性能。
[Abstract]:Particle swarm optimization (Particle Swarm Optimization PSO) is a new swarm intelligence optimization algorithm, which has the characteristics of distributed, cooperative, self-organizing and simple implementation. This makes it possible for the algorithm to deal with all kinds of complex problems quickly when the global information is lacking, and also opens up a new way for solving typical complex problems. However, the algorithm is still likely to fall into local optimum when dealing with high dimensional complex problems. How to enhance the global search ability by ensuring the balance between Exploration and Exploitation is a hot and difficult point in this field. The PSO algorithm is improved from two aspects. One is the quantum behavior particle swarm optimization algorithm based on Sun Jun et al. (Quantum-behaved Particle Swarm Optimization QPSO),) an adaptive quantum behavior particle swarm optimization algorithm based on Takagi-Sugeno (TS) fuzzy reasoning (Adaptive Quantum-behaved Particle Swarm Optimization AQPSO),) is proposed. Particle swarm optimization algorithm is improved. Using the information of population distribution and exploration process, the algorithm dynamically adjusts the parameters of the algorithm and its iterative method by TS fuzzy reasoning, so as to ensure the population exploration in a larger space and reduce the probability of falling into local optimum. Secondly, based on the attractive and repulsive PSO (ARPSO) algorithm proposed by Riget et al., this paper proposes a dynamic algorithm to adjust the inertia weight, (Dynamic attractive and repulsive PSO DARPSO), which is not a simple linear decrement strategy. Instead, the inertia weight is adjusted dynamically according to whether the particle is contracted or expanded, and a new updating method of particle position is designed according to TS fuzzy reasoning. The simulation results of several standard test functions and the (Wilcoxon) sign rank test show that the AQPSO algorithm is effective in dealing with multiple local optimal solutions with small differences. The DARPSO algorithm is effective in solving the problem where the global optimal solution is different from the local optimal solution. At the same time, the AQPSO algorithm, DARPSO algorithm proposed in this paper have better performance than QPSO algorithm, ARPSO algorithm and PSO algorithm in dealing with the optimization problem of complex high-dimensional function.
【學(xué)位授予單位】：青島大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP18
本文編號(hào)：2292953
[Abstract]:Particle swarm optimization (Particle Swarm Optimization PSO) is a new swarm intelligence optimization algorithm, which has the characteristics of distributed, cooperative, self-organizing and simple implementation. This makes it possible for the algorithm to deal with all kinds of complex problems quickly when the global information is lacking, and also opens up a new way for solving typical complex problems. However, the algorithm is still likely to fall into local optimum when dealing with high dimensional complex problems. How to enhance the global search ability by ensuring the balance between Exploration and Exploitation is a hot and difficult point in this field. The PSO algorithm is improved from two aspects. One is the quantum behavior particle swarm optimization algorithm based on Sun Jun et al. (Quantum-behaved Particle Swarm Optimization QPSO),) an adaptive quantum behavior particle swarm optimization algorithm based on Takagi-Sugeno (TS) fuzzy reasoning (Adaptive Quantum-behaved Particle Swarm Optimization AQPSO),) is proposed. Particle swarm optimization algorithm is improved. Using the information of population distribution and exploration process, the algorithm dynamically adjusts the parameters of the algorithm and its iterative method by TS fuzzy reasoning, so as to ensure the population exploration in a larger space and reduce the probability of falling into local optimum. Secondly, based on the attractive and repulsive PSO (ARPSO) algorithm proposed by Riget et al., this paper proposes a dynamic algorithm to adjust the inertia weight, (Dynamic attractive and repulsive PSO DARPSO), which is not a simple linear decrement strategy. Instead, the inertia weight is adjusted dynamically according to whether the particle is contracted or expanded, and a new updating method of particle position is designed according to TS fuzzy reasoning. The simulation results of several standard test functions and the (Wilcoxon) sign rank test show that the AQPSO algorithm is effective in dealing with multiple local optimal solutions with small differences. The DARPSO algorithm is effective in solving the problem where the global optimal solution is different from the local optimal solution. At the same time, the AQPSO algorithm, DARPSO algorithm proposed in this paper have better performance than QPSO algorithm, ARPSO algorithm and PSO algorithm in dealing with the optimization problem of complex high-dimensional function.
【學(xué)位授予單位】：青島大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP18
【參考文獻(xiàn)】
相關(guān)期刊論文 前9條
1 高圣國;劉升;鄭中團(tuán);;帶兩類正態(tài)變異的PSO算法[J];控制與決策;2014年10期
2 王洪峰;王娜;汪定偉;黃敏;;一種求解多峰優(yōu)化問題的改進(jìn)Species粒子群算法[J];系統(tǒng)工程學(xué)報(bào);2012年06期
3 劉軍民;高岳林;;混沌粒子群優(yōu)化算法[J];計(jì)算機(jī)應(yīng)用;2008年02期
4 李洪興;彭家寅;王加銀;侯健;張宇卓;;基于三Ⅰ算法的模糊系統(tǒng)及其響應(yīng)性能[J];系統(tǒng)科學(xué)與數(shù)學(xué);2006年05期
5 李洪興,彭家寅,王加銀;常見模糊蘊(yùn)涵算子的模糊系統(tǒng)及其響應(yīng)函數(shù)[J];控制理論與應(yīng)用;2005年03期
6 侯健,尤飛,李洪興;由三I算法構(gòu)造的一些模糊控制器及其響應(yīng)能力[J];自然科學(xué)進(jìn)展;2005年01期
7 苗東升;系統(tǒng)科學(xué)的難題與突破點(diǎn)[J];科技導(dǎo)報(bào);2000年07期
8 王國俊;模糊推理的全蘊(yùn)涵三I算法[J];中國科學(xué)E輯:技術(shù)科學(xué);1999年01期
9 李洪興;模糊控制的插值機(jī)理[J];中國科學(xué)E輯:技術(shù)科學(xué);1998年03期
相關(guān)博士學(xué)位論文 前1條
1 孫俊;量子行為粒子群優(yōu)化算法研究[D];江南大學(xué);2009年
，本文編號(hào)：2292953
本文鏈接：http://sikaile.net/kejilunwen/zidonghuakongzhilunwen/2292953.html
最近更新
教材專著
