Key points are not available for this paper at this time.
Optimal power flow is a complex and highly non-linear problem in which steady-state parameters are needed to find a network's efficient and economical operation. In addition, the difficulty of the Optimal power flow problem becomes enlarged when new constraints are added, and it is also a challenging task for the power system operator to solve the constrained Optimal power flow problems efficiently. Therefore, this paper presents a constrained composite differential evolution optimization algorithm to search for the optimum solution to Optimal power flow problems. In the last few decades, numerous evolutionary algorithm implementations have emerged due to their superiority in solving Optimal power flow problems while considering various objectives such as cost, emission, power loss, etc. evolutionary algorithms effectively explore the solution space unconstrainedly, often employing the static penalty function approach to address the constraints and find solutions for constrained Optimal power flow problems. It is a drawback that combining evolutionary algorithms and the penalty function approach requires several penalty parameters to search the feasible space and discard the infeasible solutions. The proposed a constrained composite differential evolution algorithm combines two effective constraint handling techniques, such as feasibility rule and ɛ constraint methods, to search in the feasible space. The proposed approaches are recognized on IEEE 30, 57, and 118-bus standard test systems considering 16 study events of single and multi-objective optimization functions. Ultimately, simulation results are examined and compared with the many recently published techniques of Optimal power flow solutions owing to show the usefulness and performance of the proposed a constrained composite differential evolution algorithm.
Ali et al. (Thu,) studied this question.