Abstract
Finding Golomb rulers is an extremely challenging optimization problem with many practical applications. This problem has been approached by a variety of search methods in recent years. We consider in this work a hybrid evolutionary algorithm that incorporates ideas from greedy randomized adaptive search procedures (GRASP), tabu-based local search methods (TS) and scatter search (SS). In particular, GRASP and TS are embedded into a SS algorithm to serve as initialization and restarting methods for the population and as improvement technique respectively. The resulting memetic algorithm significantly outperforms earlier approaches (including other hybrid EAs, as well as hybridizations of local search and constraint programming), finding optimal rulers where the mentioned techniques failed. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Cotta, C., Dotú, I., Fernández, A. J., & Van Hentenryck, P. (2006). A memetic approach to Golomb rulers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 252–261). Springer Verlag. https://doi.org/10.1007/11844297_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
