IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v27y2021i1d10.1007_s10732-020-09450-0.html
   My bibliography  Save this article

Matheuristics to optimize refueling and maintenance planning of nuclear power plants

Author

Listed:
  • Nicolas Dupin

    (Université Paris-Saclay, CNRS, Laboratoire de recherche en informatique)

  • El-Ghazali Talbi

    (Univ. Lille)

Abstract

Planning the maintenance of nuclear power plants is a complex optimization problem, involving a joint optimization of maintenance dates, fuel constraints and power production decisions. This paper investigates Mixed Integer Linear Programming (MILP) matheuristics for this problem, to tackle large size instances used in operations with a time scope of 5 years, and few restrictions with time window constraints for the latest maintenance operations. Several constructive matheuristics and a Variable Neighborhood Descent local search are designed. The matheuristics are shown to be accurately effective for medium and large size instances. The matheuristics give also results on the design of MILP formulations and neighborhoods for the problem. Contributions for the operational applications are also discussed. It is shown that the restriction of time windows, which was used to ease computations, induces large over-costs and that this restriction is not required anymore with the capabilities of matheuristics or local searches to solve such size of instances. Our matheuristics can be extended to a bi-objective optimization extension with stability costs, for the monthly re-optimization of the maintenance planning in the real-life application.

Suggested Citation

  • Nicolas Dupin & El-Ghazali Talbi, 2021. "Matheuristics to optimize refueling and maintenance planning of nuclear power plants," Journal of Heuristics, Springer, vol. 27(1), pages 63-105, April.
    • Handle: RePEc:spr:joheur:v:27:y:2021:i:1:d:10.1007_s10732-020-09450-0
    DOI: 10.1007/s10732-020-09450-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-020-09450-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-020-09450-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Agnès Gorge & Abdel Lisser & Riadh Zorgati, 2012. "Stochastic nuclear outages semidefinite relaxations," Computational Management Science, Springer, vol. 9(3), pages 363-379, August.
    2. Laumanns, Marco & Thiele, Lothar & Zitzler, Eckart, 2006. "An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method," European Journal of Operational Research, Elsevier, vol. 169(3), pages 932-942, March.
    3. Nicolas Dupin, 2017. "Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 149-176, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guillermo Cabrera-Guerrero & Aníbal Álvarez & Joaquín Vásquez & Pablo A. Maya Duque & Lucas Villavicencio, 2022. "A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    2. Laureano F. Escudero & Juan F. Monge, 2021. "On Multistage Multiscale Stochastic Capacitated Multiple Allocation Hub Network Expansion Planning," Mathematics, MDPI, vol. 9(24), pages 1-39, December.
    3. Mehmet Anıl Akbay & Christian Blum & Can Berk Kalayci, 2024. "CMSA based on set covering models for packing and routing problems," Annals of Operations Research, Springer, vol. 343(1), pages 1-38, December.
    4. Wei Li & Mengjun Li & Ning Zhang & Xuesong Zhou & Jiegui Zhou & Guanyu Song, 2022. "Optimizing Allocation of Distributed Electric Heating for Large-Scale Access Distribution Considering the Influence of Power Quality," Energies, MDPI, vol. 15(10), pages 1-18, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rong, Aiying & Figueira, José Rui, 2013. "A reduction dynamic programming algorithm for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 299-313.
    2. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    3. Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
    4. Gutjahr, Walter J., 2015. "Bi-Objective Multi-Mode Project Scheduling Under Risk Aversion," European Journal of Operational Research, Elsevier, vol. 246(2), pages 421-434.
    5. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
    6. Hanyu Lu & Lufei Huang, 2021. "Optimization of Shore Power Deployment in Green Ports Considering Government Subsidies," Sustainability, MDPI, vol. 13(4), pages 1-14, February.
    7. Zhao, Ruijia & Song, Yunting & Wang, Haoze & Xie, Xinlian, 2022. "Bi-objective optimisation model and its exact solution method of profit and market share of novel repair-and-support ships based on game theory," Omega, Elsevier, vol. 113(C).
    8. Goli, Alireza, 2024. "Efficient optimization of robust project scheduling for industry 4.0: A hybrid approach based on machine learning and meta-heuristic algorithms," International Journal of Production Economics, Elsevier, vol. 278(C).
    9. Hao Yu & Wei Deng Solvang, 2016. "An Improved Multi-Objective Programming with Augmented ε -Constraint Method for Hazardous Waste Location-Routing Problems," IJERPH, MDPI, vol. 13(6), pages 1-21, May.
    10. Konur, Dinçer & Campbell, James F. & Monfared, Sepideh A., 2017. "Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers," Omega, Elsevier, vol. 71(C), pages 46-65.
    11. Saeedeh Anvari & Metin Turkay, 2017. "The facility location problem from the perspective of triple bottom line accounting of sustainability," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6266-6287, November.
    12. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    13. Froger, Aurélien & Gendreau, Michel & Mendoza, Jorge E. & Pinson, Éric & Rousseau, Louis-Martin, 2016. "Maintenance scheduling in the electricity industry: A literature review," European Journal of Operational Research, Elsevier, vol. 251(3), pages 695-706.
    14. George Mavrotas & José Figueira & Alexandros Antoniadis, 2011. "Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems," Journal of Global Optimization, Springer, vol. 49(4), pages 589-606, April.
    15. Wang, Chen & Zhang, Shenghui & Liao, Peng & Fu, Tonglin, 2022. "Wind speed forecasting based on hybrid model with model selection and wind energy conversion," Renewable Energy, Elsevier, vol. 196(C), pages 763-781.
    16. William Pettersson & Melih Ozlen, 2020. "Multiobjective Integer Programming: Synergistic Parallel Approaches," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 461-472, April.
    17. Carlos García-Alonso & Leonor Pérez-Naranjo & Juan Fernández-Caballero, 2014. "Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farms," Annals of Operations Research, Springer, vol. 219(1), pages 187-202, August.
    18. Schmidt, Adam & Albert, Laura A. & Zheng, Kaiyue, 2021. "Risk management for cyber-infrastructure protection: A bi-objective integer programming approach," Reliability Engineering and System Safety, Elsevier, vol. 205(C).
    19. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    20. Banu Lokman & Murat Köksalan, 2013. "Finding all nondominated points of multi-objective integer programs," Journal of Global Optimization, Springer, vol. 57(2), pages 347-365, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:27:y:2021:i:1:d:10.1007_s10732-020-09450-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.