TY - JOUR
T1 - Spatial Power Network Expansion Planning Considering Generation Expansion
AU - Shu, Jun
AU - Wu, Lei
AU - Zhang, Lizi
AU - Han, Bing
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/7/1
Y1 - 2015/7/1
N2 - This paper introduces an efficient approach on static spatial power network expansion planning integrated with generation expansion, while considering complicated environments based on the raster map in geographic information systems (GIS). Candidate plants could be built on any cell in the map, which means that terminals of candidate lines connected to candidate plants are not fixed. This is a remarkable difference from the literature in which the terminals of candidate lines are fixed. The objective is to minimize the total system cost, subject to prevailing investment and operation constraints. The model is formulated as a mixed-integer linear programming (MILP) problem via integer algebra techniques. A two-step approach is proposed to address the computational complexity. The first step searches optimal electric line routes via dynamic programming, while the second step solves a simplified MILP problem for obtaining final optimal generation and transmission planning strategies based on optimal line routes derived from the first step. In most cases, the proposed two-step approach would derive the same global optimal solutions as those by solving the original formulation directly. Thus, the proposed two-step approach can significantly improve the computational efficiency while maintaining the solution optimality. Numerical examples demonstrate the effectiveness of the proposed approach.
AB - This paper introduces an efficient approach on static spatial power network expansion planning integrated with generation expansion, while considering complicated environments based on the raster map in geographic information systems (GIS). Candidate plants could be built on any cell in the map, which means that terminals of candidate lines connected to candidate plants are not fixed. This is a remarkable difference from the literature in which the terminals of candidate lines are fixed. The objective is to minimize the total system cost, subject to prevailing investment and operation constraints. The model is formulated as a mixed-integer linear programming (MILP) problem via integer algebra techniques. A two-step approach is proposed to address the computational complexity. The first step searches optimal electric line routes via dynamic programming, while the second step solves a simplified MILP problem for obtaining final optimal generation and transmission planning strategies based on optimal line routes derived from the first step. In most cases, the proposed two-step approach would derive the same global optimal solutions as those by solving the original formulation directly. Thus, the proposed two-step approach can significantly improve the computational efficiency while maintaining the solution optimality. Numerical examples demonstrate the effectiveness of the proposed approach.
KW - Dynamic programming
KW - generation expansion
KW - geographic information systems
KW - mixed-integer linear programming
KW - power network planning
KW - routing
UR - http://www.scopus.com/inward/record.url?scp=84933544200&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84933544200&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2014.2358237
DO - 10.1109/TPWRS.2014.2358237
M3 - Article
AN - SCOPUS:84933544200
SN - 0885-8950
VL - 30
SP - 1815
EP - 1824
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 4
M1 - 6913023
ER -