An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The L-shaped method is a decomposition algorithm that is commonly used to solve large-scale two-stage stochastic programming problems. The classic single-cut L-shaped method usually suffer the performance issue because only a single optimality cut is applied at each major iteration. This paper presents an aggregated multi-cut version of the L-shaped method for solving two-stage transmission expansion planning (TEP) problems. This algorithm allows the user to control the aggregation level of the optimality cuts so that the overall computational performance can be improved. Simulation results show that the proposed algorithm is computationally more efficient than the classical L-shaped method.

Original languageEnglish (US)
Title of host publicationIEEE Power and Energy Society General Meeting
PublisherIEEE Computer Society
Volume2015-September
ISBN (Print)9781467380409
DOIs
StatePublished - Sep 30 2015
EventIEEE Power and Energy Society General Meeting, PESGM 2015 - Denver, United States
Duration: Jul 26 2015Jul 30 2015

Other

OtherIEEE Power and Energy Society General Meeting, PESGM 2015
CountryUnited States
CityDenver
Period7/26/157/30/15

Fingerprint

Decomposition
Planning
Stochastic programming
Agglomeration

Keywords

  • Algorithm
  • decomposition
  • L-shaped method
  • transmission expansion planning
  • uncertainty

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Nuclear Energy and Engineering
  • Renewable Energy, Sustainability and the Environment
  • Electrical and Electronic Engineering

Cite this

Zhang, H., Vittal, V., & Heydt, G. (2015). An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems. In IEEE Power and Energy Society General Meeting (Vol. 2015-September). [7285608] IEEE Computer Society. https://doi.org/10.1109/PESGM.2015.7285608

An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems. / Zhang, Hui; Vittal, Vijay; Heydt, Gerald.

IEEE Power and Energy Society General Meeting. Vol. 2015-September IEEE Computer Society, 2015. 7285608.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, H, Vittal, V & Heydt, G 2015, An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems. in IEEE Power and Energy Society General Meeting. vol. 2015-September, 7285608, IEEE Computer Society, IEEE Power and Energy Society General Meeting, PESGM 2015, Denver, United States, 7/26/15. https://doi.org/10.1109/PESGM.2015.7285608
Zhang H, Vittal V, Heydt G. An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems. In IEEE Power and Energy Society General Meeting. Vol. 2015-September. IEEE Computer Society. 2015. 7285608 https://doi.org/10.1109/PESGM.2015.7285608
Zhang, Hui ; Vittal, Vijay ; Heydt, Gerald. / An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems. IEEE Power and Energy Society General Meeting. Vol. 2015-September IEEE Computer Society, 2015.
@inproceedings{2cebea983f484226957a232cc6a315a7,
title = "An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems",
abstract = "The L-shaped method is a decomposition algorithm that is commonly used to solve large-scale two-stage stochastic programming problems. The classic single-cut L-shaped method usually suffer the performance issue because only a single optimality cut is applied at each major iteration. This paper presents an aggregated multi-cut version of the L-shaped method for solving two-stage transmission expansion planning (TEP) problems. This algorithm allows the user to control the aggregation level of the optimality cuts so that the overall computational performance can be improved. Simulation results show that the proposed algorithm is computationally more efficient than the classical L-shaped method.",
keywords = "Algorithm, decomposition, L-shaped method, transmission expansion planning, uncertainty",
author = "Hui Zhang and Vijay Vittal and Gerald Heydt",
year = "2015",
month = "9",
day = "30",
doi = "10.1109/PESGM.2015.7285608",
language = "English (US)",
isbn = "9781467380409",
volume = "2015-September",
booktitle = "IEEE Power and Energy Society General Meeting",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - An aggregated multi-cut decomposition algorithm for two-stage transmission expansion planning problems

AU - Zhang, Hui

AU - Vittal, Vijay

AU - Heydt, Gerald

PY - 2015/9/30

Y1 - 2015/9/30

N2 - The L-shaped method is a decomposition algorithm that is commonly used to solve large-scale two-stage stochastic programming problems. The classic single-cut L-shaped method usually suffer the performance issue because only a single optimality cut is applied at each major iteration. This paper presents an aggregated multi-cut version of the L-shaped method for solving two-stage transmission expansion planning (TEP) problems. This algorithm allows the user to control the aggregation level of the optimality cuts so that the overall computational performance can be improved. Simulation results show that the proposed algorithm is computationally more efficient than the classical L-shaped method.

AB - The L-shaped method is a decomposition algorithm that is commonly used to solve large-scale two-stage stochastic programming problems. The classic single-cut L-shaped method usually suffer the performance issue because only a single optimality cut is applied at each major iteration. This paper presents an aggregated multi-cut version of the L-shaped method for solving two-stage transmission expansion planning (TEP) problems. This algorithm allows the user to control the aggregation level of the optimality cuts so that the overall computational performance can be improved. Simulation results show that the proposed algorithm is computationally more efficient than the classical L-shaped method.

KW - Algorithm

KW - decomposition

KW - L-shaped method

KW - transmission expansion planning

KW - uncertainty

UR - http://www.scopus.com/inward/record.url?scp=84956860791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956860791&partnerID=8YFLogxK

U2 - 10.1109/PESGM.2015.7285608

DO - 10.1109/PESGM.2015.7285608

M3 - Conference contribution

SN - 9781467380409

VL - 2015-September

BT - IEEE Power and Energy Society General Meeting

PB - IEEE Computer Society

ER -