Application of modified NSGA-II algorithm to reactive power optimization

9Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The optimal Reactive Power Dispatch (RPD) problem is a nonlinear constrained optimization problem. This paper presents true multi-objective solution set for multi-objective RPD problem. The objective functions are real power loss minimization and control variable adjustment costs. In this paper, a Modified Non-Dominated Sorting Genetic Algorithm version II (MNSGA-II) is proposed for solving RPD problem. For maintaining good diversity in the performance of NSGA-II, the concept of Dynamic Crowding Distance (DCD) is implemented in NSGA-II algorithm and given name as MNSGA-II. The standard IEEE 30-bus and IEEE 118 bus test systems are used. The results obtained using MNSGA-II are compared with NSGA-II and validated with reference Pareto front generated by conventional weighted sum method using Covariance Matrix Adapted Evolution Strategy (CMA-ES). The performance of NSGA-II and MNSGA-II are compared with respect to best, mean, worst and standard deviation of multi-objective performance measures.The results show the effectiveness of MNSGA-II and confirm its potential to solve the multi-objective RPD problem. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ramesh, S., Kannan, S., & Baskar, S. (2011). Application of modified NSGA-II algorithm to reactive power optimization. In Communications in Computer and Information Science (Vol. 204 CCIS, pp. 344–354). https://doi.org/10.1007/978-3-642-24043-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free