An efficient scenario penalization matheuristic for a stochastic scheduling problem - IMT Mines Alès Access content directly
Journal Articles Journal of Heuristics Year : 2023

An efficient scenario penalization matheuristic for a stochastic scheduling problem

Abstract

We propose a new scenario penalization matheuristic for a stochastic scheduling problem based on both mathematical programming models and local search methods. The application considered is an NP-hard problem expressed as a risk minimization model involving quantiles related to value at risk which is formulated as a non-linear binary optimization problem with linear constraints. The proposed matheuritic involves a parameterization of the objective function that is progressively modified to generate feasible solutions which are improved by local search procedure. This matheuristic is related to the ghost image process approach by Glover (Comput Oper Res 21(8):801–822, 1994) which is a highly general framework for heuristic search optimization. This approach won the first prize in the senior category of the EURO/ROADEF 2020 challenge. Experimental results are presented which demonstrate the effectiveness of our approach on large instances provided by the French electricity transmission network RTE.
Fichier principal
Vignette du fichier
an-efficient-scenario-penalization-matheuristic.pdf (242.96 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04114125 , version 1 (17-10-2023)

Identifiers

Cite

Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi. An efficient scenario penalization matheuristic for a stochastic scheduling problem. Journal of Heuristics, 2023, 29, pp.383-408. ⟨10.1007/s10732-023-09513-y⟩. ⟨hal-04114125⟩
48 View
35 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More