期刊文献+

基于BFOA算法的配电网DG选址定容方法 被引量:5

DG Site Selection and Capacity Planning Method in Distribution Network Based on BFOA Algorithm
下载PDF
导出
摘要 发展分布式能源系统对于实现的“碳达峰”和“碳中和”,提升可再生能源的开发利用具有重要意义。提出一种基于细菌觅食优化算法(BFOA)的配电网分布式电源(DG)选址定容方法。建立以配电网的功率损耗指数、电压偏差以及安装分布式电源所降低的净运行成本最小为目标的数学模型及约束条件,提出损耗敏感系数(LSF)来确定DG安装位置,并引用BFOA算法求解DG的最佳容量。仿真表明,相对于传统优化算法,BFOA算法在模型求解时间和收敛速度上具有明显优势,所提规划方法能够最大限度地降低功率损耗和运行成本,并提高系统的电压稳定性。 The development of distributed energy systems is of great significance for the realization of carbon peak and carbon neutrality,for the promotion of development and utilization of renewable energy.A method for DG site selection and capacity determination in distribution networks is proposed based on bacterial foraging optimization algorithm(BFOA).Mathematical model and constraints are established to minimize the power loss index,voltage deviation and net operating cost of distribution network.Loss sensitivity factor(LSF)is proposed to determine the DG installation location.BFOA algorithm is used to solve the optimal capacity of DG.Simulation shows that BFOA algorithm has obvious advantages in model solution time and convergence speed compared with traditional optimization algorithms.The proposed planning method can minimize power loss and operating cost and improve the system voltage stability.
作者 刘可 王昕 刘冬平 郭财 张启晟 闫涵 王轩 马恒瑞 LIU Ke;WANG Xin;LIU Dongping;GUO Cai;ZHANG Qisheng;YAN Han;WANG Xuan;MA Hengrui(State Grid Qinghai Electric Power Research Institute,Xining 810000,China;CET Electric Technology Inc.,Shenzhen 518000,China;State Grid Qinghai Electric Power Company Overhaul Company,Xining 810000,China;New Energy(Photovoltaic)Industry Research Center,Qinghai University,Xining 810016,China)
出处 《智慧电力》 北大核心 2022年第9期90-96,共7页 Smart Power
基金 国家自然科学基金资助项目(51907096)。
关键词 配电网 细菌觅食优化算法 分布式电源 容量规划 distribution network bacterial foraging optimization algorithm distributed generation capacity planning
  • 相关文献

参考文献24

二级参考文献383

共引文献423

同被引文献67

引证文献5

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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