par Marmion, Marie-Eléonore 
;Mascia, Franco ;López-Ibáñez, Manuel ;Stützle, Thomas
Référence Lecture notes in computer science, 7919 LNCS, page (144-158)
Publication Publié, 2013
;Mascia, Franco ;López-Ibáñez, Manuel ;Stützle, Thomas Référence Lecture notes in computer science, 7919 LNCS, page (144-158)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Many stochastic local search (SLS) methods rely on the manipulation of single solutions at each of the search steps. Examples are iterative improvement, iterated local search, simulated annealing, variable neighborhood search, and iterated greedy. These SLS methods are the basis of many state-of-the-art algorithms for hard combinatorial optimization problems. Often, several of these SLS methods are combined with each other to improve performance. We propose here a practical, unified structure that encompasses several such SLS methods. The proposed structure is unified because it integrates these metaheuristics into a single structure from which we can not only instantiate each of them, but we also can generate complex combinations and variants. Moreover, the structure is practical since we propose a method to instantiate actual algorithms for practical problems in a semi-automatic fashion. The method presented in this work implements a general local search structure as a grammar; an instantiation of such a grammar is a program that can be compiled into executable form. We propose to find the appropriate grammar instantiation for a particular problem by means of automatic configuration. The result is a semi-automatic system that, with little human effort, is able to generate powerful hybrid SLS algorithms. © 2013 Springer-Verlag. |
