Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/93087
Title: Learnheuristics: Hybridizing metaheuristics with machine learning for optimization with dynamic inputs
Author: Calvet Mir, Laura  
Armas Adrián, Jésica de
Masip Rodo, David  
Juan Pérez, Ángel Alejandro
Issue Date: 1-Jan-2017
Publisher: Open Mathematics
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
Also see: http://www.degruyter.com/downloadpdf/j/math.2017.15.issue-1/math-2017-0029/math-2017-0029.xml
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.
Language: English
URI: http://hdl.handle.net/10609/93087
ISSN: 2391-5455MIAR
Appears in Collections:Articles

Share:
Export:
Files in This Item:
File SizeFormat 
learnheuristics.pdf658.76 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.