An Exploration of the Network Installation and Recovery Problem with Blackstart Nodes
The Neighbor Aided Network Installation Problem asks how best to install the nodes in a network under the assumption that the cost of installing a node depends solely on the number of its neighbors which have been previously installed. We study a version which incorporates blackstart nodes into the model. Under the assumption of a decreasing convex cost function and a single blackstart node, we solve the problem for subclasses of almost-complete and augmented-tree networks. We also describe two heuristics and present experimental results on real world networks.
KeywordsNetwork models Network recovery Blackstart nodes
We are grateful to Pomona College for helping fund this work.
- 1.Adibi, M.M., Fink, L.H.: Power system restoration planning. IEEE Trans. Power Syst. 9(1), 22–28 (1994)Google Scholar
- 2.Atkins, K., Chen, J., Kumar, V.A., Marathe, A.: The structure of electrical networks: a graph theory-based analysis. Int. J. Crit. Infrastruct. 5(3), 265–284 (2009)Google Scholar
- 4.Gutfraind, A., Bradonjić, M., Novikoff, T.: Modelling the neighbour aid phenomenon for installing costly complex networks. J. Complex Netw. (2014). https://doi.org/10.1093/comnet/cnu033
- 5.Gutfraind, A., Kun, J., Lelkes, Á.D., Reyzin, L.: Network installation and recovery: approximation lower bounds and faster exact formulations. CoRR abs/1411.3640 (2014). http://arxiv.org/abs/1411.3640
- 10.Wikipedia: North American Electric Reliability Corporation. https://en.wikipedia.org/wiki/North_American_Electric_Reliability_Corporation. Accessed 27 July 2018