求解机组组合问题的改进离散粒子群算法  

Unit Commitment via an Enhanced Binary Particle Swarm Optimization Algorithm

作　　者：刘涌[1] 侯志俭[1] 蒋传文[1] 

机构地区：[1]上海交通大学电子信息与电气工程学院,上海市200030

出　　处：《电力系统自动化》2006年第4期35-39,共5页Automation of Electric Power Systems

摘　　要：电力系统机组组合问题是一个高维数、离散、非线性的大规模复杂工程优化问题。文中提出了一种基于改进离散粒子群优化算法求解机组组合问题的新方法。首先采用新的策略生成粒子, 以保证所有生成的粒子均为满足基本约束条件的可行解,使整个算法只在可行解区域进行优化搜索;然后引入优化窗口的概念和启发式的规则以缩短计算时间和提高优化精度。仿真结果表明所提出的算法具有解的质量高、收敛速度快的特点,充分证明了它能很好地解决机组组合问题。Unit commitment is a large scale, discrete and non-linear optimization problem. A solutton to umt commitment via an enhanced binary particle swarm Optimization （BPSO） algorithm is presented. A new strategy for particles generation is proposed which can make all the particles feasible and narrow the search space within the feasible solutions. Optimization window and heuristic rules are introduced into the methodology to improve the speed and the solution precision. The simulation results clearly show that the proposed method is effective.

关 键 词：机组组合 离散粒子群优化算法 优化窗口 启发式规则 

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