An efficient scenario penalization matheuristic for a stochastic scheduling problem
Michel Vasquez (),
Mirsad Buljubasic () and
Saïd Hanafi ()
Additional contact information
Michel Vasquez: Univ. Montpellier, IMT Mines Ales
Mirsad Buljubasic: Univ. Montpellier, IMT Mines Ales
Saïd Hanafi: INSA Hauts-de-France/Univ. Polytechnique Hauts-de-France
Journal of Heuristics, 2023, vol. 29, issue 2, No 6, 383-408
Abstract:
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.
Keywords: Mixed integer programming; Local search; Stochastic scheduling; Mean-risk; Quantiles (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10732-023-09513-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:29:y:2023:i:2:d:10.1007_s10732-023-09513-y
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732
DOI: 10.1007/s10732-023-09513-y
Access Statistics for this article
Journal of Heuristics is currently edited by Manuel Laguna
More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().