Skip to main navigation Skip to search Skip to main content

A column generation approach for solving generation expansion planning problems with high renewable energy penetration

  • Angela Flores-Quiroz
  • , Rodrigo Palma-Behnke
  • , Golbon Zakeri
  • , Rodrigo Moreno

Research output: Contribution to journal › Article › peer-review

98 Scopus citations

Abstract

The high penetration of renewables envisaged for future power systems will significantly increase the need for flexible operational measures and generation technologies, whose associated investment decisions must be properly planned in the long term. To achieve this, expansion models will need to incorporate unit commitment constraints, which can result in large scale MILP problems that require significant computational resources to be solved. In this context, this paper proposes a novel Dantzig-Wolfe decomposition and a column generation approach to reduce the computational burden and overcome intractability. We demonstrate through multiple case studies that the proposed approach outperforms direct application of commercial solvers, significantly reducing both computational times and memory usage. Using the Chilean power system as a reference case, we also confirm and highlight the importance of considering unit commitment constraints in generation expansion models.

Original languageEnglish
Pages (from-to)232-241
Number of pages10
JournalElectric Power Systems Research
Volume136
DOIs
StatePublished - 1 Jul 2016
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 7 - Affordable and Clean Energy
    SDG 7 Affordable and Clean Energy

Keywords

  • Column generation
  • Flexibility
  • Generation expansion planning
  • Renewable energy integration
  • Unit commitment

Fingerprint

Dive into the research topics of 'A column generation approach for solving generation expansion planning problems with high renewable energy penetration'. Together they form a unique fingerprint.

Cite this