CAJ | 학술논문

提出一种求解机组组合（unit commitment，UC）问题的改进优先顺序法。利用机组的最小平均煤耗成本，建立UC问题一个新的整数线性规划模型（integer linear programming，ILP），从而将UC问题分解为一个仅含0、1变量的ILP问题和一个二次规划问题，减小了UC问题的规模和求解难度。利用ILP连续松弛问题的最优解，提出一种求解UC问题的改进优先顺序法。数值结果表明，所建ILP模型合理有效，所提方法具有良好的收敛性，和其他优先顺序法相比，获得了更好的数值结果。
제출일충구해궤조조합（unit commitment，UC）문제적개진우선순서법。이용궤조적최소평균매모성본，건립UC문제일개신적정수선성규화모형（integer linear programming，ILP），종이장UC문제분해위일개부함0、1변량적ILP문제화일개이차규화문제，감소료UC문제적규모화구해난도。이용ILP련속송이문제적최우해，제출일충구해UC문제적개진우선순서법。수치결과표명，소건ILP모형합리유효，소제방법구유량호적수렴성，화기타우선순서법상비，획득료경호적수치결과。
This paper proposes an improved priority list(IPL)approach for unit commitment(UC)problem. A new integer linear programming(ILP)is built by making use of the minimal cost per produced unit of a generating unit. As a result,the UC problem is decomposed into a 0,1 ILP and a quadratic programming,which can decrease the scale and solution burden of the UC. An IPL method is proposed to solve UC based on the optimal solution of the continuous relaxation of ILP. The numerical results indicate that the ILP built is reasonable and effective. Moreover , the presented method has nice convergence and obtains better solutions than the other priority list approaches.