%0 Journal Article
%T 一种求解机组组合问题的分支定界方法<br>A Branch and Bound Method for Solving Unit Commitment Problem
%A 张志强
%A 全然
%J Journal of Electrical Engineering
%P 10-17
%@ 2333-5424
%D 2025
%I Hans Publishing
%R 10.12677/jee.2025.131002
%X 文章提出一种求解机组组合问题的分支定界方法。利用热率和透视割平面将机组组合模型做近似线性化处理&#65292;将混合整数二次规划转化为混合整数线性规划进行求解。为提高分支定界的计算效率&#65292;进行上层变量固定并优先搜索机组启停状态最接近0.5的节点。数值结果表明&#65292;此法与直接求解混合整数二次规划的发电费用相当&#65292;但计算时间占优&#65292;适合求解大规模机组组合问题。<br>This paper presents a branch and bound method for solving the unit commitment (UC) problem. The UC model is approximated to linear models by using the heat rate and perspective cutting plane, and the mixed integer quadratic programming model is transformed into mixed integer linear programming. In order to improve the computing efficiency of the branch and bound, the upper-level variables are fixed and the node closest to the value of 0.5 is searched first. Numerical results show that the generation costs by the proposed method are almost equivalent to the ones by directly solving the mixed integer quadratic programming of UC. However, the proposed method has an advantage in terms of computation time and is suitable for solving large-scale UC problems.
%K 机组组合&#65292
%K 分支定界&#65292
%K 热率&#65292
%K 透视割平面<br>Unit Commitment
%K Branch and Bound
%K Heat Rate
%K Perspective Cutting Plane
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=109904