A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Pattern Sequencing Problems by Clustering Search
[chapter]
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
doi:10.1007/11874850_26
fatcat:2swo3hmv2jexfiijw4qv6wz3ne