Skip to main content
SpringerLink
Log in

A Metaheuristic Approach for Solving Monitor Placement Problem

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13863))

Included in the following conference series:

  • 114 Accesses

Abstract

There are several hard combinatorial optimization problems that, in the context of communication networks, must be solved in short computing times since they are solving real-time critical tasks. This work is focused on the monitor placement problem, whose objective is to locate specific devices, called monitors, in certain nodes of a network with the aim of performing a complete network surveillance. As a consequence of the constant evolution of networks, the problem must be solved in real time if possible. If a solution cannot be found in the allowed computing time, then a penalty is assumed for each link of the network which remains uncovered. A Variable Neighborhood Search algorithm is proposed for solving this problem, comparing it with a hybrid evolutionary algorithm over a set of instances derived from real-life networks to evaluate its efficiency and efficacy.

A. Casado, J. Sánchez-Oro and A. Duarte research was funded by “Ministerio de Ciencia, Innovación y Universidades” under grant ref. PID2021-125709OA-C22, “Comunidad de Madrid” and “Fondos Estructurales” of European Union with grant refs. S2018/TCS-4566, Y2018/EMT-5062. N. Mladenović has been partially supported by the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan, Grant No. AP08856034.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Article  Google Scholar 

  2. Back, T., Khuri, S.: An evolutionary heuristic for the maximum independent set problem. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp. 531–535. IEEE (1994)

    Google Scholar 

  3. Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc.l Netw. 28(4), 466–484 (2006)

    Article  Google Scholar 

  4. Chandu, D.P.: A parallel genetic algorithm for three dimensional bin packing with heterogeneous bins. arXiv preprint arXiv:1411.4565 (2014)

  5. Crucitti, P., Latora, V., Marchiori, M.: Model for cascading failures in complex networks. Phys. Rev. E 69(4), 045104 (2004)

    Article  Google Scholar 

  6. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439–485 (2005)

    Google Scholar 

  7. Duarte, A., Martí, R., Glover, F., Gortazar, F.: Hybrid scatter tabu search for unconstrained global optimization. Ann. Oper. Res. 183(1), 95–123 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Evans, I.K.: Evolutionary algorithms for vertex cover. In: International Conference on Evolutionary Programming, pp. 377–386. Springer, Cham (1998). https://doi.org/10.1007/BFb0040790

  9. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hatano, N., Suzuki, M.: Quantum Annealing and Other Optimization Methods (2005).https://doi.org/10.1007/11526216

  11. Holland, J.H., et al.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press (1992)

    Google Scholar 

  12. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Springer, Cham (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

  13. Lagraa, S., François, J.: Knowledge discovery of port scans from DarkNet. In: 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), pp. 935–940. IEEE (2017)

    Google Scholar 

  14. Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699–719 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  15. Luling, R., Monien, B.: Load balancing for distributed branch & bound algorithms. In: Proceedings Sixth International Parallel Processing Symposium, pp. 543–548. IEEE (1992)

    Google Scholar 

  16. Milanovic, M.: Solving the generalized vertex cover problem by genetic algorithm. Comput. Inform. 29(6), 1251–1265 (2010)

    Google Scholar 

  17. Mueller-Bady, R., Gad, R., Kappes, M., Medina-Bulo, I.: Using genetic algorithms for deadline-constrained monitor selection in dynamic computer networks. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 867–874 (2015)

    Google Scholar 

  18. Mueller-Bady, R., Kappes, M., Medina-Bulo, I., Palomo-Lozano, F.: Optimization of monitoring in dynamic communication networks using a hybrid evolutionary algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1200–1207 (2017)

    Google Scholar 

  19. Mueller-Bady, R., Kappes, M., Medina-Bulo, I., Palomo-Lozano, F.: An evolutionary hybrid search heuristic for monitor placement in communication networks. J. Heurist. 25(6), 861–899 (2019)

    Article  Google Scholar 

  20. Newman, M.E.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39–54 (2005)

    Article  MathSciNet  Google Scholar 

  21. Pelikan, M., Goldberg, D.E.: Hierarchical bayesian optimization algorithm. In: Scalable Optimization via Probabilistic Modeling, pp. 63–90. Springer, Cham (2006). https://doi.org/10.1007/978-3-540-34954-9_4

  22. Pérez-Peló, S., Sánchez-Oro, J., Gonzalez-Pardo, A., Duarte, A.: A fast variable neighborhood search approach for multi-objective community detection. Appl. Soft Comput. 112, 107838 (2021)

    Google Scholar 

  23. Sánchez-Oro, J., Pantrigo, J., Duarte, A.: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput. Oper. Res. 52, 209–219 (2014)

    Google Scholar 

  24. Zhang, D., Cetinkaya, E.K., Sterbenz, J.P.: Robustness of mobile ad hoc networks under centrality-based attacks. In: 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 229–235. IEEE (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Rey Juan Carlos, Tulipán s/n., 28933, Móstoles, Spain

    Alejandra Casado, Jesús Sánchez-Oro & Abraham Duarte

  2. Khalifa University, Zone 1, Abu Dhabi, UAE

    Nenad Mladenović

Authors
  1. Alejandra Casado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesús Sánchez-Oro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alejandra Casado .

Editor information

Editors and Affiliations

  1. Khalifa University, Abu Dhabi, United Arab Emirates

    Andrei Sleptchenko

  2. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  3. HEC Montréal, Montréal, QC, Canada

    Pierre Hansen

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Casado, A., Mladenović, N., Sánchez-Oro, J., Duarte, A. (2023). A Metaheuristic Approach for Solving Monitor Placement Problem. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds) Variable Neighborhood Search. ICVNS 2022. Lecture Notes in Computer Science, vol 13863. Springer, Cham. https://doi.org/10.1007/978-3-031-34500-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34500-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34499-2

  • Online ISBN: 978-3-031-34500-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation