By Topic

A simple hybrid evolutionary algorithm for finding Golomb rulers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dotu, I. ; Departamento De Ingenieria Informatica, Univ. Autonoma de Madrid, Spain ; Van Hentenryck, P.

Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recent years. This paper presents a hybrid evolutionary algorithm to find near-optimal Golomb rulers in reasonable time. The algorithm, which is conceptual simple and uses a natural modeling, focuses on feasibility, finding near-optimal rulers indirectly. It significantly outperforms earlier (hybrid) evolutionary algorithms and compares favorably with hybridizations of local search and constraint programming. In particular, the algorithm quickly finds optimal rulers with up to 11 marks and isolates optimal rulers with up to 14 marks in reasonable time. It also finds near-optimal rulers for up to 16 marks quickly.

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:3 )

Date of Conference:

2-5 Sept. 2005