基于遗传算法的随机机组组合问题求解  

GA-based Solution to Stochastic Unit Commitment Problem

作　　者：熊高峰[1] 聂坤凯[1] 刘喜苹[2] 蔡振华[1] 谢上华[1] 

机构地区：[1]湖南大学电气与信息工程学院,长沙410082 [2]长沙南方职业学院信息技术系,长沙410208

出　　处：《电力系统及其自动化学报》2012年第5期93-99,共7页Proceedings of the CSU-EPSA

摘　　要：为考虑不确定性负荷对机组组合问题的影响,通过情景分析法引入一系列的情景对不确定性负荷进行建模,建立了随机机组组合问题的数学模型。采用遗传算法求解该优化问题,可自行满足情景簇约束。通过改进初始种群产生方式和变异算子,引进局部搜索算子对遗传算法进行改进,增强了算法的搜索能力。计算结果显示了随机机组组合问题的数学模型和改进遗传算法求解方法的有效性。In order to consider the effects of uncertain electric power demand on unit commitment, the uncertainty of electric power demand is modeled by using a set of scenarios, which are introduced by scenario analysis. A mathematical formulation of the expected value model of the stochastic unit commitment （SUC） problem is established. This optimization problem is solved by using a genetic algorithm （GA）, which can automatically satisfy the bundle constraints. The performance of the algorithm is improved by introducing a new method to generate the initial population, a new mutation operator, and a local search operator. Based on numerical examples, test results show the feasibility of the mathematical model of the SUC problem and its improved GAbased solution method.

关 键 词：情景分析 负荷不确定性 随机机组组合问题 遗传算法 

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