Dual heuristics and new dual bounds to schedule the maintenances of\n nuclear power plants

2018/06/01 by Nicolas Dupin, Dupin, Nicolas, El‐Ghazali Talbi +1
Engineering · #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Reliability and Maintenance Optimization #Vehicle Routing Optimization Methods

paper · pdf · doi:10.48550/arxiv.1806.00445

openalex publication_date 2018/06/01 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28

Abstract

The EURO/ROADEF 2010 Challenge aimed to schedule the maintenance and\nrefueling operations of French nuclear power plants, ranking the approaches in\ncompetition for the quality of primal solutions. This paper justifies the high\nquality of the best solutions computing dual bounds with dual heuristics. A\nfirst step designs several Mixed Integer Programming (MIP) relaxations with\ndifferent compromises between computation time and quality of dual bounds. To\ndeal with smaller MIPs, we prove how reductions in the number of time steps and\nscenarios can guarantee dual bounds for the whole problem of the Challenge.\nSeveral sets of dual bounds are computable, improving significantly the former\nbest dual bounds of the literature. Intermediate results allow also a better\nunderstanding of the problem and offer perspectives to improve some approaches\nof the Challenge.\n

Related

• Solving a real-life large-scale energy management problem
• Mixed-Integer Programming for the ROADEF/EURO 2020 challenge
• On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
• Column generation for the discrete Unit Commitment problem with min-stop\n ramping constraints
• Reinforcement Learning and Mixed-Integer Programming for Power Plant Scheduling in Low Carbon Systems: Comparison and Hybridisation