求解含风电场机组组合问题的透视割平面邻域搜索算法  

A perspective cut neighborhood search method for unit commitment with volatile wind power

作　　者：全然[1] 张健 史志鸿 QUAN Ran ZHANG Jian SHI Zhihong(College of Science, Henan University of Technology, Zhengzhou 450001, China Xichuan Electric Power Company, Nanyang 474450, China XJ Electric Co., Ltd., Xuchang 461000, China)

机构地区：[1]河南工业大学理学院,河南郑州450001 [2]河南省淅川电力公司,河南南阳474450 [3]许继电气股份有限公司,河南许昌461000

出　　处：《电力系统保护与控制》2017年第14期26-31,共6页Power System Protection and Control

基　　金：国家自然科学基金项目(71201049;51407037)~~

摘　　要：提出一种求解含风电场机组组合(Unit Commitment,UC)问题的透视割平面邻域搜索(Perspective Cut Neighborhood Search,PC-NS)算法。基于PC建立了含风电场UC问题的混合整数线性规划模型。以不考虑误差场景UC问题的最优解为中心构造邻域,在此邻域内搜索以获得含风电场UC问题的可行解。以此可行解为中心构造邻域,在此邻域内搜索以获得含风电场UC问题高质量的次优解。最后进行数值仿真,结果表明,所提算法能有效求解含风电场UC问题。和其他方法相比,PC-NS算法获得了更好的次优解,而且用时大大减少。A perspective cut neighborhood search（PC-NS） method is proposed for unit commitment（UC） with volatile wind power. Firstly, a mixed integer linear programming formulation based on PC is presented for UC with wind power. Then, a neighborhood is built on the solution of UC without considering wind power to find the feasible solution of UC with wind power. After that, based on the feasible solution, another neighborhood is constructed to get high-quality sub-optimal solutions for UC with wind power. At last, the proposed method is tested and the numerical results indicate that the PC-NS is efficient for solving UC with wind power. When compared with other methods, the presented PC-NS can yield better sub-optimal solutions and the running time can be greatly reduced.

关 键 词：风电场 机组组合问题 透视割平面 邻域搜索 

分 类 号：TM614[电气工程—电力系统及自动化]