An efficient scenario penalization matheuristic for a stochastic scheduling problem

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 i...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics 2023-06, Vol.29 (2-3), p.383-408
Main Authors: Vasquez, Michel, Buljubasic, Mirsad, Hanafi, Saïd
Format: Article
Language:English
Subjects:
Approximation
Artificial Intelligence
Calculus of Variations and Optimal Control
Optimization
Computer Science
Electric power transmission
Heuristic
Integer programming
Intervention
Linear programming
Management Science
Mathematical programming
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Optimization
Parameterization
Quantiles
Scheduling
Search methods
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-023-09513-y