Skip to content
naulon
Not checkedNot checked for notices yet.

A Novel Hybrid Multi-Objective Evolutionary Algorithm for Optimal Power ‎Flow in Wind, PV, and PEV Systems ‎

R.K. Avvari, V. Kumar D M

Journal of Operation and Automation in Power Engineering · 2023

doi:10.22098/joape.2023.10371.1746 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, a new hybrid decomposition-based multi-objective evolutionary algorithm (MOEA) is proposed for the optimal power flow (OPF) problem including Wind, PV, and PEVs uncertainty with four conflicting objectives. The proposed multi-objective OPF (MOOPF) problem includes minimization of the total cost (TC), total emission (TE), active power loss (APL), and voltage magnitude deviation (VMD) as objectives and a novel constraint handling method, which adaptively adds the penalty function and eliminates the parameter dependence on penalty function evaluation is deployed to handle several constraints in the MOOPF problem. In addition, summation-based sorting and improved diversified selection methods are utilized to enhance the diversity of MOEA. Further, a fuzzy min-max method is utilized to get the best-compromised values from Pareto-optimal solutions. The impact of intermittence of Wind, PV, and PEVs integration is considered for optimal cost analysis. The uncertainty associated with Wind, PV, and PEV systems are represented using probability distribution functions (PDFs) and its uncertainty cost is calculated using the Monte-Carlo simulations (MCSs). A commonly used statistical method called the ANOVA test is used for the comparative examination of several methods. To test the proposed algorithm, standard IEEE 30, 57, and 118-bus test systems were considered with different cases and the acquired results were compared with NSGA-II and MOPSO to validate the suggested algorithm's effectiveness

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.