Detecting Weak Points in Networks Using Variable Neighborhood Search

  • Sergio Pérez-Peló
  • Jesús Sánchez-OroEmail author
  • Abraham Duarte
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11328)


Recent advances in networks technology require from advanced technologies for monitoring and controlling weaknesses in networks. Networks are naturally dynamic systems to which a wide variety of devices are continuously connecting and disconnecting. This dynamic nature force us to maintain a constant analysis looking for weak points that can eventually disconnect the network. The detection of weak points is devoted to find which nodes must be reinforced in order to increase the safety of the network. This work tackles the \( \alpha \) separator problem, which aims to find a minimum set of nodes that disconnect the network in subnetworks of size smaller than a given threshold. A Variable Neighborhood Search algorithm is proposed for finding the minimum \( \alpha \) separator in different network topologies, comparing the obtained results with the best algorithm found in the state of the art.


Alpha-separator Reduced VNS Betweenness 


  1. 1.
    Andersson, G., et al.: Causes of the 2003 major grid blackouts in North America and Europe, and recommended means to improve system dynamic performance. IEEE Trans. Power Syst. 20(4), 1922–1928 (2005)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Soc. 25(2), 163–177 (2001)CrossRefGoogle Scholar
  3. 3.
    Crucitti, P., Latora, V., Marchiori, M.: Model for cascading failures in complex networks. Phys. Rev. E 69, 045104 (2004)CrossRefGoogle Scholar
  4. 4.
    Duarte, A., Sánchez-Oro, J., Resende, M.G., Glover, F., Martí, R.: Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296, 46–60 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Erdős, P., Rényi, A.: On random graphs. Publ. Math. 6, 290 (1959)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Feige, U., Mahdian, M.: Finding small balanced separators. In: Kleinberg, J.M. (ed.) STOC, pp. 375–384. ACM (2006)Google Scholar
  7. 7.
    Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Feo, T.A., Resende, M.G., Smith, S.H.: Greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42(5), 860–878 (1994)CrossRefGoogle Scholar
  9. 9.
    Garey, M., Johnson, D.: Computers and Intractability - A guide to the Theory of NP-Completeness. Freeman, San Fransisco (1979)zbMATHGoogle Scholar
  10. 10.
    Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Hansen, P., Mladenović, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 313–337. Springer, Boston (2014)CrossRefGoogle Scholar
  12. 12.
    Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Lee, J., Kwak, J., Lee, H.W., Shroff, N.B.: Finding minimum node separators: a Markov chain Monte Carlo method. In: 13th International Conference on Design of Reliable Communication Networks, DRCN 2017, pp. 1–8, March 2017Google Scholar
  14. 14.
    Mladenovic, N., Petrovic, J., Kovacevic-Vujcic, V., Cangalovic, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2), 389–399 (2003)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Mohamed-Sidi, M.: K-separator problem. (Problème de k-Sèparateur). Ph.D. thesis, Telecom & Management SudParis, Èvry, Essonne, France (2014)Google Scholar
  16. 16.
    Quintana, J.D., Sánchez-Oro, J., Duarte, A.: Efficient greedy randomized adaptive search procedure for the generalized regenerator location problem. Int. J. Comput. Intell. Syst. 9(6), 1016–1027 (2016)CrossRefGoogle Scholar
  17. 17.
    Wachs, M., Grothoff, C., Thurimella, R.: Partitioning the internet. In: Martinelli, F., Lanet, J.L., Fitzgerald, W.M., Foley, S.N. (eds.) CRiSIS, pp. 1–8. IEEE Computer Society (2012)Google Scholar
  18. 18.
    Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR: Inf. Syst. Oper. Res. 21(2), 95–108 (1983)zbMATHGoogle Scholar
  19. 19.
    Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer SciencesUniversidad Rey Juan CarlosMóstolesSpain

Personalised recommendations