| 粒子群优化算法在求解平面选址问题中的应用研究 |
| |
| 引用本文： | 袁和金,王翠茹. 粒子群优化算法在求解平面选址问题中的应用研究[J]. 华北电力大学学报(自然科学版), 2004, 31(4): 93-97 |
| |
| 作者姓名： | 袁和金 王翠茹 |
| |
| 作者单位： | 华北电力大学,计算机科学与技术学院,河北,保定,071003;华北电力大学,计算机科学与技术学院,河北,保定,071003 |
| |
| 摘 要： | 平面选址问题实质上是带约束的非线性连续函数优化问题。给出了用粒子群优化算法求解平面选址问题的过程描述,分析了算法的时间复杂度。该算法具有易克服局部最优和容易处理约束等优点,不需要进行特殊的编码和译码设计,算法实现简单。应用算例表明该算法是有效的,可以应用于类似优化问题的求解。
|
| 关 键 词： | 平面选址问题 粒子群优化算法 进化计算 |
| 文章编号： | 1007-2691(2004)04-0093-05 |
| 修稿时间： | 2004-03-09 |
Application of particle swarm optimization algorithm in solving planar location problem |
| |
| YUAN He-jin,WANG Cui-ru. Application of particle swarm optimization algorithm in solving planar location problem[J]. Journal of North China Electric Power University, 2004, 31(4): 93-97 |
| |
| Authors: | YUAN He-jin WANG Cui-ru |
| |
| Abstract: | The essential of planar location issue is nonlinear continuous function optimization under constrained condition. This paper examines the general planar location problem and offers a particle swarm optimization algorithmtosolve it. This algorithm has the advantages thatprocessing constrained conditions are easyand the local optimization problem is easy to overcome. The time complexity of the algorithm is analyzed. The special coding and decoding design are not required. Numerical results show that the algorithm is efficient. |
| |
| Keywords: | location problem in the plane particle swarm optimization evolutionary computation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
