Advertisement

Evolving Segments Length in Golomb Rulers

  • Jorge Tavares
  • Tiago Leitão
  • Francisco B. Pereira
  • Ernesto Costa
Conference paper

Abstract

An evolutionary algorithm based on Random Keys to represent Golomb Rulers segments, has been found to be a reliable option for finding Optimal Golomb Rulers in a short amount of time, when comparing with standard methods. This paper presents a modified version of this evolutionary algorithm where the maximum segment length for a Golomb Ruler is also part of the evolutionary process. Attained experimental results shows us that this alteration does not seems to provide significant benefits to the static version of the algorithm.

Keywords

Evolutionary Algorithm Simple Heuristic Facility Layout Good Ruler Facility Layout Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Golomb, S.: How to Number a Graph. In: Graph Theory and Computing. Academic Press (1972) 23–37Google Scholar
  2. [2]
    Blum, E., Biraud, F., Ribes, J.: On optimal synthetic linear arrays with applications to radioastronomy. IEEE Transactions on Antennas and Propagation AP-22 (1974) 108–109Google Scholar
  3. [3]
    Soliday, S., Homaifar, A., G., L.: Genetic algorithm approach to the search for golomb rulers. In: Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA-95), Morgan Kaufmann (1995) 528–535Google Scholar
  4. [4]
    Feeney, B.: Determining optimum and near-optimum golomb rulers using genetic algorithms. Master’s thesis, University College Cork (2003)Google Scholar
  5. [5]
    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’03. (2003) 27–33Google Scholar
  6. [6]
    Cotta, C., Fernndez, A.J.: A hybrid grasp-evolutionary algorithm approach to golomb ruler search. In: Proceedings of Parallel Problem Solving from Nature (PPSNVIII). (2004)Google Scholar
  7. [7]
    Tavares, J., Pereira, F.B., Costa, E.: Understanding the role of insertion and correction in the evolution of golomb rulers. In: Proceedings of the 2004 Congress on EC (CEC04). (2004) 69–76Google Scholar
  8. [8]
    Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154–160MATHGoogle Scholar
  9. [9]
    Norman, B., Smith, A.: Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems. In: Proceedings of the Fourth International Conference on Evolutionary Computation, IEEE (1997) 407–411Google Scholar
  10. [10]
    Rothlauf, F., Goldberg, D., Heinzl, A.D.: Network random keys-a tree representation scheme for genetic and evolutionary algorithms. Evolutionary Computation 10 (2002) 75–97CrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 2005

Authors and Affiliations

  • Jorge Tavares
    • 1
  • Tiago Leitão
    • 1
  • Francisco B. Pereira
    • 1
    • 2
  • Ernesto Costa
    • 1
  1. 1.Polo II - Pinhal de MarrocosCentre for Informatics and Systems of the University of CoimbraCoimbraPortugal
  2. 2.Quinta da NoraInstituto Superior de Engenharia de CoimbraCoimbraPortugal

Personalised recommendations