EUVIMEDEUVIMED entdecken
Crossref

Solving A Multi-Objective Reactive Power Market Clearing Model Using NSGA-II

Ashish Saini

International Journal of Advanced Information Technology · 2012

DOI: 10.5121/ijait.2012.2304 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Advanced Information Technology, 2012. Verfasst von Ashish Saini. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper presents an application of elitistnon-dominated sorting genetic algorithm(NSGA-II) for solving a multi-objective reactive power market clearing (MO-RPMC) model. In this MO-RPMC model, two objective functions such as total payment function (TPF) for reactive po wer support from generators/synchronous condensers and voltage stability enhancement index (VSEI) are optimized simultaneously while satisfying various system equality and inequality constraints in competitive electricity markets which forms a complex mixed integer nonlinearoptimization problem with binary variables . The proposed NSGA-II based MO-RPMC model istested on standard IEEE 24 bus reliability test system. The results obtained in NSGA-II based MO- RPMC model are also compared with the results obtained in real coded genetic algorithm (RCGA) based single -objective RPMC models.

Zitieren

APA

Saini, A. (2012). Solving A Multi-Objective Reactive Power Market Clearing Model Using NSGA-II. International Journal of Advanced Information Technology. https://doi.org/10.5121/ijait.2012.2304

Vancouver

Saini A. Solving A Multi-Objective Reactive Power Market Clearing Model Using NSGA-II. International Journal of Advanced Information Technology. 2012. doi:10.5121/ijait.2012.2304

BibTeX
@article{Saini2012,
  author = {Saini, Ashish},
  title = {Solving A Multi-Objective Reactive Power Market Clearing Model Using NSGA-II},
  journal = {International Journal of Advanced Information Technology},
  year = {2012},
  doi = {10.5121/ijait.2012.2304}
}
Kostenlos starten →