Comparative Analysis of Heuristic Techniques applied to ODGP

In this paper, a comparative analysis and evaluation of several heuristic techniques, when applied to the Optimal Distributed Generation Placement (ODGP) problem, is presented. Loss minimization is considered as the objective, while the network's technical characteristics as the constraints. Three versions of Particle Swarm Optimization (PSO), Global, Local and Unified (GPSO, LPSO and UPSO, respectively), Genetic Algorithm (GA), Artificial Bee Colony (ABC), Cuckoo Search (CS) and Harmony Search (HS) are compared. The implemented analysis demonstrates that all Heuristic Techniques examined can solve the ODGP problem efficiently, although UPSO emerge as the most promising, in terms of solution and convergence performance, whereas regarding execution time, HS is the most prominent. The study is evaluated upon typical 33 and 30 bus systems.