Distribution Network Planning Considering Harmonics Based on a Parallel Genetic Algorithm Using Message Passing Interface

This paper presents a parallel genetic algorithm (GA) for the planning of power distribution networks considering harmonics. Power distribution systems are generally operated in a radial configuration, supplemented by tie switches that enable network reconfiguration during unexpected outages or planned maintenance. They can also include distributed generators (DGs), capacitor banks (CBs), and soft open points (SOPs) to lower distribution losses and improve the voltage profile. Some of the loads and DG units may be nonlinear, generating harmonic currents in the system, polluting the power, and increasing losses. This paper makes use of a parallel GA to find an optimized configuration, optimized location, and sizing of DGs, CBs, and SOPs to lower real power distribution losses while considering harmonics and the physical constraints of the network. The proposed algorithm uses a solution encoding based on the minimum spanning tree to guarantee the radial topology of candidate solutions. It uses the backward–forward power flow method to compute the fundamental voltages and a decoupled harmonic power flow for the harmonic components. The algorithm is parallelized on a small computer cluster using the Message Passing Interface (MPI) to reduce its execution time. The proposed solver is validated on distribution systems ranging from 16 to 880 buses. The results show that simultaneously optimizing the topology, the DGs, the CBs, and the SOPs results in reducing power losses by 37% to 93%, improving the overall efficiency of the distribution system. The parallelization using MPI allows for a 90.9× speedup on a 96-core cluster.