This paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms. Learnheuristics can be used to solve combinatorial optimization problems with dynamic inputs (COPDIs). In these COPDIs, the problem inputs (elements either located in the objective function or in the constraints set) are not fixed in advance as usual. On the contrary, they might vary in a predictable (non-random) way as the solution is partially built according to some heuristic-based iterative process. For instance, a consumer’s willingness to spend on a specific product might change as the availability of this product decreases and its price rises. Thus, these inputs might take different values depending on the current solution configuration. These variations in the inputs might require from a coordination between the learning mechanism and the metaheuristic algorithm: at each iteration, the learning method updates the inputs model used by the metaheuristic.
@article{bwmeta1.element.doi-10_1515_math-2017-0029,
author = {Laura Calvet and J\'esica de Armas and David Masip and Angel A. Juan},
title = {Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs},
journal = {Open Mathematics},
volume = {15},
year = {2017},
pages = {261-280},
zbl = {1359.90156},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2017-0029}
}
Laura Calvet; Jésica de Armas; David Masip; Angel A. Juan. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Mathematics, Tome 15 (2017) pp. 261-280. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2017-0029/