Learnheuristics: Hybridizing metaheuristics with machine learning for optimization with dynamic inputs

Publication date

2019-04-11T07:54:11Z

2019-04-11T07:54:11Z

2017-01-01



Abstract

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. © 2017 Calvet et al.

Document Type

Review


Published version

Language

English

Publisher

Open Mathematics

Related items

http://www.degruyter.com/downloadpdf/j/math.2017.15.issue-1/math-2017-0029/math-2017-0029.xml

Recommended citation

Calvet, L., Armas, J. D., Masip, D., & Juan, A. A. (2017). Learnheuristics: Hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Mathematics, 15(1), 261-280. doi:10.1515/math-2017-0029

2391-5455

10.1515/math-2017-0029

This item appears in the following Collection(s)

Articles [361]