Search

The optimal reactive power dispatch (ORPD) problem represents a fundamental concern in the efficient and reliable operation of power systems, based on the proper coordination of numerous devices. Therefore, the ORPD calculation is an elaborate nonlinear optimization problem that requires highly performing computational algorithms to identify the optimal solution. In this paper, the potential of metaheuristic methods is explored for solving complex optimization problems specific to power systems. In this regard, an improved salp swarm algorithm is proposed to solve the ORPD problem for the IEEE-14 and IEEE-30 bus systems, by approaching the reactive power planning as both a single- and a multi- objective problem and aiming at minimizing the real power losses and the bus voltage deviations. Multiple comparison studies are conducted based on the obtained results to assess the proposed approach performance with respect to other state-of-the-art techniques. In all cases, the results demonstrate the potential of the developed method and reflect its effectiveness in solving challenging problems. [ABSTRACT FROM AUTHOR]

Several population-based metaheuristic optimization algorithms have been proposed in the last decades, none of which are able either to outperform all existing algorithms or to solve all optimization problems according to the No Free Lunch (NFL) theorem. Many of these algorithms behave effectively, under a correct setting of the control parameter(s), when solving different engineering problems. The optimization behavior of these algorithms is boosted by applying various strategies, which include the hybridization technique and the use of chaotic maps instead of the pseudo-random number generators (PRNGs). The hybrid algorithms are suitable for a large number of engineering applications in which they behave more effectively than the thoroughbred optimization algorithms. However, they increase the difficulty of correctly setting control parameters, and sometimes they are designed to solve particular problems. This paper presents three hybridizations dubbed HYBPOP, HYBSUBPOP, and HYBIND of up to seven algorithms free of control parameters. Each hybrid proposal uses a different strategy to switch the algorithm charged with generating each new individual. These algorithms are Jaya, sine cosine algorithm (SCA), Rao's algorithms, teaching-learning-based optimization (TLBO), and chaotic Jaya. The experimental results show that the proposed algorithms perform better than the original algorithms, which implies the optimal use of these algorithms according to the problem to be solved. One more advantage of the hybrid algorithms is that no prior process of control parameter tuning is needed. [ABSTRACT FROM AUTHOR]