Skip to main content
SpringerLink
Log in

An Industry Maintenance Planning Optimization Problem Using CMA-VNS and Its Variations

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research: Recent Trends (MOTOR 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1476))

Abstract

In this article, we consider the statement of a problem described in the competition ROADEF/EURO challenge 2020 [4] dedicated to a maintenance planning optimization problem in collaboration with RTE [5]. First of all, the main task is to build an optimal maintenance schedule for a high voltage transmission network to ensure the delivery and supply of electricity. To solve this problem we use several optimization methods to find the best possible maintenance schedule that would be consistent with all work-related constraints and would take into account the risk assessment. There are many existing heuristic, metaheuristic, and exact algorithms that can solve this optimization problem; yet it is highly feasible that the state-of-the-art methods currently available may offer some improvement. For this reason, taking into account the task at hand, we decided to use the CMA-VNS [27] algorithm after examining the results of the Combinatorial Black Box Optimization Competition [2]. The algorithm is hybrid and consists of Bipop CMA-ES and VNS algorithms that make it possible to obtain solutions with a zero penalty function and close to a minimal objective function in an admissible time. Other popular algorithms were carried out in comparison with our solution to prove the efficiency of this approach. The effectiveness of this approach to solving the problem is demonstrated.

The work of the penultimate author was carried out under the auspices of a grant of the President of the Russian Federation for state support of young Russian scientists - candidates of science, project number MK-4674.2021.1.1.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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. Challenge roadef/euro 2020: Maintenance planning problem!. https://www.roadef.org/challenge/2020/en/

  2. Combinatorial black-box optimization competition. https://web.mst.edu/~tauritzd/CBBOC/GECCO2015

  3. Link to the github repository with the implementation of the described solution. https://github.com/chabann/ROADEF-RTE-maintenance-planning.git

  4. Roadef \(|\) association française de recherche opérationnelle et d’aide à la décision. https://www.roadef.org

  5. Réseau de transport d’Électricité. https://www.rte-france.com/en

  6. Special session and competition on large-scale global optimization. http://www.tflsgo.org/special_sessions/cec2018.html

  7. Varelas, K., et al.: A comparative study of large-scale variants of CMA-ES. In: Auger, Anne, Fonseca, Carlos M.., Lourenço, Nuno, Machado, Penousal, Paquete, Luís., Whitley, Darrell (eds.) PPSN 2018. LNCS, vol. 11101, pp. 3–15. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99253-2_1

    Chapter  Google Scholar 

  8. Beyer, H.G., Sendhoff, B.: Simplify your covariance matrix adaptation evolution strategy. IEEE Trans. Evol. Comput. (2017). https://doi.org/10.1109/TEVC.2017.2680320

  9. Brownlee, J.: Clever Algorithms: Nature-Inspired Programming Recipes (2011)

    Google Scholar 

  10. Crognier, G., Tournebise, P., Ruiz, M., Panciatici, P.: Grid operation-based outage maintenance planning. Electric Power Syst. Res. 190 (2021). https://doi.org/10.1016/j.epsr.2020.106682

  11. Deng, W., Xu, J., Zhao, H.: An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7, 20281–20292 (2019). https://doi.org/10.1109/ACCESS.2019.2897580

    Article  Google Scholar 

  12. Froger, A., Gendreau, M., Mendoza, J.E., Éric Pinson, Rousseau, L.M.: Maintenance scheduling in the electricity industry: a literature review. Eur. J. Oper. Res. 251(3), 695–706 (2016). https://doi.org/10.1016/j.ejor.2015.08.045

  13. Hadi, A.A., Mohamed, A.W., Jambi, K.M.: LSHADE-SPA memetic framework for solving large-scale optimization problems. Complex Intell. Syst. 5(1), 25–40 (2018). https://doi.org/10.1007/s40747-018-0086-8

    Article  Google Scholar 

  14. Hansen, N.: The CMA evolution strategy: a comparing review, vol. 192, pp. 75–102 (2007). https://doi.org/10.1007/3-540-32494-1_4

  15. Hansen, N.: The CMA evolution strategy: a tutorial (2010)

    Google Scholar 

  16. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001). https://doi.org/10.1016/S0377-2217(00)00100-4

  17. Hansen, P., Mladenovic, N., Moreno-Pérez, J.: Variable neighbourhood search: Methods and applications. 4OR 175, 367–407 (2010). https://doi.org/10.1007/s10479-009-0657-6

  18. Kemmoé Tchomté, S., Gourgand, M.: Particle swarm optimization: a study of particle displacement for solving continuous and combinatorial optimization problems. Int. J. Prod. Econ. 121(1), 57–67 (2009). https://doi.org/10.1016/j.ijpe.2008.03.015

    Article  Google Scholar 

  19. LaTorre, A., Muelas, S., Peña, J.-M.: Evaluating the multiple offspring sampling framework on complex continuous optimization functions. Memetic Comput. 5(4), 295–309 (2013). https://doi.org/10.1007/s12293-013-0120-8

    Article  Google Scholar 

  20. Mirjalili, Seyedali: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks. SCI, vol. 780, pp. 43–55. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-93025-1_4

    Chapter  MATH  Google Scholar 

  21. Molina, D., Latorre, A., Herrera, F.: Shade with iterative local search for large-scale global optimization, pp. 1–8 (2018). https://doi.org/10.1109/CEC.2018.8477755

  22. Muñoz, M.A., Sun, Y., Kirley, M., Halgamuge, S.K.: Algorithm selection for black-box continuous optimization problems: a survey on methods and challenges. Inf. Sci. 317, 224–245 (2015). https://doi.org/10.1016/j.ins.2015.05.010

    Article  Google Scholar 

  23. Niar, S., Bekrar, A., Ammari, A.: An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J. Intell. Manuf. (J Intell Manuf) 29, 603–615 (2015)

    Google Scholar 

  24. Roy, G., Lee, H., Welch, J.L., Zhao, Y., Pandey, V., Thurston, D.: A distributed pool architecture for genetic algorithms, pp. 1177–1184 (2009). https://doi.org/10.1109/CEC.2009.4983079

  25. Sun, L., Lin, L., Li, H., Gen, M.: Large scale flexible scheduling optimization by a distributed evolutionary algorithm. Comput. Ind. Eng. 128, 894–904 (2019). https://doi.org/10.1016/j.cie.2018.09.025

    Article  Google Scholar 

  26. Weise, T.: Global Optimization Algorithm: Theory and Application (2009)

    Google Scholar 

  27. Xue, F., Shen, G.: Design of an efficient hyper-heuristic algorithm CMA-VNS for combinatorial black-box optimization problems, pp. 1157–1162 (2017). https://doi.org/10.1145/3067695.3082054

  28. Yang, J., Zhuang, Y.: An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl. Soft Comput. 10, 653–660 (2010). https://doi.org/10.1016/j.asoc.2009.08.040

Download references

Author information

Authors and Affiliations

  1. St Petersburg State University, Peterhof, 198504, Russia

    Anna Zholobova, Yefim Zholobov, Ivan Polyakov, Ovanes Petrosian & Tatyana Vlasova

Authors
  1. Anna Zholobova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yefim Zholobov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Polyakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ovanes Petrosian
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tatyana Vlasova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anna Zholobova .

Editor information

Editors and Affiliations

  1. Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia

    Alexander Strekalovsky

  2. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Yury Kochetov

  3. Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia

    Tatiana Gruzdeva

  4. Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia

    Andrei Orlov

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zholobova, A., Zholobov, Y., Polyakov, I., Petrosian, O., Vlasova, T. (2021). An Industry Maintenance Planning Optimization Problem Using CMA-VNS and Its Variations. In: Strekalovsky, A., Kochetov, Y., Gruzdeva, T., Orlov, A. (eds) Mathematical Optimization Theory and Operations Research: Recent Trends. MOTOR 2021. Communications in Computer and Information Science, vol 1476. Springer, Cham. https://doi.org/10.1007/978-3-030-86433-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86433-0_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86432-3

  • Online ISBN: 978-3-030-86433-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation