Network expansion planning considering N-1 security criterion by iterative mixed-integer programming approach

Zechun Hu, Furong Li

Research output: Chapter in Book/Report/Conference proceedingChapter

9 Citations (Scopus)

Abstract

A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solve them iteratively. The aim of upper level problem is to solve the mixed-integer programming model with all identified constraints. For the lower level problem, all N-1 contingencies are checked one by one and the corresponding constraints are added the upper level problem if line overload or network split is found. Each constraint is formed based on rigorous sensitivity or network topology analysis. The iteration between the two subproblems stops till a satisfactory planning solution is reached. Test results on two systems show effectiveness of the proposed method.
Original languageEnglish
Title of host publicationIEEE Power and Energy Society General Meeting 2010
Place of PublicationNew York
PublisherIEEE
ISBN (Print)978-1-4244-8357-0
DOIs
Publication statusPublished - Sep 2010

Fingerprint

Integer programming
Planning
Topology

Cite this

Network expansion planning considering N-1 security criterion by iterative mixed-integer programming approach. / Hu, Zechun; Li, Furong.

IEEE Power and Energy Society General Meeting 2010. New York : IEEE, 2010.

Research output: Chapter in Book/Report/Conference proceedingChapter

Hu, Zechun ; Li, Furong. / Network expansion planning considering N-1 security criterion by iterative mixed-integer programming approach. IEEE Power and Energy Society General Meeting 2010. New York : IEEE, 2010.
@inbook{d072cfee50934b18a9ad60e8110c08bd,
title = "Network expansion planning considering N-1 security criterion by iterative mixed-integer programming approach",
abstract = "A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solve them iteratively. The aim of upper level problem is to solve the mixed-integer programming model with all identified constraints. For the lower level problem, all N-1 contingencies are checked one by one and the corresponding constraints are added the upper level problem if line overload or network split is found. Each constraint is formed based on rigorous sensitivity or network topology analysis. The iteration between the two subproblems stops till a satisfactory planning solution is reached. Test results on two systems show effectiveness of the proposed method.",
author = "Zechun Hu and Furong Li",
note = "PES General Meeting. 25-29 July 2010. Minneapolis, MN.",
year = "2010",
month = "9",
doi = "10.1109/PES.2010.5589271",
language = "English",
isbn = "978-1-4244-8357-0",
booktitle = "IEEE Power and Energy Society General Meeting 2010",
publisher = "IEEE",
address = "USA United States",

}

TY - CHAP

T1 - Network expansion planning considering N-1 security criterion by iterative mixed-integer programming approach

AU - Hu, Zechun

AU - Li, Furong

N1 - PES General Meeting. 25-29 July 2010. Minneapolis, MN.

PY - 2010/9

Y1 - 2010/9

N2 - A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solve them iteratively. The aim of upper level problem is to solve the mixed-integer programming model with all identified constraints. For the lower level problem, all N-1 contingencies are checked one by one and the corresponding constraints are added the upper level problem if line overload or network split is found. Each constraint is formed based on rigorous sensitivity or network topology analysis. The iteration between the two subproblems stops till a satisfactory planning solution is reached. Test results on two systems show effectiveness of the proposed method.

AB - A methodology to solve the network expansion planning problem considering N-1 security criterion is proposed. The main idea to achieve the desired results is to separate the whole problem into two subproblems and solve them iteratively. The aim of upper level problem is to solve the mixed-integer programming model with all identified constraints. For the lower level problem, all N-1 contingencies are checked one by one and the corresponding constraints are added the upper level problem if line overload or network split is found. Each constraint is formed based on rigorous sensitivity or network topology analysis. The iteration between the two subproblems stops till a satisfactory planning solution is reached. Test results on two systems show effectiveness of the proposed method.

UR - http://dx.doi.org/10.1109/PES.2010.5589271

U2 - 10.1109/PES.2010.5589271

DO - 10.1109/PES.2010.5589271

M3 - Chapter

SN - 978-1-4244-8357-0

BT - IEEE Power and Energy Society General Meeting 2010

PB - IEEE

CY - New York

ER -