考虑机组爬坡速度和网络安全约束的经济调度解耦算法  

DECOUPLED ECONOMIC DISPATCH INCLUDING UNIT RAMP RATE AND NETWORK SECURITY CONSTRAINTS

作　　者：韩学山[1] 柳焯[2] 

机构地区：[1]山东大学电气工程学院,山东省济南市250062 [2]哈尔滨工业大学电气工程系,黑龙江省哈尔滨市150001

出　　处：《电力系统自动化》2002年第13期32-37,共6页Automation of Electric Power Systems

基　　金：国家自然科学基金资助项目 (5 94770 10 )

摘　　要：在电力系统经济调度中 ,由于机组爬坡速度、电网静态安全等约束的引入 ,在整个考虑周期内 ,机组的调度决策不仅具有空间上的关联 ,还具有时间上的关联 ,从而其调度模型不易求解。然而 ,在实际进行机组调度决策时 ,空间上和时间上的前后关联度并不是很强。也就是说 ,未来对机组现时刻的运行状态产生影响的时间段是有限的。基于这一思想 ,在整个运行周期内 ,研究未来多长时间对机组现时刻的最优状态不构成影响 ,即基于前瞻技术 ,在确保整体最优的前提下 ,提出按一定的序列单时段解耦求解模型 ,借助内点法进行求解。以 IEEE可靠性分析的试验系统为例对本文算法在各种情况下进行分析比较 ,表明本文算法在计算代价上有一定优势 ,并且可以灵活应用到多种场合。In the economic dispatch of electric power system, due to the limits of unit ramp rate and network security, the dispatch decision is coupled with the space and time during the considering period, and then the model of economic dispatch is difficult to be solved. However, the coupling on space and time is weak when units dispatch is practically decided. Based on this idea, how long in the future will affects the optimal state of units a present time is studied in this paper. On the basis of looking-ahead technique, to guarantee the optimality of every time interval to the units dispatch, a decoupling model and an efficient method for finding the optimal solution of each time interval via the interior point method are proposed. The method is analyzed and compared under all the test cases on the IEEE reliability system. The results show that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size and the method can be neatly used for various cases of electric power system dispatch problems.

关 键 词：机组爬坡速度 网络安全 约束 经济调度 解耦算法 电力系统 

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