Transmission expansion planning via a constructive heuristic algorithm in restructured electricity industry

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

9 Citations (Scopus)

Abstract

The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.

Original languageEnglish
Title of host publicationProceedings of the 2013 3rd International Conference on Electric Power and Energy Conversion Systems, EPECS 2013
Number of pages6
DOIs
Publication statusPublished - 2013
MoE publication typeA4 Conference publication
EventInternational Conference on Electric Power and Energy Conversion Systems - Istanbul, Türkiye
Duration: 2 Oct 20134 Oct 2013
Conference number: 3

Conference

ConferenceInternational Conference on Electric Power and Energy Conversion Systems
Abbreviated titleEPECS
Country/TerritoryTürkiye
CityIstanbul
Period02/10/201304/10/2013

Keywords

  • Constructive heuristic algorithm
  • hybrid model
  • Multiple generating scenarios
  • Open access
  • Transmission expansion planning

Fingerprint

Dive into the research topics of 'Transmission expansion planning via a constructive heuristic algorithm in restructured electricity industry'. Together they form a unique fingerprint.

Cite this