New Metaheuristic Algorithms for Reactive Power Optimization

Optimal reactive power dispatch (ORPD) is significant regarding operating the practice safely and efficiently. The ORPD is beneficial to recover the voltage profile, diminish the losses and increase the voltage stability. The ORPD is a complicated optimization issue in which the total active power loss is reduced by detecting the power-system control variables, like generator voltages, tap ratios of tap-changer transformers, and requited reactive power, ideally. This study offers new approaches based on Shuffled Frog Leaping Algorithm (SFLA) and Tree Seed Algorithm (TSA) to solve the best ORPD. The results of the approaches are offered set against the current results studied in the literature. The recommended algorithms were tested by IEEE-30 and IEEE-118 bus systems to discover the optimal reactive power control variables. It was observed that the obtained results are more successful than the other algorithms

Multi-Objective Optimization Techniques to Solve the Economic Emission Load Dispatch Problem Using Various Heuristic and Metaheuristic Algorithms

The main objective of thermoelectric power plants is to meet the power demand with the lowest fuel cost and emission levels of pollutant and greenhouse gas emissions, considering the operational restrictions of the power plant. Optimization techniques have been widely used to solve engineering problems as in this case with the objective of minimizing the cost and the pollution damages. Heuristic and metaheuristic algorithms have been extensively studied and used to successfully solve this multi-objective problem. This chapter, several optimization techniques (simulated annealing, ant lion, dragonfly, NSGA II, and differential evolution) are analyzed and their application to economic-emission load dispatch (EELD) is also discussed. In addition, a comparison of all approaches and its results are offered through a case study

Solving security constrained optimal power flow problems:a hybrid evolutionary approach

A hybrid population-based metaheuristic, Hybrid Canonical Differential Evolutionary Particle Swarm Optimization (hC-DEEPSO), is applied to solve Security Constrained Optimal Power Flow (SCOPF) problems. Despite the inherent difficulties of tackling these real-world problems, they must be solved several times a day taking into account operation and security conditions. A combination of the C-DEEPSO metaheuristic coupled with a multipoint search operator is proposed to better exploit the search space in the vicinity of the best solution found so far by the current population in the first stages of the search process. A simple diversity mechanism is also applied to avoid premature convergence and to escape from local optima. A experimental design is devised to fine-tune the parameters of the proposed algorithm for each instance of the SCOPF problem. The effectiveness of the proposed hC-DEEPSO is tested on the IEEE 57-bus, IEEE 118-bus and IEEE 300-bus standard systems. The numerical results obtained by hC-DEEPSO are compared with other evolutionary methods reported in the literature to prove the potential and capability of the proposed hC-DEEPSO for solving the SCOPF at acceptable economical and technical levels

Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism for Solving Large-Scale Economic Dispatch With Valve-Point Effects and Multiple Fuel Options

This paper presents a new metaheuristic optimization algorithm, the firefly algorithm (FA), and an enhanced version of it, called chaos mutation FA (CMFA), for solving power economic dispatch problems while considering various power constraints, such as valve-point effects, ramp rate limits, prohibited operating zones, and multiple generator fuel options. The algorithm is enhanced by adding a new mutation strategy using self-adaptation parameter selection while replacing the parameters with fixed values. The proposed algorithm is also enhanced by a self-adaptation mechanism that avoids challenges associated with tuning the algorithm parameters directed against characteristics of the optimization problem to be solved. The effectiveness of the CMFA method to solve economic dispatch problems with high nonlinearities is demonstrated using five classic test power systems. The solutions obtained are compared with the results of the original algorithm and several methods of optimization proposed in the previous literature. The high performance of the CMFA algorithm is demonstrated by its ability to achieve search solution quality and reliability, which reflected in minimum total cost, convergence speed, and consistency