da Silva, Emivan F.Rahmani, MohsenRider, Marcos J. [UNESP]2018-12-112018-12-112014-01-01Journal of Control, Automation and Electrical Systems, v. 26, n. 1, p. 57-67, 2014.2195-38992195-3880http://hdl.handle.net/11449/167746This paper proposes a linear disjunctive model to solve a multistage transmission expansion planning problem (MTEP) considering N - 1 security constraints. The use of a disjunctive linear model guarantees finding the optimum solution of the problems using existing classical optimization methods. For large-scale systems, when finding the optimum or even high-quality solutions of the MTEP problem is not possible in polynomial time, a search space reduction methodology (SSRM) is proposed. By using SSRM, it is possible to obtain very high-quality solutions or in most cases the optimum solution of the MTEP problem. The N - 1 security constraint indicates that the transmission system must be expanded in such a way that, despite the outage of a system line (a pre-defined set of contingencies), the system continues to operate properly. The model was implemented using a modelling language for mathematical programming (AMPL) and solved using the CPLEX, which is a commercial solver. The IEEE 24-bus, Colombian 93-bus, and Bolivian 57-bus systems are used to evaluate and show the performance of the proposed mathematical model and the search space reduction strategy.57-67engDisjunctive linear modelN-1 security constraintsSearch space reduction methodologyTransmission network expansion planningArtigo10.1007/s40313-014-0154-2Acesso aberto2-s2.0-849212936242-s2.0-84921293624.pdf