国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁> 美國衛(wèi)生研究院文獻(xiàn)>Computational Intelligence and Neuroscience >PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization
【2h】

PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization

機(jī)譯：PS-FW：基于粒子群算法和煙花的全局優(yōu)化混合算法

代理獲取
本網(wǎng)站僅為用戶提供外文OA文獻(xiàn)查詢和代理獲取服務(wù)，本網(wǎng)站沒有原文。下單后我們將采用程序或人工為您竭誠獲取高質(zhì)量的原文，但由于OA文獻(xiàn)來源多樣且變更頻繁，仍可能出現(xiàn)獲取不到、文獻(xiàn)不完整或與標(biāo)題不符等情況，如果獲取不到我們將提供退款服務(wù)。請知悉。
  • 摘要
  • 著錄項
  • 相似文獻(xiàn)
  • 相關(guān)主題

摘要

Particle swarm optimization (PSO) and fireworks algorithm (FWA) are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems.
機(jī)譯：粒子群優(yōu)化（PSO）和煙火算法（FWA）是最近開發(fā)的兩種優(yōu)化方法，由于其簡單性和效率而被應(yīng)用在各個領(lǐng)域。然而，當(dāng)應(yīng)用于高維優(yōu)化問題時，由于缺乏強(qiáng)大的全局探測能力，PSO算法可能會陷入局部最優(yōu)中，并且由于某些情況下煙花爆竹算法的局部開發(fā)效率相對較低，因此難以收斂。非核心煙花。本文提出了一種稱為PS-FW的混合算法，其中將FWA的修改算子嵌入到PSO的求解過程中。在迭代過程中，采用拋棄和補(bǔ)充機(jī)制來平衡PS-FW的勘探和開發(fā)能力，并提出了改進(jìn)的爆炸算子和新穎的變異算子，以加快全局收斂速度，避免過早出現(xiàn)。為了驗證所提出的PS-FW算法的性能，已使用了22個高維基準(zhǔn)函數(shù)，并將其與PSO，F(xiàn)WA，stdPSO，CPSO，CLPSO，F(xiàn)IPS，科學(xué)怪人和ALWPSO算法進(jìn)行了比較。結(jié)果表明，PS-FW算法是一種解決全局優(yōu)化問題的高效，魯棒，快速收斂的優(yōu)化方法。

著錄項

相似文獻(xiàn)

  • 外文文獻(xiàn)
  • 中文文獻(xiàn)
  • 專利
代理獲取

客服郵箱：kefu@zhangqiaokeyan.com

京公網(wǎng)安備：11010802029741號 ICP備案號：京ICP備15016152號-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有

  • 客服微信

  • 服務(wù)號