粒子群优化算法在求解平面选址问题中的应用研究

Application of particle swarm optimization algorithm in solving planar location problem

平面选址问题实质上是带约束的非线性连续函数优化问题。给出了用粒子群优化算法求解平面选址问题的过程描述,分析了算法的时间复杂度。该算法具有易克服局部最优和容易处理约束等优点,不需要进行特殊的编码和译码设计,算法实现简单。应用算例表明该算法是有效的,可以应用于类似优化问题的求解。

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.