期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 29, 期 2, 页码 505-513出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2013.2253136
关键词
Inner approximation; mixed-integer linear programming; outer approximation; separable model; unit commitment
资金
- National Natural Science Foundation of China [71061002]
- Guangxi Natural Science Foundation [2013GXNSFBA019017, 2011GXNSFD018022]
- Innovation Group of Talents Highland of Guangxi Higher School
- Foundation of Guangxi University for Nationalities [2011MDYB035]
This paper proposes a new separable model for the unit commitment (UC) problem and three deterministic global optimization methods for it ensuring convergence to the global optimum within a desired tolerance. By decomposing a multivariate function into several univariate functions, a tighter outer approximation methodology that can be used to improve the outer approximations of several classical convex programming techniques is presented. Based on the idea of the outer approximation (OA) method and the proposed separable model, an outer-inner approximation (OIA) approach is also presented to solve this new formulation of UC problem. In this OIA approach, the UC problem is decomposed into a tighter outer approximation subproblem and an inner approximation subproblem, where the former leads to a better lower bound than the OA method, and the later provides a better upper bound. The simulation results for systems of up to 100 units with 24 h are compared with those of previously published methods, which show that the OIA approach is very promising due to the excellent performance. The proposed approaches are also applied to the large-scale systems of up to 1000 units with 24 h, and systems of up to 100 units with 96 h and 168 h.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据