王楠;张粒子;舒隽;

• 1:华北电力大学电气与电子工程学院

摘要(Abstract)：

机组组合问题是电力系统优化运行的一个难点,理论上难以得到最优解。提出了一种基于粒子群修正策略的解耦算法。首先采用集结投影次梯度的拉格朗日松弛算法得到机组组合的对偶解;然后依据对偶信息中的备用乘子及对偶组合状态建立粒子群优化空间;而后利用无约束的标准粒子群优化算法实现拉格朗日乘子的局部更新,通过粒子的调整和粒子间信息的传递改变机组启停,进而修正拉格朗日对偶解,最终得到机组组合问题的近似最优解。6个系统的仿真计算验证了该方法的求解速度及计算精度。

关键词(KeyWords)： 拉格朗日松弛;粒子群优化算法;机组组合;经济调度;解耦算法

Abstract:

Keywords:

基金项目(Foundation):

作者(Author): 王楠;张粒子;舒隽;

Email:

DOI: 10.13335/j.1000-3673.pst.2010.01.018

参考文献(References)：

• [1]Senjyu T,Shimabukuro K,Uezato K,et al.A fast technique for unit commitment problem by extended priority list[J].IEEE Trans on Power Systems,2003,18(2):882-888.
• [2]Ouyang Z,Shahidehpour S M.An intelligent dynamic programming for unit commitment application[J].IEEE Trans on Power Systems,1991,6(3):1203-1209.
• [3]Cohen A I,Yoshimura M.A branch-and-bound algorithm for unit commitment[J].IEEE Trans on Power Systems,1978,PAS-102(2):444-451.
• [4]Guan X,Luh P B,Yan H.An optimization-based method for unit commitment[J].Electrical Power&Energy Systems,1992,14(1):23-27.
• [5]Merlin A,Sandrin P.A new method for unit commitment at electricite De France[J].IEEE Trans on Power Systems,1983(102):1218-1225.
• [6]Virmani S,Imhof K,Jee S H.Implementation of a Lagrangian relaxation based unit commitment problem[J].IEEE Trans on Power Systems,1989,4(4):1373-1380.
• [7]Cheng C P,Liu C W,Li C C.Unit commitment by Lagrangian relaxation and genetic algorithms[J].IEEE Trans on Power Systems,2000,15(2):707-714.
• [8]Zhuang F,Galiana F D.Toward a more rigorous and practical unit commitment by Lagrangian relaxation[J].IEEE Trans on PowerSystems,1988,3(2):763-772.
• [9]陈皓勇,张靠社,王锡凡.电力系统机组组合问题的系统进化算法[J].中国电机工程学报,1999,19(12):9-13.Chen Haoyong,Zhang Kaoshe,Wang Xifan.Evolutionary optimization method of power system unit commitment problem[J].Proceedings of the CSEE,1999,19(12):9-13(in Chinese).
• [10]苗青,曹广益,朱新坚.基于集结投影次梯度的机组组合算法研究[J].计算机仿真,2008,25(2):245-247.Miao Qing,Cao Guangyi,Zhu Xinjian.A new algorithm for unit commitment based on aggregative projection subgradient method[J].Computer Simulation,2008,25(2):245-247(in Chinese).
• [11]Zhao X,Luh P B,Wang J.The surrogate gradient algorithm for Lagrangian relaxation[J].Journal of Optimization Theory and Applications,1999,100(3):699-712.
• [12]Kazarlis S A,Bakirtzis A G,Petridis V.A genetic algorithm solution to the unit commitment problem[J].IEEE Trans on Power Systems,1996,11(2):83-92.
• [13]陈烨,赵国波,刘俊勇,等.用于机组组合优化的蚁群粒子群混合算法[J].电网技术,2008,32(6):52-56.Chen Ye,Zhao Guobo,Liu Junyong,et al.An ant colony optimization and particle swarm optimization hybrid algorithm for unit commitment based on operate coding[J].Power System Technology,2008,32(6):52-56(in Chinese).
• [14]孙力勇,张焰,蒋传文.求解机组组合问题的嵌入贪婪搜索机制的改进粒子群优化算法[J].电网技术,2006,30(13):44-48.Sun Liyong,Zhang Yan,Jiang Chuanwen.An improved particle swarm optimization algorithm embedded with greedy search for solution of unit commitment[J].Power System Technology,2006,30(13):44-48(in Chinese).
• [15]赵波,曹一家.电力系统机组组合问题的改进粒子群优化算法[J].电网技术,2004,28(21):6-10.Zhao Bo,Cao Yijia.An improved particle swarm optimization algorithm for power system unit commitment[J].Power System Technology,2004,28(21):6-10(in Chinese).
• [16]杨朋朋,韩学山.基于改进拉格朗日乘子修正方法的逆序排序机组组[J].电网技术,2006,30(9):40-45.Yang Pengpeng,Han Xueshan.Unit decommitment based on improved Lagrangian multiplier modification method[J].Power System Technology,2006,30(9):40-45(in Chinese).
• [17]Dekrajangpetch S,Sheblk G B,Conejo A J.Auction implementation problems using Lagrangian relaxation[J].IEEE Trans on Power Systems,1999,14(1):82-88.
• [18]Valenzuela J,Smith A E.A seed memetic algorithm for large unit commitment problems[J].J Heuristics,2002,8(2):173-195.