电子学报2012，Vol.40Issue(6)：1115-1120,6.DOI:10.3969/j.issn.0372-2112.2012.06.008
均匀搜索粒子群算法的收敛性分析
The Convergence Analysis of the Uniform Search Particle Swarm Optimization
摘要
Abstract
The uniform search particle swarm optimization (UPSO) algorithm formula was tsansformed into a differential e-quation. Solving the differential equation, we get a non-recurrence location update formula, and the UPSO's convergence region for learning coefficient c and inertia coefficient w were concluded by deducing the solution convergence conditions.Finally simulation experiments were provided on the selected location of the region of convergency by 6 Benchmark functions. Experimental results show that UPSO converges when the learning coefficient and inertial coefficient are in the convergence region and diverge outside convergence region.关键词
粒子群算法/均匀搜索粒子群算法Key words
particle swarm optimization/uniform search particle swarm optimization分类
信息技术与安全科学引用本文复制引用
吴晓军,李峰,马悦,辛云宏..均匀搜索粒子群算法的收敛性分析[J].电子学报,2012,40(6):1115-1120,6.基金项目
国家自然科学基金(No.11172342) （No.11172342）
教育部“新世纪优秀人才支持计划”资助项目(No.NCET-110674) （No.NCET-110674）
陕西省自然科学基金项目(No.2012JM8043) （No.2012JM8043）
