a. a. gharaveisi

In the deregulated power systems, transmission congestion is one of the significant and main problems of the electrical networks which can cause incremental cost in the energy. This problem has resulted to new challenging issues in different parts of power systems which there was not in the traditional systems or at least had very little importance. Transmission congestion happens when the maximum available power transmission capacity is lower than the consumption side. As congestion happens, the system power losses are increased which can cause problem in the voltage constraints. Therefore, this paper proposes a new method to handle the optimal management and control of congestion problem by the use of distributed generations (DGs). In this regard, the optimal size and location of DGs are investigated using the powerful bacteria foraging algorithm (BFA) as a new intelligence-based optimization technique to solve the congestion problem on the three IEEE 14-bus, 30-bus and 57-bus test systems. The simulation results show the high speed, fast convergence and accurate performance of the proposed algorithm to solve the congestion problem in the system

Distributed Generations (DGs) are utilized to supply the active and reactive power in the transmission and distribution systems. These types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. In order to reach the above benefits, the optimal placement and sizing of DG is significant. In this regard, this paper gets use of the Bacteria Foraging Algorithm (BFA) and Binary Genetic Algorithm (BGA) to investigate the DG placement with the purpose of power loss and voltage deviation reduction. The proposed method is applied on the 33-bus and 69-bus IEEE test systems and the optimal place and size of DGs from the power losses and voltage deviation minimization are assessed. Also, the performance of the above two algorithms are compared with each other.