基于改进离散粒子群算法的电力系统机组组合问题.pdfVIP

第35 卷 第12 期 电 网 技 术 Vol. 35 No. 12 2011 年12 月 Power System Technology Dec. 2011 文章编号：1000-3673 （2011 ）12-0094-06 中图分类号：TM 72 文献标志码：A 学科代码：470·40 基于改进离散粒子群算法的 电力系统机组组合问题 陈海良，郭瑞鹏 （浙江大学电气工程学院，浙江省 杭州市 310027 ） Unit Commitment Based on Improved Discrete Particle Swarm Optimization CHEN Hailiang, GUO Ruipeng (School of Electrical Engineering, Zhejiang University, Hangzhou 310027, Zhejiang Province, China) ABSTRACT: An improved discrete particle swarm 决UC 问题具有求解精度高和收敛速度快的优势。 optimization (PSO) algorithm is proposed. The optimized PSO 关键词：粒子群优化；离散；自学习策略；机组组合；修正法 combined with improved self-learning strategy is suitable to solve unit commitment (UC) problem in power system. The 0 引言 proposed algorithm divides UC problem to two optimization 机组组合(unit commitment，UC)是一个具有实 subproblems, i.e., the subproblem with integer variables and 际应用价值的工程问题。机组组合能够带来显著的 the subproblem with continuous variables, and the former is 经济效益和社会效益，引起了电力工作者和研究人 suitable to solve UC state problem and the latter is suitable to solve economic dispatching problem. Adopting the two-layer 员的广泛兴趣。但由于机组组合问题是一个高维、 embedded method that combines discrete PSO with 离散、非线性规划问题，至今没有一个统一的高效 primal-dual interior point method, the starting/stop state 解决方法。在近几十年的研究中，涌现了各种各样 variables of outer layer units and economic power allocation of 的算法。这些算法大致可以分为2 类：解析类确定 inner layer units are solved by alternate ite