首页 | 本学科首页   官方微博 | 高级检索  
     检索      

改进粒子群优化算法在电源规划中的应用
引用本文:李翔,牛东晓,杨尚东.改进粒子群优化算法在电源规划中的应用[J].中国管理科学,2006,14(6):113-118.
作者姓名:李翔  牛东晓  杨尚东
作者单位:华北电力大学工商管理学院, 北京, 102206
摘    要:电源规划是一类复杂、非线性组合优化问题.传统的方法随着规划期的延长,考虑因素的增多,难以有效的进行优化,在实际应用中作用有限.首先,对电源规划优化问题进行了建模.然后,对于粒子群(PSO)的迭代策略进行改进,在此基础上,运用遗传粒子群(GPHA)混合优化算法进行了优化尝试.考虑到电源规划中相关参数众多,在优化过程中引入了虚拟变量对电源规划中的问题进行了简化描述;GHPA算法的适应度评价函数设计中,运用了罚函数的思想,以提高算法优化的效果.最后本文使用某省实际负荷预测和系统负荷实际数据,进行了电源规划方案优化,得到了优化后的电源规划方案,并与普通的遗传算法、粒子群算法以及传统的动态规划算法得到的结果进行了比较.比较的结果显示出了本文提出的算法在优化结果和速度方面具有明显效果.

关 键 词:遗传算法  粒子群算法  电源规划  罚函数  虚拟变量  
文章编号:1003-207(2006)06-0113-06
收稿时间:2006-06-22;
修稿时间:2006年6月22日

Application of the Improved Particle Swarm Optimization Algorithm in the Generation Expansion Planning
LI Xiang,NIU Dong-xiao,YANG Shang-dong.Application of the Improved Particle Swarm Optimization Algorithm in the Generation Expansion Planning[J].Chinese Journal of Management Science,2006,14(6):113-118.
Authors:LI Xiang  NIU Dong-xiao  YANG Shang-dong
Institution:Business Administration School, North China Electric University, Beijing 102206, China
Abstract:The generation expansion planning is a complex non-linear and combinatorial optimization problem.With the plan time lengthening and the factors considered increasing,the traditional optimization methods can not make the satisfactory result.And also so,it's applications in the practice are limited.Firstly,the model of the generation expansion was set up.Then,the paper improved the iteration tactic of the particle swarm optimization.It proposed a hybrid algorithm which combined genetic algorithm with particle swarm optimizaion(GPHA).Considering the various factors concerned,the paper introduced fictitious variables to briefly describe generation expansion planning problem in the optimization process.For the fitness function,the paper used penalty function to enhance the effect.In the end of this paper,it chose actual load forecast and the system load actual data of some province,quoted in the similar question regarding correlation parameter supposition,and compared the algorithm with the ordinary genetic algorithms,particle swarm optimization algorithm and the traditional dynamic programming algorithm.The result proves that the new algorithm has done well in the aspects of optimization and speed.
Keywords:genetic algorithm  particle swarm optimization algorithm  generation expansion planning  penalty function  fictitious variable  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《中国管理科学》浏览原始摘要信息
点击此处可从《中国管理科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号