Multi-objective optimal power flow solutions using a constraint handling technique of evolutionary algorithms

In power systems, optimal power flow (OPF) is a complex and constrained optimization problem in which quite often multiple and conflicting objectives are required to be optimized. The traditional way of dealing with multi-objective OPF (MOOPF) is the weighted sum method which converts the multi-objective OPF into a single-objective problem and provides a single solution from the set of Pareto solutions. This paper presents MOOPF study applying multi-objective evolutionary algorithm based on decomposition (MOEA/D) where a set of non-dominated solutions ( Pareto solutions) can be obtained in a single run of the algorithm. OPF is formulated with two or more objectives among fuel (generation) cost, emission, power loss and voltage deviation. The other important aspect in OPF problem is about satisfying power system constraints. As the search process adopted by evolutionary algorithms is unconstrained, for a constrained optimization problem like OPF, static penalty function approach has been extensively employed to discard infeasible solutions. This approach requires selection of a suitable penalty coefficient, largely done by trial-and-error, and an improper selection may often lead to violation of system constraints. In this paper, an effective constraint handling method, superiority of feasible solutions (SF), is used in conjunction with MOEA/D to handle network constraints in MOOPF study. The algorithm MOEA/D-SF is applied to standard IEEE 30-bus and IEEE 57-bus test systems. Simulation results are analyzed, especially for constraint violation and compared with recently reported results on OPF.