Skip to main navigation Skip to search Skip to main content

Improving the AC transmission expansion planning by using initial solutions algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Initial Solutions (IS) are decisive in meta-heuristics based optimization problems since they impact the performance of the optimization process. This research work proposes and compares some random and deterministic algorithms to create initial solutions based on existing expansion planning criteria to solve the AC Transmission Expansion Planning (TEP) problem. The TEP is formulated as a full non-convex optimization problem using the AC network representation. A local version of the Particle Swarm Optimization (LPSO) technique is employed to solve the TEP problem. The Garver 6-bus and IEEE 24-bus test systems are used to evaluate the IS algorithms performance. It is shown that these algorithms have great potential to improve the robustness and computational effort of meta-heuristics.

Original languageEnglish
Title of host publicationProceedings of 2020 IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2020
PublisherIEEE Computer Society
Pages494-498
Number of pages5
ISBN (Electronic)9781728171005
DOIs
StatePublished - 26 Oct 2020
Event10th IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2020 - Delft, Netherlands
Duration: 26 Oct 202028 Oct 2020

Publication series

NameIEEE PES Innovative Smart Grid Technologies Conference Europe
Volume2020-October

Conference

Conference10th IEEE PES Innovative Smart Grid Technologies Europe, ISGT-Europe 2020
Country/TerritoryNetherlands
CityDelft
Period26/10/2028/10/20

Keywords

  • AC model
  • Electric power systems
  • Initial solutions
  • Least-effort criterion
  • Transmission expansion planning

Fingerprint

Dive into the research topics of 'Improving the AC transmission expansion planning by using initial solutions algorithms'. Together they form a unique fingerprint.

Cite this