Multi-label Classification for the Generation of Sub-problems in Time-constrained Combinatorial Optimization

Abstract : This paper addresses the resolution of combinatorial optimization problems presenting some kind of recurrent structure, coupled with machine learning techniques. Stemming from the assumption that such recurrent problems are the realization of an unknown generative probabilistic model, data is collected from previous resolutions of such problems and used to train a supervised learning model for multi-label classification. This model is exploited to predict a subset of decision variables to be set heuristically to a certain reference value, thus becoming fixed parameters in the original problem. The remaining variables then form a smaller sub-problem whose solution, while not guaranteed to be optimal for the original problem, can be obtained faster, offering an advantageous tool for tackling time-sensitive tasks.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-02120128
Contributor : Laurence Porte <>
Submitted on : Sunday, May 5, 2019 - 12:15:09 PM
Last modification on : Tuesday, May 21, 2019 - 1:02:38 AM

File

ICORES_2019_53.pdf
Publication funded by an institution

Identifiers

Collections

Citation

Luca Mossina, Emmanuel Rachelson, Daniel Delahaye. Multi-label Classification for the Generation of Sub-problems in Time-constrained Combinatorial Optimization. ICORES 2019, 8th International Conference on Operations Research and Enterprise Systems, Feb 2019, Prague, Czech Republic. pp 133-141; ISBN: 978-989-758-352-0, ⟨10.5220/0007396601330141⟩. ⟨hal-02120128⟩

Share

Metrics

Record views

22

Files downloads

30