Evolving Golomb Rulers

  • Jorge Tavares
  • Francisco B. Pereira
  • Ernesto Costa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3103)


A Golomb Ruler is defined as a ruler that has marks unevenly spaced at integer locations in such a way that the distance between any two marks is unique. Unlike usual rulers, they have the ability to measure more discrete measures than the number of marks they possess. Although the definition of a Golomb Ruler does not place any restriction on the length of the ruler, researchers are usually interested in rulers with minimum length. An Optimal Golomb Ruler (OGR) is defined as the shortest length ruler for a given number of marks [1].


  1. 1.
    Golomb, S.: How to Number a Graph. In: Graph Theory and Computing, pp. 23–37. Academic Press, London (1972)Google Scholar
  2. 2.
    Soliday, S., Homaifar, A.: Genetic algorithm approach to the search for golomb rulers. In: Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA 1995), pp. 528–535. Morgan Kaufmann, San Francisco (1995)Google Scholar
  3. 3.
    Pereira, F.B., Tavares, J., Costa, E.: Golomb rulers: The advantage of evolution. In: Proceedings of the 11th Portuguese Conference on Artificial Intelligence, Workshop on Artificial Life and Evolutionary Algorithms (ALEA), EPIA 2003, pp. 27–33 (2003)Google Scholar
  4. 4.
    Tavares, J., Pereira, F.B., Costa, E.: Understanding the role of insertion and correction in the evolution of golomb rulers. In: Proceedings of the Congress on Evolutionary Computation, CEC 2004 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jorge Tavares
    • 1
  • Francisco B. Pereira
    • 1
    • 2
  • Ernesto Costa
    • 1
  1. 1.Centre for Informatics and Systems of the University of Coimbra, Polo IICoimbraPortugal
  2. 2.Instituto Superior de Engenharia de CoimbraCoimbraPortugal

Personalised recommendations