Modern search methods for optimization consider hybrid search metaheuristics those employing general optimizers working together with a problem-specific local search procedure. The hybridism comes from the balancing of global and local search procedures. A challenge in such algorithms is to discover efficient strategies to cover all the search space, applying local search only in actually promising search areas. This paper proposes the Clustering Search (*CS): A generic way of combining search metaheuristics with clustering to detect promising search areas before applying local search procedures. The clustering process aims to gather similar information about the problem at hand into groups, maintaining a representative solution associated to this information. Two applications to combinatorial optimization are examined, showing the flexibility and competitiveness of the method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Oliveira, A. C. M., & Lorena, L. A. N. (2006). Pattern sequencing problems by clustering search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4140 LNAI, pp. 218–227). Springer Verlag. https://doi.org/10.1007/11874850_26
Mendeley helps you to discover research relevant for your work.