期刊文献+

基于改进离散粒子群算法的电力系统机组组合问题 被引量:26

Unit Commitment Based on Improved Discrete Particle Swarm Optimization
下载PDF
导出
摘要 提出一种新的离散粒子群算法。结合改进的自学习策略优化粒子群算法适用于求解电力系统中的机组组合(unit commitment,UC)问题。算法将UC问题分解为具有整型变量和连续变量的2个优化子问题,采用离散粒子群优化和原对偶内点法相结合的双层嵌套方法对外层机组启、停状态变量和内层机组功率经济分配子问题进行交替迭代优化求解。在处理约束问题时采用修正法代替传统的罚因子法,提高了解的质量。以10×2台机组组成的2个测试系统为算例,通过与其他算法结果进行比较分析,证明了该方法的可行性和有效性。仿真结果表明,该方法解决UC问题具有求解精度高和收敛速度快的优势。 An improved discrete particle swarm 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 proposed algorithm divides UC problem to two optimization 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 inner layer units are solved by alternate iteration optimization. During the processing of constraints, traditional penalty factor method is replaced by modification algorithm to improve the quality Of solution. Taking a testing system composed by ten units as simulation example, simulation results show that the proposed method is feasible and effective, besides, simulation results also show that the proposed method possesses the superiority in both solution accuracy and convergence speed than other algorithms.
出处 《电网技术》 EI CSCD 北大核心 2011年第12期94-99,共6页 Power System Technology
关键词 粒子群优化 离散 自学习策略 机组组合 修正法 particle swarm self-learning strategy unit algorithm optimization (PSO) discrete commitment modification
  • 相关文献

参考文献17

  • 1Senjyu T, Shimabukuro K, Uezato K. A fast technique for unit commitment problem by extended priority list[J]. IEEE Trans on Power Systems, 2003, 18(2): 881-888.
  • 2Wang C, Shahidehpour M. Optimal generation scheduling with romping costs[J]. IEEE Trans on Power Systems, 1995, 10(1): 60-67.
  • 3Ongsakul W, Petcharaks N. Unit commitment by enhanced adaptive Lagrangian relaxation[J]. IEEE Trans on Power Systems, 2004, 19(1): 620-628.
  • 4Mantawy A H, Abdel Magid Y L, Selim S Z. Unit commitment by tabu search[J]. IEE Proceedings Generation, Transmission and Distribution, 1998, t45(1).. 56-64.
  • 5Simopoulos D N, Kavatza S D, Voumas C D. Unit commitment by an enhanced simulated annealing algorithm[J]. IEEE Trans on Power Systems, 2006, 21(1): 68-76.
  • 6Simon S P, Padhy N P, Anand R S. An ant colony system approach for unit commitment problem[J]. IEEE Trans on Power Systems, 2006, 28(5): 315-323.
  • 7高山,单渊达.遗传算法搜索优化及其在机组启停中的应用[J].中国电机工程学报,2001,21(3):45-48. 被引量:52
  • 8Gaing Z. Discrete particle swarm optimization algorithm for unit commitment[C]//Proceedings of IEEE Power Engineering Society General Meeting. Toronto, Canada: IEEE, 2003: 418-424.
  • 9Bavafa M, Monsef H, Navidi N. A new hybrid approach for unit commitment using Lagrangian relaxation combined with evolutionary and quadratic programming[C]//Power and Energy Engineering Conference. Asia-Pacific: APPEEC, 2009: 1-6.
  • 10Kennedy J, Eberhart R C. Particle swarm optimization[C]// Proceedings of IEEE International Conference On Neural Networks. Perth, Australim IEEE, 1995: 1942-1948.

二级参考文献54

共引文献262

同被引文献257

引证文献26

二级引证文献172

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部