Abstract
Consideration is given to the problem of changing the structure of networks with reservation of lines between resources and their consumers when emergencies occur for the purpose of localization of faults and restoration of resource delivery lines. A definition of the limiting graph of reconfiguration is introduced. Using this graph, we design algorithms for finding the minimum set of vertexes the change of whose state leads to the restoration of resource delivery lines.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Idel’chik, V.I., Elektricheskie sistemy i seti (Electrical Systems and Networks), Moscow: Energoatomizdat, 1989.
Grebenyuk, G.G. and Krygin, A.A., Algorithmization for Solving Problems of Heat Networks Control in Emergencies, Datchiki Sist., 2004, no. 10, pp. 46–51.
Author information
Authors and Affiliations
Additional information
Original Russian Text © G.G. Grebenyuk, A.A. Krygin, 2007, published in Avtomatika i Telemekhanika, 2007, No. 12, pp. 101–112.
Rights and permissions
About this article
Cite this article
Grebenyuk, G.G., Krygin, A.A. Algorithms for optimization of the number of switchings in heat supply networks reconfiguration. Autom Remote Control 68, 2187–2197 (2007). https://doi.org/10.1134/S0005117907120077
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0005117907120077