期刊文献+

火电站负荷调度混沌变步长混合遗传算法 被引量:5

Chaotic Variable Step Length-based Hybrid Genetic Algorithm for Load Dispatching at Power Plants
下载PDF
导出
摘要 结合混沌运动的遍历性和遗传算法的群体搜索性,提出一种基于混沌变尺度梯度下降的混合遗传算法,应用于电厂负荷优化调度。算法采用梯度下降法对遗传变异获得的优良个体进行局部搜索,引导种群的进化。结合混沌优化策略产生自适应步长,在搜索初期加快寻优速度,随着搜索逐渐接近最优点,混沌产生的小步长实现在最优解所在的小范围内进行精确搜索。对电站负荷优化调度的应用发现,相比传统的遗传算法和值长分配法,该混合遗传算法对机组负荷调度优化具有更高的效率。通过该混合遗传算法进行机组负荷分配寻优后,全厂发电煤耗率相比于实际的值长制降低了0.29~1.07-(kW·h),为电厂带来可观的经济效益。 By combining the ergodic character of chaotic movement with population searching character of genetic algorithm,a hybrid genetic algorithm based on a chaotic variable dimension gradient-drop was presented,which can be used to optimize load dispatching at power plants.The algorithm adopts a gradient drop method to conduct a local search of excellent individuals obtained from genetic variation and guide the evolution of the population.In conjunction with a chaotic optimization strategy,a self-adaptive step length can be produced,quickening the optimum-searching speed at the initial period of searching.With the searching gradually approaching the optimized point,by way of the small step length produced by chaos,it is possible to realize an accurate searching within a small range where an optimized solution is located.It has been found through an application of the optimized load dispatching at power plants that compared with the traditional genetic algorithm and officer-on-duty distribution method,the genetic algorithm can achieve an even higher efficiency in load dispatching optimization for power plants.Through an optimization searching of load distribution of power plants by using the hybrid genetic algorithm,the power-generation coal consumption rate for a whole power plant can be reduced by 0.29~1.07 g/(kW·h) compared with that of the officer-on-duty system,bringing about sizable economic benefits for the power plant.
出处 《热能动力工程》 EI CAS CSCD 北大核心 2006年第5期516-520,共5页 Journal of Engineering for Thermal Energy and Power
关键词 火电站机组负荷 遗传算法 混沌 变步长梯度下降法 优化调度 load of coal-fired power plant,genetic algorithm,chaos,variable step-length gradient drop method,optimized dispatching
  • 相关文献

参考文献13

二级参考文献86

  • 1马振华.现代应用数学手册(运筹学与优化理论卷)[M].清华大学出版社,1998.87.
  • 2王永骥 涂键.神经元网络控制(Neural Networks Control)[M].北京:机械工业出版社(Beijing: China Machine Press),1999..
  • 3CHOI C,LEE J.Chaotic local search algorithm[J].Artificial Life & Robotics,1998,2(1):41-47.
  • 4CHEN L,AIHARA K.Global search ability of chaotic neural networks[J].IEEE Transactions on Circuit & Systems I-Fundamental Theory & Apllications,1999,46(8):974-993.
  • 5TOKUDA I,AIHARA K,NAGASHIMA T.Adaptive annealing for chaotic optimization[J].Physical Review E,1998,58(4):5157-5160.
  • 6HAYAKAW Y,MARUMOTO A,SAW ADA Y.Effects of the chaotic noise on the performance of neural network model for optimization problems[J].Physical Review E,1995,51(4):2693-2696.
  • 7卢侃,混沌动力学,1990年
  • 8柳焯,最优化原理及其在电力系统中的应用,1988年
  • 9Potts J C. The development and evaluation of an advanced genetic algorithms based on migration and artificial election [J]. IEEE Trans System, Man and Cybern, 1994, 24(1):73 - 96.
  • 10MORI H,MATSUZAKI O. Embedding the priority list into tabu search for unit commitment[A]. IEEE Power Engineering Society Winter Meeting [ C ]. Columbus, USA:IEEE 2001. 1067-1072.

共引文献353

同被引文献55

引证文献5

二级引证文献48

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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