Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal Power Flow Based on Genetic Algorithms and Clustering Techniques
KTH, School of Electrical Engineering and Computer Science (EECS), Electric Power and Energy Systems. (Integration of Renewable Energy Sources (IRES))ORCID iD: 0000-0002-5263-1950
KTH, School of Electrical Engineering and Computer Science (EECS), Electric Power and Energy Systems. (Integration of Renewable Energy Sources (IRES))ORCID iD: 0000-0002-8189-2420
2018 (English)In: Power Systems Computational Conference PSCC 2018, IEEE conference proceedings, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Optimal power flow problems have been studied extensively for the past decades. Two approaches for solving theproblem have been distinguished: mathematical programming and evolutionary algorithms. The first is fast but is not converging to a global optimum for every case. The second ones are robust but time-consuming. This paper proposes a method that combines both approaches to eliminate their flaws and take advantage of their benefits. The method uses properties of genetic algorithms to group their chromosomes around optima in the search space. The centers of these groups are identified by clustering techniques and furthermore used as initial points for gradient based search methods. At the end, the proposed method finds global optimum and its closest local optima. Continuous Newton-Raphson method is used to overcome ill-conditioned points in a search space when calculating power flows. The proposed method is compared against similar methods showing considerable improvement.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2018.
Keywords [en]
Continuous Newton-Raphson, Convex Optimization, Genetic Algorithm, K-means, Optimal Power Flow
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-231394ISI: 000447282400057OAI: oai:DiVA.org:kth-231394DiVA, id: diva2:1227998
Conference
Power Systems Computational Conference PSCC 2018
Projects
Volatile
Note

QC 20180627

Available from: 2018-06-27 Created: 2018-06-27 Last updated: 2018-11-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Stankovic, StefanSöder, Lennart

Search in DiVA

By author/editor
Stankovic, StefanSöder, Lennart
By organisation
Electric Power and Energy Systems
Other Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 119 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf