南方电网技术2024，Vol.18Issue(11)：48-57,78,11.DOI:10.13648/j.cnki.issn1674-0629.2024.11.006
应用于加速安全约束机组组合问题的K最邻近算法
K-Nearest Neighbor Algorithm Applied to Accelerate Security Constrained Unit Commitment Problem
摘要
Abstract
With the expansion of power grid scale and the higher requirements of security,the difficulty in solving the security constrained unit commitment(SCUC)is increasing.Aiming at the characteristics of constraints of active power over transmission lines and 0-1 on/off integer variables in the SCUC,two prediction methods are constructed based on improved K-nearest neighbor algorithm,which are used to identify the active transmission power constraints and determine the values of partial integer variables respectively.At the same time,considering the influence of load parameters on the values of integer variables,the action interval of the integer variables is limited to improve the prediction accuracy.Before solving the problem,two forecasting methods can quickly predict the active transmission power constraints and the values of partial integer variables.Using this information,a simplified SCUC model can be built,and then the optimization solver can be used to solve the model directly,shortening the solution time of the SCUC.Finally,the correctness and effectiveness of the proposed method are verified by the standard test system and an actual provincial grid data.关键词
安全约束机组组合/传输功率约束/混合整数线性规划/K最邻近算法Key words
security constrained unit commitment/transmission power constraints/mixed-integer linear programming/K-nearest neighbor algorithm分类
动力与电气工程引用本文复制引用
陈子瑞,刘明波,曾贵华,谢敏,林舜江..应用于加速安全约束机组组合问题的K最邻近算法[J].南方电网技术,2024,18(11):48-57,78,11.基金项目
国家自然科学基金资助项目(52077083). Supported by the National Natural Science Foundation of China(52077083). （52077083）
