首页> 中文期刊> 《电力系统及其自动化学报》 >带连通性约束的蚁群优化算法主动解列断面求解策略

带连通性约束的蚁群优化算法主动解列断面求解策略

         

摘要

Traditional controlled splitting strategies face two problems:one is high complexity of the solution process, the other is that there may exist isolated generator nodes during the process without considering connectivity. Therefore, an improved ant colony optimization algorithm is proposed in this paper. Firstly,a mathematic model of controlled split⁃ting surface searching is established. Then,the above model is mapped to ant colony optimization algorithm with single objective function and multiple constraints. Finally,based on the connectivity constraint,the optimal controlled island⁃ing surface can be obtained. Simulation results of IEEE 118-node system and a certain power grid verify the effective⁃ness and rapidity of the proposed method.%传统解列算法在实际系统断面搜索过程中面临两个难题:一是求解复杂度很高,属于NP难题;二是求解过程未考虑连通性,可能出现孤立发电机节点。因此,该文提出了一种带连通性约束的蚁群优化算法主动解列断面求解策略。该策略首先构建了主动解列的数学模型,然后将上述模型映射到具有单目标函数多约束条件的蚁群算法中,最后在充分保证连通性约束的基础上对该模型进行优化求解,获取具有最佳目标函数的解列断面。IEEE-118节点系统和某实际电网的仿真结果验证了文中所提方法的有效性与快速性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号