Skip to main content
Log in

A Search Space Reduction Strategy and a Mathematical Model for Multistage Transmission Expansion Planning with \(N-1\) Security Constrains

  • Published:
Journal of Control, Automation and Electrical Systems Aims and scope Submit manuscript

Abstract

This 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Abbreviations

\(\alpha _t\) :

Discount factor used to calculate the net present value of the investment at stage \(t\)

\(c_{ij}\) :

The investment cost of transmission lines in corridor \(ij\)

\(w_{ij,y,t}\) :

Binary variable used to model candidate line \(y\) in corridor \(ij\), stage \(t\)

\(f_{ij,y,c,t}\) :

Active power flow of candidate line \(y\) in corridor \(ij\), scenario \(c\) and stage \(t\)

\(f_{ij,c,t}^0\) :

Active power flow of existing lines in the base topology in corridor \(ij\), scenario \(c\) and stage \(t\)

\(g_{i,c,t}\) :

Active power generation in bus \(i\), contingency \(c\) and stage \(t\)

\(d_{i,t}\) :

Active power demand in bus \(i\) and stage \(t\)

\(n_{ij}^{0}\) :

Number of existing lines in the base topology in corridor \(ij\)

\(N_{ij,c}^{\text{ cont }}\) :

Elements of contingency matrix \(N^{\text{ cont }}\). For scenario \(c\), it is equal 1 if an outage for a line in corridor \(ij\) occurs; if equal 0 the line is in normal operation

\(\theta _{i,c,t}\) :

Voltage phase angle in bus \(i\), scenario \(c\) and stage \(t\)

\(x_{ij}\) :

Reactants of transmission line in corridor \(ij\)

\(\overline{f}_{ij,c}\) :

Maximum active power flow for a line in corridor \(ij\) and scenario \(c\)

\(M\) :

Enough large number used in disjunctive model

\(\overline{g}_{i,t,c}\) :

Maximum active power generation in bus \(i\), scenario \(c\) and stage \(t\)

\(\overline{n}_{ij}\) :

Maximum number of lines that can be added to the corridor \(ij\)

\(\text{ ref }\) :

Reference bus

\(\varOmega _b\) :

Set of buses

\(C\) :

Set of operation scenarios, where \(C\in C^{0}\cup C^{1}\cup C^{2}\) contains three different scenarios: the base case scenario (without contingency in lines) \(C^{0}\), the set of contingency scenarios in existing lines \(C^{1}\) and the set of contingency scenarios in candidate lines \(C^{2}\). Note that each scenario \(c\in C\) represents an operation state of the system

\(T\) :

Set of stages

\(\varOmega _l\) :

Set of corridors

\(Y\) :

Set of candidate transmission lines

\(E_t\) :

Set of solutions in stage \(t\)

References

  • Asadamongkol, S., & Eua-arporn, B. (2009). Transmission system expansion planning with consideration of \(n-1\) security constraint. In International conference on electrical engineering/electronics, computer, telecommunications and information technology, Pattaya, Chonburi (Vol. 1, pp. 218–221).

  • CEIDS. (2012). Transmission operations—Contingency analysis baseline function. http://www.intelligrid.info/IntelliGrid_Architecture/Use_Cases/TO_Contingency_Analysis_Baseline.htm.

  • CPLEX. (2010). Optimization subroutine library guide and reference, version 12.2. Incline Village, NV: CPLEX Division, ILOG Inc.

  • da Silva, E. F. (2013). Planejamento Estocástico da Expansão da Rede de Transmissão de Energia Elétrica Multiestágio Considerando Restrições de Segurança (Stochastic programming for the Multistage Transmission Expansion Planning Considering Security Constraints). Doutorado em engenharia elétrica. Universidade Estadual Paulista. Faculdade de Engenharia de Ilha Solteira, Ilha Solteira, SP.

  • da Silva, E. F., Resende, A. S., & Rider, M. J. (2013). Planejamento da expansão da rede de transmissão multiestágio com cenários e restrições de segurança (multistage transmission expansion planning with scenarios and security constraints), \(45^\circ \) simpósio brasileiro de pesquisa operacional. Natal, Rio Grande do Norte, Brazil.

  • Fourer, R., Gay, D. M., & Kernighan, B. W. (2003). AMPL: A modeling language for mathematical programming. Pacific Grove, CA: Brooks/Cole-Thomson Learning.

    Google Scholar 

  • Garver, L. L. (1970). Transmission network estimation using linear programming. IEEE Transactions on Power Apparatus and Systems, 89(7), 1688–1697.

    Article  Google Scholar 

  • Haffner, S., Monticelli, A., Garcia, A. V., & Romero, R. (2001). Specialized branch and bound algorithm for transmission network expansion planning. IEE Proceedings of Generation, Transmission and Distribution, 148(5), 482–488.

    Article  Google Scholar 

  • LAPSEE. (2012). Transmission expansion planning test systems. www.feis.unesp.br/#!/departamentos/engenharia-eletrica/pesquisas-e-projetos/lapsee/downloads/.

  • Lu, M., Dong, Z. Y., & Saha, T. K. (2005). A framework for transmission planning in a competitive electricity market. In IEEE/PES transmission and distribution conference and exposition: Asia and Pacific (p. 16).

  • Maghouli, P., Hosseini, S. H., Buygi, M. O., & Shahidehpour, M. (2009). A multi-objective framework for transmission expansion planning in deregulated environments. IEEE Transactions on Power Systems, 24(2), 1051–1061.

    Article  Google Scholar 

  • Monticelli, A., Santos, A, Jr, Pereira, M. V. F., Cunha, S. H., Parker, B. J., & Praça, J. C. G. (1982). Interactive transmission network planning using a least-effort criterion. IEEE Transactions on Power Apparatus and Systems, PAS–101(10), 3919–3925.

    Article  Google Scholar 

  • Oliveira, G. C., S., Pereira, M. V. F., & Thomé, L. M. (2004). Multi-stage transmission expansion planning considering multiple dispatches and contingency criterion, Anais do XV Congresso Brasileiro de Automática (CBA 2004) (pp. 1–5). Universidade Federal do Rio Grande do Sul, Gramado, Brazil.

  • Rahmani, M., Romero, R., & Rider, M. (2013). Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem. IEEE Transactions on Power Systems, 28(3), 2164–2173.

    Article  Google Scholar 

  • Romero, R., Monticelli, A., Garcia, A., & Haffner, S. (2002). Test systems and mathematical models for transmission network expansion planning. IEE Proceedings of Generation, Transmission and Distribution, 149(1), 27–36.

    Article  Google Scholar 

  • Samarakoon, H., Shrestha, R., & Fujiwara, O. (2001). A mixed integer linear programming model for transmission expansion planning with generation location selection. Electrical Power and Energy Systems, 23(4), 285–293.

    Article  Google Scholar 

  • Seifu, A., Salon, S., & List, G. (1989). Optimization of transmission line planning including security constraints. IEEE Transactions on Power Systems, 4(4), 1507–1513.

    Article  Google Scholar 

  • Silva, I. J., Rider, M. J., Romero, R., Garcia, A. V., & Murari, C. A. (2005). Transmission network expansion planning with security constraints. IEE Proceedings of Generation, Transmission and Distribution, 152(6), 828–836.

    Article  Google Scholar 

  • Verma, A., Bijwe, P. R., & Panigrahi, B. K. (2009). Heuristic method for transmission network expansion planning with security constraints and uncertainty in load specifications. In Transmission and distribution conference and exposition: Asia and Pacific, Seoul (pp. 1–4).

  • Verma, A., Bijwe, P. R., & Panigrahi, B. K. (2010). Harmony search algorithm for transmission network expansion planning. Generation, Transmission & Distribution, IET, 4(6), 663–673.

    Article  Google Scholar 

  • Vinasco, G., Rider, M., & Romero, R. (2011). A strategy to solve the multistage transmission expansion planning problem. IEEE Transactions on Power Systems, 26(4), 2574–2576.

    Article  Google Scholar 

  • Wood, A. J., Wollenberg, B. F., & Sheblé, G. B. (2013). Power generation, operation and control (3rd ed.). New York: Wiley.

    Google Scholar 

  • Xu, Z., Dong, Z. Y., & Wong, K. P. (2006). A hybrid planning method for transmission networks in a deregulated environment. IEEE Transactions on Power Systems, 21(2), 925–932.

    Article  Google Scholar 

  • Xu, Z., Dong, Z. Y., Wong, K. P., & Fan, Z. (2009). Multi-objective transmission planning. In Power and energy engineering conference: Asia and Pacific, Wuhan (pp. 1–4).

Download references

Acknowledgments

This work was supported by FAPESP and CAPES.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcos J. Rider.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

da Silva, E.F., Rahmani, M. & Rider, M.J. A Search Space Reduction Strategy and a Mathematical Model for Multistage Transmission Expansion Planning with \(N-1\) Security Constrains. J Control Autom Electr Syst 26, 57–67 (2015). https://doi.org/10.1007/s40313-014-0154-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40313-014-0154-2

Keywords

Navigation