Pattern Sequencing Problems by Clustering Search [chapter]

Alexandre C. M. Oliveira, Luiz A. N. Lorena
2006 Lecture Notes in Computer Science  
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
more » ... etaheuristics 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.
doi:10.1007/11874850_26 fatcat:2swo3hmv2jexfiijw4qv6wz3ne