One of the important factors in the discussion of power transmission is filling the capacity of network lines, which limits the transmission of power and increases the locational marginal price (LMP) in the network. Today, one of the techniques for resolving congestion and reducing LMP is to install DG units in the network, taking into account two factors: place and optimal size of DG based on operating costs and network constraints, all of which depend on the awareness of the capacity of network lines. In this article, in the first step, using the GA-GSF algorithm, identifying the network's weaknesses such as the lines that have reached their maximum capacity, and then by considering three terms and two scenarios condition of the buses connected to the filled lines will be discussed and we review and extract the best places for installing DG on the network. Then, considering the cost of operating DG and applying it to the objective function of the problem, by positively denoting DG profit and reducing line congestion, the optimization problem is solved by GA-GSF algorithm, and finally, the algorithm output including place and optimal size of DG unit in the network is minimized by line congestion and LMP, and DG installation is economically justified. Finally, the proposed algorithm was tested on the IEEE 14-BUS network for seven different DG types, and the results were such that out of these seven DGs, three DGs were able to reduce the total capacity of the network lines to less than the full capacity of the lines and the price of LMP has been raised to the price of UMP, and the other four DGs have managed to lower the price of LMP compared to their cost function.

中文翻译：

---

使用 GA-GSF 算法基于电网中 DG 的布局和最优尺寸降低 LMP 并解决线路拥塞

电力传输讨论的重要因素之一是填充网络线路的容量，这限制了电力的传输并增加了网络中的位置边际价格（LMP）。今天，解决拥塞和减少 LMP 的技术之一是在网络中安装 DG 单元，考虑两个因素：基于运营成本和网络约束的 DG 的位置和最佳尺寸，所有这些都取决于对网络的认识。网络线路的容量。在本文中，第一步，使用 GA-GSF 算法，识别网络的弱点，例如已达到最大容量的线路，然后通过考虑三个术语和两个场景的条件来讨论连接到实线的总线，我们审查和提取在网络上安装 DG 的最佳位置。然后，考虑运行DG的成本并将其应用于问题的目标函数，通过正表示DG利润和减少线路拥塞，通过GA-GSF算法求解优化问题，最终得到包含位置和最优值的算法输出通过线路拥塞和 LMP 使网络中 DG 单元的大小最小化，并且 DG 安装在经济上是合理的。最后，所提出的算法在 IEEE 14-BUS 网络上针对七种不同的 DG 进行了测试，结果是，在这七种 DG 中，