Contingency-Constrained Transmission Expansion Planning Considering a Representative Daily Demand Curve

Abstract

The Transmission Expansion Planning (TEP) problem determines the optimal investments for certain candidates’ transmission lines in an electric power system. The TEP problem considers and implements the N-1 security criterion in all periods of planning and operation. This paper introduces a novel approach to reduce the computation time and memory used when modeling the TEP problem considering the security criterion N-1. Several popular commercial solvers are used to evaluate the computational efficiency of the proposed TEP approach.