求解机组组合问题的嵌入贪婪搜索机制的改进粒子群优化算法.pdfVIP

30 卷 13 期 电 网 技 术 Vol. 30 No. 13 2006 年7 月 Power System Technology Jul. 2006 文章编号：1000-3673 （2006 ）13-0044-05 中图分类号：TM744 文献标识码：A 学科代码：4704051 求解机组组合问题的嵌入贪婪搜索机制的 改进粒子群优化算法 孙力勇，张 焰，蒋传文 （上海交通大学 电气工程系，上海市 徐汇区 200030 ） An Improved Particle Swarm Optimization Algorithm Embedded with Greedy Search for Solution of Unit Commitment SUN Li-yong，ZHANG Yan，JIANG Chuan-wen （Department of Electrical Engineering，Shanghai Jiaotong University，Xuhui District ，Shanghai 200030 ，China ） ABSTRACT: To solve unit commitment (UC) an improved 0 引言 particle swarm optimization algorithm is proposed, in which 无论在传统的电力工业中还是电力市场环境下， greedy search is embedded. The features of the proposed 机组组合问题始终是电力系统优化运行的一个重要 method are as following: the integer variables representing units operation states are processed by fixed threshold, thus 方面。几十年来，众多学者做了大量的研究工作并提 UC can be directly solved by particle swarm optimization 出了多种优化方法，如动态规划法(dynamic [1] algorithm and the sub-problems of economic dispatch in each programming ，DP) 、系统进化法(evolutionary time interval can be avoided; in the iteration of particle swarm programming，EP)[2-3] 、模糊优化法(fuzzy optimization， optimization the slow evolution particles are renewed by FO)[4] 、遗传算法(genetic algorithm，GA)[5-7]等。近 mutation operation, so the search capability of the algor