Advertisement

Soft Computing

, Volume 23, Issue 23, pp 12729–12744 | Cite as

The bi-objective critical node detection problem with minimum pairwise connectivity and cost: theory and algorithms

  • Juan Li
  • Panos M. Pardalos
  • Bin XinEmail author
  • Jie Chen
Methodologies and Application

Abstract

An effective way to analyze and apprehend structural properties of networks is to find their most critical nodes. This paper studies a bi-objective critical node detection problem, denoted as Bi-CNDP. In this variant, we do not make any assumptions on the psychology of decision makers and seek to find a set of solutions which minimize the pairwise connectivity of the induced graph and the cost of removing these critical nodes at the same time. After explicitly stating the formulation of Bi-CNDP, we first prove the NP-hardness of this problem for general graphs and the existence of a polynomial algorithm for constructing the \(\varepsilon \)-approximated Pareto front for Bi-CNDPs on trees. Then different approaches of determining the mating pool and the replacement pool are proposed for the decomposition-based multi-objective evolutionary algorithms. Based on this, two types of decomposition-based multi-objective evolutionary algorithms (MOEA/D and DMOEA-\(\varepsilon \hbox {C}\)) are modified and applied to solve the proposed Bi-CNDP. Numerical experiments on sixteen famous benchmark problems with random and logarithmic weights are firstly conducted to assess different types of the mating pool and the replacement pool. Besides, computational results between two improved algorithms, i.e., I-MOEA/D and I-DMOEA-\(\varepsilon \hbox {C}\), demonstrate that they behave differently on these instances and I-DMOEA-\(\varepsilon \hbox {C}\) shows better performance on the majority of test instances. Finally, a decision-making process from the perspective of minimizing the pairwise connectivity of the induced graph given a constraint on the cost of removing nodes is presented for helping decision makers to identify the most critical nodes for further protection or attack.

Keywords

Bi-objective critical node detection problems NP-hardness \(\varepsilon \)-Approximation Decomposition-based multi-objective evolutionary algorithms Mating pool Replacement pool 

Notes

Acknowledgements

This study was funded by the National Outstanding Youth Talents Support Program 61822304, the NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization under Grant U1609214, the National Natural Science Foundation of China under Grant 61673058, the Foundation for Innovative Research Groups of the National Natural Science Foundation of China under Grant 61621063, and the Projects of Major International (Regional) Joint Research Program NSFC under Grant 61720106011. P. M. Pardalos is supported by the Paul and Heidi Brown Preeminent Professorship in Industrial and Systems Engineering, University of Florida.

Compliance with ethical standards

Conflict of Interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

References

  1. Addis B, Di Summa M, Grosso A (2013) Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl Math 161(16–17):2349–2360MathSciNetzbMATHCrossRefGoogle Scholar
  2. Addis B, Aringhieri R, Grosso A, Hosteins P (2016) Hybrid constructive heuristics for the critical node problem. Ann Oper Res 238(1):1–13MathSciNetzbMATHGoogle Scholar
  3. Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2015) VNS solutions for the critical node problem. Electron Notes Discrete Math 47:37–44MathSciNetzbMATHCrossRefGoogle Scholar
  4. Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2016a) A general evolutionary framework for different classes of critical node problems. Eng Appl Artif Intell 55:128–145zbMATHCrossRefGoogle Scholar
  5. Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2016b) Local search metaheuristics for the critical node problem. Networks 67(3):209–221zbMATHCrossRefGoogle Scholar
  6. Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2019) Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem. Discrete Appl Math 253:103–121MathSciNetzbMATHCrossRefGoogle Scholar
  7. Arulselvan A, Commander CW, Pardalos PM, Shylo O (2007) Managing network risk via critical node identification. Risk management in telecommunication networks, SpringerGoogle Scholar
  8. Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36(7):2193–2200MathSciNetzbMATHCrossRefGoogle Scholar
  9. Arulselvan A, Commander CW, Shylo O, Pardalos PM (2011) Cardinality-constrained critical node detection problem. Springer, New YorkzbMATHCrossRefGoogle Scholar
  10. Aspnes J, Chang K, Yampolskiy A (2005) Inoculation strategies for victims of viruses and the sum-of-squares partition problem. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, pp 43–52Google Scholar
  11. Atputharajah A, Saha TK (2009) Power system blackouts—literature review. In: Proceedings of the international conference on industrial and information systems, pp 460–465Google Scholar
  12. Balas E, Souza CCd (2005) The vertex separator problem: a polyhedral investigation. Math Program 103(3):583–608MathSciNetzbMATHCrossRefGoogle Scholar
  13. Ben-Ameur W, Mohamed-Sidi M-A, Neto J (2015) The \(k\)-separator problem: polyhedra, complexity and approximation results. J Comb Optim 29(1):276–307CrossRefMathSciNetzbMATHGoogle Scholar
  14. Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12(1):21–34zbMATHCrossRefGoogle Scholar
  15. Chen P-A, David M, Kempe D (2010) Better vaccination strategies for better people. In: Proceedings of the ACM conference on electronic commerce, pp 179–188Google Scholar
  16. Chen J, Li J, Xin B (2017) DMOEA-\(\varepsilon \)C: decomposition-based multi-objective evolutionary algorithm with the \(\varepsilon \)-constraint framework. IEEE Trans Evolut Comput 21(5):714–730CrossRefGoogle Scholar
  17. Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197CrossRefGoogle Scholar
  18. Di Summa M, Grosso A, Locatelli M (2011) Complexity of the critical node problem over trees. Comput Oper Res 38(12):1766–1774MathSciNetzbMATHCrossRefGoogle Scholar
  19. Di Summa M, Grosso A, Locatelli M (2012) Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput Optim Appl 53(3):649–680MathSciNetzbMATHCrossRefGoogle Scholar
  20. Dinh TN, Thai MT (2013) Precise structural vulnerability assessment via mathematical programming. In: Proceedings of the military communications conference, pp 1351–1356Google Scholar
  21. Dinh TN, Xuan Y, Thai MT, Park EK, Znati T (2010) On approximation of new optimization methods for assessing network vulnerability. In: Proceedings of the conference on information communications, pp 2678–2686Google Scholar
  22. Fan N, Pardalos PM (2010) Robust optimization of graph partitioning and critical node detection in analyzing networks. Springer, BerlinzbMATHCrossRefGoogle Scholar
  23. Faramondi L, Oliva G, Panzieri S, Pascucci F, Schlueter M, Munetomo M, Setola R (2018) Network structural vulnerability: a multiobjective attacker perspective. IEEE Trans Syst Man Cybern Syst PP(99):1–14Google Scholar
  24. Granata D, Steeger G, Rebennack S (2013) Network interdiction via a critical disruption path: branch-and-price algorithms. Comput Oper Res 40(11):2689–2702MathSciNetzbMATHCrossRefGoogle Scholar
  25. Jenelius E, Petersen T, Mattsson L-G (2006) Importance and exposure in road network vulnerability analysis. Transp Res Part A Policy Pract 40(7):537–560CrossRefGoogle Scholar
  26. Kempe D, Kleinberg J, Tardos E (2010) Maximizing the spread of influence in a social network. Progressive research, pp 137–146Google Scholar
  27. Kuhlman CJ, Kumar VSA, Marathe MV, Ravi SS, Rosenkrantz DJ (2010) Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In: Proceedings of the European conference on machine learning and knowledge discovery in databases, pp 111–127Google Scholar
  28. Kumar VSA, Rajaraman R, Sun Z, Sundaram R (2010) Existence theorems and approximation algorithms for generalized network security games. In: Proceedings of the IEEE international conference on distributed computing systems, pp 348–357Google Scholar
  29. Lalou M, Tahraoui MA, Kheddouci H (2016) Component-cardinality-constrained critical node problem in graphs. Discrete Appl Math 210:150–163MathSciNetzbMATHCrossRefGoogle Scholar
  30. Lalou M, Tahraoui MA, Kheddouci H (2018) The critical node detection problem in networks: a survey. Comput Sci Rev 28:92–117MathSciNetzbMATHCrossRefGoogle Scholar
  31. Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429Google Scholar
  32. Liang G, Weller SR, Zhao J, Luo F, Dong ZY (2017) The 2015 Ukraine blackout: implications for false data injection attacks. IEEE Trans Power Syst 32:3317–3318CrossRefGoogle Scholar
  33. Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, BostonzbMATHGoogle Scholar
  34. Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the symposium on foundations of computer science, pp 86–92Google Scholar
  35. Pavlikov K (2018) Improved formulations for minimum connectivity network interdiction problems. Comput Oper Res 97:48–57MathSciNetzbMATHCrossRefGoogle Scholar
  36. Purevsuren D, Cui G, Qu M, Win NNH (2017) hybridization of GRASP with exterior path relinking for identifying critical nodes in graphs. Int J Comput Sci 44(2):157–165Google Scholar
  37. Qi Y, Ma X, Liu F (2014) MOEA/D with adaptive weight adjustment. Evolut Comput 22(2):231–264CrossRefGoogle Scholar
  38. Salmeron J, Wood K, Baldick R (2015) Analysis of electric grid security under terrorist threat. IEEE Trans Power Syst 19(2):905–912CrossRefGoogle Scholar
  39. Shen S, Smith JC (2012) Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2):103–119MathSciNetzbMATHGoogle Scholar
  40. Shen Y, Nguyen NP, Xuan Y, Thai MT (2013a) On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans Netw 21(3):963–973CrossRefGoogle Scholar
  41. Shen Y, Dinh TN, Thai MT (2013b) Adaptive algorithms for detecting critical links and nodes in dynamic networks. In: Proceedings of the IEEE military communications conference, pp 1–6Google Scholar
  42. Spears WM, Jong KAD (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the 4th international conference on genetic algorithms, pp 230–236Google Scholar
  43. Tomaino V, Arulselvan A, Veltri P, Pardalos PM (2012) Studying connectivity properties in human protein–protein interaction network in cancer pathway. Springer, New YorkCrossRefGoogle Scholar
  44. Ventresca M (2012) Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput Oper Res 39(11):2763–2775MathSciNetzbMATHCrossRefGoogle Scholar
  45. Ventresca M, Aleman D (2014) A randomized algorithm with local search for containment of pandemic disease spread. Comput Oper Res 48(7):11–19MathSciNetzbMATHCrossRefGoogle Scholar
  46. Ventresca M, Aleman D (2015) Efficiently identifying critical nodes in large complex networks. Comput Soc Netw 2(1):6CrossRefGoogle Scholar
  47. Ventresca M, Harrison KR, Ombuki-Berman BM (2018) The bi-objective critical node detection problem. Eur J Oper Res 265(3):895–908MathSciNetzbMATHCrossRefGoogle Scholar
  48. Veremyev A, Prokopyev OA, Pasiliao EL (2014a) An integer programming framework for critical elements detection in graphs. J Comb Optim 28(1):233–273MathSciNetzbMATHCrossRefGoogle Scholar
  49. Veremyev A, Boginski V, Pasiliao EL (2014b) Exact identification of critical nodes in sparse networks via new compact formulations. Optim Lett 8(4):1245–1259MathSciNetzbMATHCrossRefGoogle Scholar
  50. Walteros JL, Veremyev A, Pardalos PM, Pasiliao EL (2019) Detecting critical node structures on graphs: a mathematical programming approach. Networks 73:48–88MathSciNetzbMATHCrossRefGoogle Scholar
  51. Walteros JL, Pardalos PM (2012) Selected topics in critical element detection. In: Daras N (ed) Applications of mathematics and informatics in military science, vol 71. Springer optimization and its applications. Springer, New York, pp 9–26zbMATHCrossRefGoogle Scholar
  52. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolut Comput 11(6):712–731CrossRefGoogle Scholar
  53. Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. Technical Report CES-491, The School of Computer Science and Electronic Engineering, University of EssexGoogle Scholar
  54. Zhou T, Fu Z, Wang B (2006) Epidemic dynamics on complex networks. Prog Nat Sci Mater Int 16(5):452–457MathSciNetzbMATHCrossRefGoogle Scholar
  55. Zhou A, Zhang Q, Jin Y, Tsang E, Okabe T (2005) A model-based evolutionary algorithm for bi-objective optimization. In: Proceedings of the IEEE congress on evolutionary computation, pp 2568–2575Google Scholar
  56. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithm: a comparative case study and strength pareto approach. IEEE Trans Evolut Comput 3(4):257–271CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  • Juan Li
    • 1
    • 2
    • 3
  • Panos M. Pardalos
    • 4
  • Bin Xin
    • 1
    • 2
    • 3
    Email author
  • Jie Chen
    • 1
    • 2
    • 3
  1. 1.School of Automation, Beijing Institute of TechnologyBeijingChina
  2. 2.State Key Laboratory of Intelligent Control and Decision of Complex SystemsBeijing Institute of TechnologyBeijingChina
  3. 3.Beijing Advanced Innovation Center for Intelligent Robots and SystemsBeijing Institute of TechnologyBeijingChina
  4. 4.Center for Applied Optimization, Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations