Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480837 | European Journal of Operational Research | 2011 | 10 Pages |
Abstract
We propose two classes for the implementation of hyper-heuristic algorithms. The first is based on constructive heuristics, whereas the second uses improvement methods. Within the latter class, a general framework is designed for the use of local search procedures and metaheuristics as low-level heuristics. A dynamic scheme to guide the use of these approaches is also devised. These ideas are tested on an NP-hard scheduling problem known as the response time variability problem (RTVP). An intensive computational experiment shows, especially in the second class where the new best results are found, the effectiveness of the proposed hyper-heuristics.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alberto GarcĂa-Villoria, Said Salhi, Albert Corominas, Rafael Pastor,