Abstract
Optimal power flow (OPF) is a highly non-linear complex optimization problem where the steady state parameters of an electrical network need to be determined for its economical and efficient operation. The complexity of the problem escalates with ubiquitous presence of constraints in the problem. Solving OPF remains a popular but challenging task among power system researchers. In last couple of decades, numerous evolutionary algorithms (EAs) have been applied to find optimal solutions with different objectives of OPF. However, the search method adopted by EAs is unconstrained. An extensively used methodology to discard infeasible solutions found during the search process is the static penalty function approach. The process requires appropriate selection of penalty coefficients decided largely by tedious trial and error method. This paper presents performance evaluation of proper constraint handling (CH) techniques — superiority of feasibly solutions (SF), self-adaptive penalty (SP) and an ensemble of these two constraint handling techniques (ECHT) with differential evolution (DE) being the basic search algorithm, on the problem of OPF. The methods are tested on standard IEEE 30, IEEE 57 and IEEE 118-bus systems for several OPF objectives such as cost, emission, power loss, voltage stability etc. Single objective and weighted sum multi-objective cases of OPF are studied under the scope of this literature. Simulation results are analyzed and compared with most recent studies on the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Engineering Applications of Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.