Population variance harmony search algorithm to solve optimal power flow with non-smooth cost function
Result 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.
Keywords
functioncostnon-smoothflowpoweroptimalsolvealgorithmsearchharmonyvariancePopulation
The result's identifiers
Result code in IS VaVaI
Result on the web
DOI - Digital Object Identifier
Alternative languages
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
—
Classification
Type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
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
—
Basic information
Result type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP
IN - Informatics
Year of implementation
2010