首页> 外文会议>International Joint Conference on Neural Networks >Orthogonal PSO algorithm for optimal dispatch of power of large-scale thermal generating units in smart power grid under power grid constraints
【24h】

Orthogonal PSO algorithm for optimal dispatch of power of large-scale thermal generating units in smart power grid under power grid constraints

机译:正交PSO算法在电网约束下智能电网中大型火电机组的最优功率分配

获取原文

摘要

We propose a novel approach called, an orthogonal particle swarm optimization (OPSO) algorithm, for economic dispatch (ED) of thermal generating units (TGUs) in smart electric power gird (SEPG) environment. The characteristics of TGUs are nonlinear and the generation system becomes more and more complicated when these TGUs are subjected to ramp rate constraints and prohibited operating zones. In such case, the cost functions become non-smooth and non-convex due to the discontinuities in the cost curves. Moreover, for large-scale TGUs, the high dimensions used in ED problem become a big challenge to find global minimum and to avoid falling into local minima. The proposed OPSO algorithm has the ability to solve such complex problems including ED. The OPSO algorithm applies an orthogonal diagonalization process. It makes d particles (out of total m particles, m ≥ d) that have the possible solutions by constructing orthogonal vectors in the d-dimensional search space. These orthogonal vectors are generated and updated in each iteration and are utilized to guide the d particles to fly in one direction toward global minimum. The OPSO algorithm is evaluated and tested through 40 TGUs and its performance is compared with several other optimization methods. We found that the OPSO algorithm provides better results in term of cost under power grid constraints. Furthermore, we have shown that the OPSO algorithm significantly improves the PSO algorithm in terms of high solution quality, robustness and convergence.
机译:我们提出了一种称为正交粒子群优化(OPSO)算法的新颖方法,用于智能电网(SEPG)环境中的火力发电单元(TGU)的经济调度(ED)。 TGU的特性是非线性的,并且当这些TGU受到斜坡速率限制和禁止的操作区域时,发电系统变得越来越复杂。在这种情况下,由于成本曲线的不连续性,成本函数变得不平滑且不凸。此外,对于大规模的TGU,ED问题中使用的高维数成为寻找全局最小值并避免陷入局部最小值的一项巨大挑战。所提出的OPSO算法具有解决诸如ED之类的复杂问题的能力。 OPSO算法应用正交对角化过程。通过在d维搜索空间中构造正交向量,可以使d个粒子(在m个粒子总数中,m≥d)具有可能的解决方案。这些正交向量在每次迭代中生成和更新,并用于引导d粒子在一个方向上向全局最小值飞行。通过40个TGU对OPSO算法进行了评估和测试,并将其性能与其他几种优化方法进行了比较。我们发现,在电网约束下,OPSO算法在成本方面提供了更好的结果。此外,我们已经证明,OPSO算法在高解决方案质量,鲁棒性和收敛性方面显着改进了PSO算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号