中国电机工程学报2013，Vol.33Issue(1)：99-108,前插13,11.
求解机组组合问题的次超立方紧混合整数规划广义割平面法
A Sub Hyper-cube Tight Mixed Integer Programming Extended Cutting Plane Method for Unit Commitment
摘要
Abstract
In order to improve the efficiency of solving unit commitment (UC) problem, a novel sub hyper-cube mixed integer programming (SHC-MIP) model of the ramp rate constrained UC problem is presented by using the technique of hyper-cube (HC) projection, and a new deterministic method is presented for solving UC problem based on the proposed model and extended cutting plane (ECP) method. Named as SHC-MIP-ECP, the proposed method involves reformulating the UC problem into a tight SHC-MIP model with HC projection, and applying ECP method to solve SHC-MIP by a sequence of mixed integer linear programming. The simulation results for 7 systems that range in size from 10 to 100 units and 24 hours show that the SHC-MIP model can get better sub-optimal solutions of the UC problem than the traditional mixed integer programming (MIP) when ECP method is used, and the proposed method is very promising for large scale UC problems due to its excellent performance and results.关键词
机组组合/爬坡约束/超立方投影/混合整数规划/广义割平面Key words
unit commitment (UC)/ ramp rate constraints/ hyper-cube projection/ mixed integer programming/ extended cutting plane分类
信息技术与安全科学引用本文复制引用
杨林峰,简金宝,郑海艳,韩道兰..求解机组组合问题的次超立方紧混合整数规划广义割平面法[J].中国电机工程学报,2013,33(1):99-108,前插13,11.基金项目
国家自然科学基金项目(71061002) （71061002）
广西自然科学基金项目(2011GXNSFD018022) （2011GXNSFD018022）
广西高校人才小高地创新团队资助计划. （）
