首页> 外文期刊>Energy >Improved harmony search algorithm for electrical distribution network expansion planning in the presence of distributed generators
【24h】

Improved harmony search algorithm for electrical distribution network expansion planning in the presence of distributed generators

机译:分布式发电机存在下配电网扩展规划的改进和谐搜索算法

获取原文
获取原文并翻译 | 示例
       

摘要

Distribution network expansion planning problem is carried out to supply the forecasted demand of distribution network in a certain time in which optimal size and location of distribution substations and feeders should be determined. In this paper, this problem in the presence of different types of distributed generators is addressed. For this purpose, a new approach is applied to model several practical aspects such as pollution, investment and operation costs of distributed generators, purchased power form the main grid, dynamic planning, and uncertainties of load demand and electricity prices. The uncertainties are modeled using the probability distribution function and Monte-Carlo simulation is applied to insert them into the planning problem. Because the problem involves many variables and constraints and is a non-convex and large-scale one, improved harmony search algorithm is used to solve it. To show the effectiveness of the proposed model and solving approach, it is applied to the 9-node and 69-node standard radial distribution networks and a real system of western part of Iranian national 20 kV distribution grid. The results show that the harmony search algorithm can solve the problem in a better manner in comparison with other methods such as genetic algorithm and particle swarm optimization. (C) 2018 Elsevier Ltd. All rights reserved.
机译:进行配电网扩展规划问题,以在一定时间内满足配电网的预测需求,从而确定配电变电站和支线的最佳规模和位置。在本文中,解决了存在不同类型的分布式发电机时的问题。为此,采用了一种新方法来对多个实际方面进行建模,例如污染,分布式发电机的投资和运营成本,从主电网购买的电力,动态规划以及负载需求和电价的不确定性。使用概率分布函数对不确定性进行建模,并应用蒙特卡洛模拟将其插入规划问题中。由于该问题涉及许多变量和约束,并且是非凸且大规模的问题,因此使用改进的和声搜索算法来解决该问题。为了证明所提出模型和求解方法的有效性,将其应用于9节点和69节点标准径向配电网以及伊朗国家20 kV配电网西部的真实系统。结果表明,与遗传算法和粒子群算法等其他方法相比,和声搜索算法可以更好地解决该问题。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号