Abstract
In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. The proposed randomized algorithm consists of growing several subgraphs in parallel. The quality of solutions generated in this way is further improved using a local search which exploits neighboring relations between the subgraphs. In order to evaluate the performance of the method, an algorithm for generating pseudo-random unit disc graphs with known optimal solutions is created. Computational experiments have also been conducted on graphs representing electrical distribution systems for the real-world problem of dividing them into a system of fault tolerant interconnected microgrids. The experiments show that the proposed method frequently manages to find optimal solutions and has an average error of only a few percent to known optimal solutions. Further, it manages to find high quality approximate solutions for graphs having up to 10,000 nodes in reasonable time.
Similar content being viewed by others
References
Arefifar, S.A., Mohamed, Y.A.R.I., EL-Fouly, T.H.: Supply-adequacy-based optimal construction of microgrids in smart distribution systems. IEEE Trans. Smart Grid 3(3), 1491–1502 (2012)
Arefifar, S.A., Mohamed, Y., EL-Fouly, T.H.: Comprehensive operational planning framework for self-healing control actions in smart distribution grids. IEEE Trans. Power Syst. 28(4), 4192–4200 (2013)
Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings, vol. 2, pp. 1028–1037. IEEE (2001)
Bazgan, C., Tuza, Z., Vanderpooten, D.: Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2), 271–280 (2010)
Borra, D., Pasqualetti, F., Bullo, F.: Continuous graph partitioning for camera network surveillance. Automatica 52, 227–231 (2015)
Buchanan, A., Sung, J.S., Butenko, S., Pasiliao, E.L.: An integer programming approach for fault-tolerant connected dominating sets. INFORMS J. Comput. 27(1), 178–188 (2015)
Chang, Y.C., Lin, Z.S., Chen, J.L.: Cluster based self-organization management protocols for wireless sensor networks. IEEE Trans. Consum. Electron. 52(1), 75–80 (2006)
Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2), 243–278 (2005)
Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995)
do Forte, V.L., Lucena, A., Maculan, N.: Formulations for the minimum 2-connected dominating set problem. Electron. Notes Discrete Math. 41, 415–422 (2013)
Goldschmidt, O., Takvorian, A., Yu, G.: On finding a biconnected spanning planar subgraph with applications to the facilities layout problem. Eur. J. Oper. Res. 94(1), 97–105 (1996)
Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)
Hatziargyriou, N., Asano, H., Iravani, R., Marnay, C.: Microgrids. IEEE Power Energy Mag. 5(4), 78–94 (2007)
Hochbaum, D.S.: Why should biconnected components be identified first. Discrete Appl. Math. 42(2), 203–210 (1993)
Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973a)
Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135–158 (1973b)
Hu, B., Leitner, M., Raidl, G.R.: The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search. Networks 55(3), 256–275 (2010)
Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4), 627–650 (2008)
Ito, T., Hara, T., Zhou, X., Nishizeki, T.: Minimum cost partitions of trees with supply and demand. Algorithmica 64(3), 400–415 (2012)
Jovanovic, R.: Benchmark data sets for the problem of the maximal bi-connected partitioning of a graph with a size constraint. http://mail.ipb.ac.rs/~rakaj/home/mbcpg_sc.htm (2017)
Jovanovic, R., Tuba, M.: Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput. Sci. Inf. Syst. 10(1), 133–149 (2013)
Jovanovic, R., Voß, S.: A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs. Opt. Lett. 10(8), 1693–1703 (2016)
Jovanovic, R., Bousselham, A., Voss, S.: A heuristic method for solving the problem of partitioning graphs with supply and demand. Ann. Oper. Res. 235(1), 371–393 (2015a)
Jovanovic, R., Bousselham, A., Voss, S.: Partitioning of supply/demand graphs with capacity limitations: an ant colony approach. J. Comb. Optim. (2015b). doi:10.1007/s10878-015-9945-z
Jovanovic, R., Bousselham, A., Bayram, I.S.: Residential demand response scheduling with consideration of consumer preferences. Appl. Sci. 6(1), 16 (2016a)
Jovanovic, R., Tuba, M., Voss, S.: An ant colony optimization algorithm for partitioning graphs with supply and demand. Appl. Soft Comput. 41, 317–330 (2016b)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pp. 69–78. ACM (2003)
Li, X., Zhang, Z.: Two algorithms for minimum 2-connected r-hop dominating set. Inf. Process. Lett. 110(22), 986–991 (2010)
Matic, D., Bozic, M.: Maximally balanced connected partition problem in graphs: application in education. Teach. Math. 15(2), 121–132 (2012)
Moraes, R.E., Ribeiro, C.C.: Power optimization in ad hoc wireless network topology control with biconnectivity requirements. Comput. Oper. Res. 40(12), 3188–3196 (2013)
Morgan, M., Grout, V.: Finding optimal solutions to backbone minimisation problems using mixed integer programming. In: Seventh International Network Conference (INC 2008), Plymouth, UK, 8–10 July 2008, pp 53–63. Proceedings (2008)
Morishita, S., Nishizeki, T.: Parametric power supply networks. In: Du, D.Z., Zhang, G. (eds.) Computing and Combinatorics. Lecture Notes in Computer Science, vol. 7936, pp. 245–256. Springer, Berlin (2013)
Nunna, H.K., Doolla, S.: Energy management in microgrids using demand response and distributed storagea multiagent approach. IEEE Trans. Power Deliv. 28(2), 939–947 (2013)
Pearce, D.J.: A space-efficient algorithm for finding strongly connected components. Inf. Process. Lett. 116(1), 47–52 (2016)
Popa, A.: Modelling the power supply network–hardness and approximation. In: Chan, T.H., Lau, L., Trevisan, L. (eds.) Theory and Applications of Models of Computation. Lecture Notes in Computer Science, vol. 7876, pp. 62–71. Springer, Berlin (2013)
Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Mon. 46(5), 281–283 (1939)
Schmidt, J.M.: A simple test on 2-vertex-and 2-edge-connectivity. Inf. Process. Lett. 113(7), 241–244 (2013)
Shafique, KH.: Partitioning a graph in alliances and its application to data clustering. Ph.D. thesis, University of Central Florida Orlando, Florida (2004)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)
Wang, F., Thai, M.T., Du, D.Z.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans. Wirel. Commun. 8(3), 1230–1237 (2009)
Zhang, Z., Gao, X., Wu, W.: Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theor. Comput. Sci. 410(810), 812–817 (2009)
Zimmerman, R.D., Murillo-Sánchez, C.E., Thomas, R.J.: Matpower: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12–19 (2011)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jovanovic, R., Nishi, T. & Voß, S. A heuristic approach for dividing graphs into bi-connected components with a size constraint. J Heuristics 23, 111–136 (2017). https://doi.org/10.1007/s10732-017-9331-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-017-9331-3