Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Transactions in Operational Research Year : 2018

Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints

Abstract

The discrete unit commitment problem with min‐stop ramping constraints optimizes the daily production of thermal power plants, subject to an operational reactivity of thermal units in a 30‐minute delay. Previously, mixed integer programming (MIP) formulations aimed at an exact optimization approach. This paper derives matheuristics to face the short time limit imposed by the operational constraints. Continuous relaxations guide the search for feasible solutions exploiting tailored variable fixing strategies. Parallel matheuristics are derived considering complementary strategies in parallel. Tests were performed on more than 600 real‐life instances. Our parallel matheuristic provides high‐quality solutions and outperforms the MIP approach in the time limits imposed by the industrial application. This paper illustrates a special interest for matheuristics in industrial highly constrained problems: many tailored neighborhood searches can be derived from an MIP formulation, and their combination in a parallel scheme improves the solution quality as well as the consistency of the heuristic.

Dates and versions

hal-02304758 , version 1 (03-10-2019)

Identifiers

Cite

Nicolas Dupin, El-Ghazali Talbi. Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints. International Transactions in Operational Research, 2018, 27 (1), pp.219-244. ⟨10.1111/itor.12557⟩. ⟨hal-02304758⟩
89 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More