Skip to main content
SpringerLink
Log in

A Node-Depth Encoding-Based Tabu Search Algorithm for Power Distribution System Restoration

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

Abstract

This paper presents a new algorithm to solve the distribution power system restoration problem based on a joint application of tabu search (TS) algorithm and the node-depth encoding (NDE). The integration of NDE, its operators, and the TS algorithm results in a methodology that combines the best of each technique. The main purpose of the proposed meta-heuristic approach is to minimize the costs involved in the restoration process while electrical and operational constraints are met. Simulation results for three scenarios of a modified IEEE 37-node test case are presented. The results show the computational performance and the robustness of the proposed algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Abbreviations

B :

Set of busses of the system;

S :

Set of circuits;

T :

Set of substation power transformers.

\(I_{\mathrm{km}}^{\mathrm{MAX}}\) :

Maximum current limit for branch km;

\(S_{k,t}^{\mathrm{MAX}}\) :

Maximum apparent power limit for transformer t, located at node k;

\(V^{\mathrm{MIN}}\) :

Lower voltage magnitude limit;

\(V^{\mathrm{MAX}}\) :

Upper voltage magnitude limit;

\({\text {OC}}_{\mathrm{km}}\) :

Operating cost of switching device located in branch km;

\({\text {NDDC}}_k\) :

Non-distributed demand cost for node k;

\({\text {SC}}_k\) :

Social cost by load shedding at node k;

\(g_{\mathrm{km}}\) :

km-branch conductance;

\(b_{\mathrm{km}}\) :

km-branch susceptance;

\(P_k\) :

Active power of the load at node k;

\(Q_k\) :

Reactive power of the load at node k;

\(\omega _{\mathrm{km}}^i\) :

Initial status of branch km, assumes 1 if active and zero otherwise.

\(P_{\mathrm{km}}\) :

Active power flows through the branch km;

\(Q_{\mathrm{km}}\) :

Reactive power flows through the branch km;

\(P_{k, t}\) :

Active power flows through the transformer t, located at node k;

\(Q_{k, t}\) :

Reactive power flows through the transformer t, located at node k;

\(V_k\) :

Voltage at node k;

\(\omega _k\) :

Binary variable for status of node k, assumes 1 if energized and zero otherwise;

\(\omega _{\mathrm{km}}\) :

Binary variable for status of branch km, assumes 1 if active and zero otherwise.

References

  • Aiex, R. M., Resende, M. G. C., & Ribeiro, C. C. (2007). TTT plots: A perl program to create time-to-target plots. Optimization Letters, 1, 355–366.

    Article  MathSciNet  MATH  Google Scholar 

  • Aoki, K., Nara, K., Itoh, M., & Satoh, T. (1989). A new algorithm for service restoration in distribution systems. IEEE Transactions on Power Delivery, 4(3), 1832–1839.

    Article  Google Scholar 

  • Baran, M., & Wu, F. (1989). Network reconfiguration in distribution systems for loss reduction and load balancing. IEEE Transactions on Power Delivery, 4(2), 1401–1407.

    Article  Google Scholar 

  • Chin, H. & Su Y.-S. (2005). Application of the ant-based network for power system restoration. In Transmission and distribution conference and exhibition: Asia and Pacific (pp. 1–5).

  • Delbem, A. C. B., Carvalho, A. DE, Policastro, C. A., Pinto, A. K., Honda, K. & Garcia, A. C. (2004). Node-depth encoding for evolutionary algorithms applied to network design. In Genetic and evolutionary computation conference (GECCO-2004) (pp. 678–687). Berlin.

  • Fukuyama, Y., & Chiang, H. (1995). A parallel genetic algorithm for service restoration. In International joint conference of the fourth IEEE international conference on fuzzy systems and the second international fuzzy engineering symposium (Vol. 1, pp. 275–282).

  • Glover, F. (1989). Tabu search—Part I. ORSA Journal on Computing, 1(3), 190–206.

    Article  MATH  Google Scholar 

  • Glover, F. (1990). Tabu search—Part II. ORSA Journal on Computing, 2(1), 4–32.

    Article  MATH  Google Scholar 

  • Glover, F., Laguna, M., & Marti, R. (2007). Principles of tabu search. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. Boca Raton: Chapman & Hall/CRC.

    Google Scholar 

  • IEEE. Distribution test feeders. http://ewh.ieee.org/soc/pes/dsacom/testfeeders/. Accessed 01 June 2015.

  • Kaewmanee, J., & Sirisumrannukul, S. (2011). Service restoration in distribution system using fuzzy decision algorithm and node-depth encoding (pp. 893–896).

  • Li, J., Ma, X.-Y., Liu, C.-C., & Schneider, K. P. (2014). Distribution system restoration with microgrids using spanning tree search. IEEE Transactions on Power Systems, 29(6), 3021–3029.

    Article  Google Scholar 

  • Li, X. D., Xu, Y. Q., & Zhang, L. (2009). Distribution service restoration with DGs based on multi-agent immune algorithm. In 2nd international conference on power electronics and intelligent transportation system (PEITS) (Vol. 2, pp. 1–4).

  • Liu, C., Lee, S. J., & Venkata, S. S. (1988). An expert system operational aid for restoration and loss reduction of distribution systems. IEEE Transactions on Power Systems, 3(2), 619–626.

    Article  Google Scholar 

  • Mathias-Neto, W. P., Leao, F. B., & Mantovani, J. R. S. (2010). Distribution system restoration in a DG environment using a heuristic constructive multi-start algorithm. In Transmission and distribution conference and exposition: Latin America (T D-LA) (pp. 86–91).

  • Mohanty, I., Kalita, J., & Das, S. (2003) Ant algorithms for the optimal restoration of distribution feeders during cold load pickup. In Swarm Intelligence Symposium (pp. 132–137).

  • Mori, H., & Muroi, T. (2011). Application of probabilistic Tabu Search to distribution system service restoration. In IEEE international symposium of circuits and systems (ISCAS) (pp. 1037–1040).

  • Mori, H., & Ogita, Y. (2002). A parallel tabu search based approach to optimal network reconfigurations for service restoration in distribution systems. In Proceedings of the international conference on control applications (Vol. 2, pp. 814–819).

  • Nagata, T., & Sasaki, H. (2002). A multi-agent approach to power system restoration. IEEE Transactions on Power Systems, 17(2), 457–462.

    Article  Google Scholar 

  • Nara, K. (1992). Implementation of genetic algorithm for distribution systems loss minimum re-configuration. Transactions on Power Systems, 7(3), 1044–1051.

    Article  Google Scholar 

  • Sanches, D. (2013). Algoritmos Evolutivos Multi-Objetivo para Reconfiguraçao de Redes em Sistemas de Distribuiçao de Energia Elétrica. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-26032013-080436/en.php. Accessed 01 Nov 2014.

  • Sanches, D. S., London Junior, J. B. A., & Delbem, A. C. B. (2014). Multi-objective evolutionary algorithm for single and multiple fault service restoration in large-scale distribution systems. Electric Power Systems Research, 110, 144–153.

    Article  Google Scholar 

  • Santos, A. C., Delbem, A. C. B., London, J. B. A., & Bretas, N. G. (2010). Node-depth encoding and multiobjective evolutionary algorithm applied to large-scale distribution system reconfiguration. IEEE Transactions on Power Systems, 25(3), 1254–1265.

    Article  Google Scholar 

  • Shirmohammadi, D. (1988). A compensation-based power flow method for weakly meshed distribution and transmission networks. IEEE Transactions on Power Systems, 3(2), 753–762.

    Article  Google Scholar 

  • Toune, S., Fudo, H., & Genji, T. (1998) A reactive tabu search for service restoration in electric power distribution systems. In Proceedings of IEEE international conference on evolutionary computation (pp. 763–768).

  • Toune, S., Fudo, H., Genji, T., Fukuyama, Y., & Nakanishi, Y. (2002). Comparative study of modern heuristic algorithms to service restoration in distribution systems. IEEE Transactions on Power Delivery, 17(1), 173–181.

    Article  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge the Ilha Solteira Education and Research Foundation—FEPISA (Grant 011/2011), São Paulo Research Foundation—FAPESP (Grant 2013/23590-8) and National Counsel of Technological and Scientific Development—CNPq (Grant 305371/2012-6) for their economic support for this project.

Author information

Authors and Affiliations

  1. LaPSEE - Power System Planning Lab, Department of Electrical Engineering, UNESP - Univ Estadual Paulista, Campus of Ilha Solteira, Ilha Solteira, São Paulo, Brazil

    Waldemar Pereira Mathias-Neto & José Roberto Sanches Mantovani

Authors
  1. Waldemar Pereira Mathias-Neto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Roberto Sanches Mantovani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Waldemar Pereira Mathias-Neto.

Appendix

Appendix

The modified IEEE-37-bus test system used by this paper to run all the simulations is shown at Fig. 5.

Table 5 The modified IEEE-37-bus test system
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mathias-Neto, W.P., Mantovani, J.R.S. A Node-Depth Encoding-Based Tabu Search Algorithm for Power Distribution System Restoration. J Control Autom Electr Syst 27, 317–327 (2016). https://doi.org/10.1007/s40313-016-0234-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40313-016-0234-6

Keywords

Search

Navigation