Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants - Archive ouverte HAL Access content directly
Journal Articles Algorithms Year : 2020

Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants

(1) , (2)
1
2

Abstract

This paper studies the hybridization of Mixed Integer Programming (MIP) with dual heuristics and machine learning techniques, to provide dual bounds for a large scale optimization problem from an industrial application. The case study is the EURO/ROADEF Challenge 2010, to optimize the refueling and maintenance planning of nuclear power plants. Several MIP relaxations are presented to provide dual bounds computing smaller MIPs than the original problem. It is proven how to get dual bounds with scenario decomposition in the different 2-stage programming MILP formulations, with a selection of scenario guided by machine learning techniques. Several sets of dual bounds are computable, improving significantly the former best dual bounds of the literature and justifying the quality of the best primal solution known.

Dates and versions

hal-03093679 , version 1 (04-01-2021)

Identifiers

Cite

Nicolas Dupin, El-Ghazali Talbi. Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants. Algorithms, 2020, 13 (8), pp.185. ⟨10.3390/a13080185⟩. ⟨hal-03093679⟩
30 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More