摘要
本文提出一种电力系统主动解列断面的优化搜索方法,以多层图分割理论为框架,通过粗化、初始分区和还原优化3个阶段实现解列断面的快速搜索。结合粗化阶段信息,在还原优化阶段提出一种基于寻优和校验的优化搜索策略,依次进行寻求目标最优解和连通性校验两个过程,借此替代含复杂逻辑约束0-1规划问题的求解,在提高求解效率的同时具有更高的可靠性和可扩展性。为提高拓扑连通性校验效率,提出一种最小化校验子图的构造方法。最后通过两个算例验证了本文方法的有效性。
In this paper,an optimal searching method for the controlled splitting surface in power system is proposedwithin the framework of multi-level graph partitioning theory. Three stages including coarsening,initial partitioning andrefinement are utilized to achieve a rapid search for the splitting surface. Combined with the information in the coarsen-ing stage,an optimal searching strategy is proposed in the refinement stage based on optimal searching and verifying in-stead of the 0-1 programming with complex logical constraints. With this strategy,optimizing and connectivity-verifyingprocesses are executed sequentially to achieve higher reliability and better extensibility while improving the solving effi-ciency. To improve the efficiency in verifying the topology connectivity,a construction method for a minimum sub-graphfor verification is proposed. Finally,two numerical examples are used to illustrate the effectiveness of the proposedmethod.
作者
苗伟威
雷鸣
廖大鹏
刘军
姜涛
MIAO Weiwei LEI Ming LIAO Dapeng LIU Jun JIANG Tao(Dispatch and Control Center, State Grid Shandong Electric Power Company, Jinan 250001, China School of Electrical and Information Engineering, Tianjin University, Tianjin 300072, China)
出处
《电力系统及其自动化学报》
CSCD
北大核心
2017年第9期122-128,共7页
Proceedings of the CSU-EPSA
关键词
多层图分割
电力系统主动解列
最小化校验子图
拓扑连通性
multi-level graph partitioning
power system controlled splitting
minimum sub-graph for verification
topology connectivity
