Population variance harmony search algorithm to solve optimal power flow with non-smooth cost function

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86092839" target="_blank" >RIV/61989100:27240/10:86092839 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-04317-8_6" target="_blank" >http://dx.doi.org/10.1007/978-3-642-04317-8_6</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-04317-8_6" target="_blank" >10.1007/978-3-642-04317-8_6</a>

Result language

angličtina

Original language name

Population variance harmony search algorithm to solve optimal power flow with non-smooth cost function

Original language description

This chapter presents a novel Harmony Search (HS) algorithm used to solve security constrained optimal power flow (OPF) with various generator fuel cost characteristics. HS is a recently developed derivative-free, meta-heuristic optimization algorithm, which draws inspiration from the musical process of searching for a perfect state of harmony. This chapter analyses the evolution of the population-variance over successive generations in HS and thereby draws some important attention regarding the explorative power of HS. This novel methodology of modified population variance harmony search algorithm (PVHS) easily takes care of solving optimal power flow problem even with non-smooth and piecewise cost functions. This PVHS algorithm was tested on the IEEE30 bus system with three different types of cost characteristics and compared with other reported results. 2010 Springer-Verlag Berlin Heidelberg.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: XML data processing</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Studies in Computational Intelligence

ISSN

1860-949X

e-ISSN

—

Volume of the periodical

270

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

11

Pages from-to

65-75

UT code for WoS article

—

EID of the result in the Scopus database

—