| 基于PSO的确定性问题优化研究 |
| |
| 引用本文： | 王冬菊.基于PSO的确定性问题优化研究[J].数字社区&智能家居,2007,1(2):1027-1027,1030. |
| |
| 作者姓名： | 王冬菊 |
| |
| 作者单位： | 安徽师范大学电子系,安徽芜湖241000 |
| |
| 基金项目： | 安徽省原子与物理重点学科资助,项目编号：200605. |
| |
| 摘 要： | 粒子群算法原理简单，易于实现，是进化算法中优化效率很高的算法。针对确定环境下的问题优化，提出采用粒子群算法对其进行优化求解。通过对确定性环境下的Benchmark函数的算法仿真研究，表明粒子群算法在确定性问题优化中具有快速收敛性和精确性的特点。
|
| 关 键 词： | 粒子群算法 确定性问题 优化 |
| 文章编号： | 1009-3044（2007）04-11027-01 |
| 修稿时间： | 2006-12-24 |
Study on certain problems optimization based on particle swarm optimization |
| |
| WANG Dong-ju.Study on certain problems optimization based on particle swarm optimization[J].Digital Community & Smart Home,2007,1(2):1027-1027,1030. |
| |
| Authors: | WANG Dong-ju |
| |
| Affiliation: | Department of electronics, Anhui Normal University, Wuhu 241000,China |
| |
| Abstract: | Particle swarm optimization (PSO) is an effective algorithm in optimization fields, which is easily programmed with simple principle. It is proposed to optimize the problems under certain environments based on particle swarm algorithms. Numerical simulations show PSO has the character of remarkable higher speed of convergence and satisfying precision. |
| |
| Keywords: | particle swarm optimization (PSO) certain problem optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
