Golomb Rulers: The Advantage of Evolution

In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solutions and that can be considered as a realistic alternative to massive parallel approaches that need several months or years to discover high quality Golomb rulers.

[1]  Ronald C. Read,et al.  Graph theory and computing , 1972 .

[2]  James B. Shearer,et al.  Some new optimum Golomb rulers , 1990, IEEE Trans. Inf. Theory.

[3]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[4]  Apostolos Dollas,et al.  A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler , 1998, IEEE Trans. Inf. Theory.

[5]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[6]  F. Biraud,et al.  On optimum synthetic linear arrays with application to radioastronomy , 1974 .

[7]  H. Petroski.  Technology and Societies , 1998, American Scientist.

[8]  Abdollah Homaifar,et al.  Genetic Algorithm Approach to the Search for Golomb Rulers , 1995, ICGA.

[9]  Solomon W. Golomb,et al.  HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. , 1972 .

[10]  Torleiv Kløve.  Bounds and construction for difference triangle sets , 1989, IEEE Trans. Inf. Theory.

[11]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[12]  A. Tanenbaum.  Computer recreations , 1973 .

[13]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[14]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[15]  Franz Rothlauf,et al.  Network Random Keys-A Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2005 .

[16]  Jorge Nuno Silva,et al.  Mathematical Games , 1959, Nature.

[17]  Mika Johnsson,et al.  An adaptive hybrid genetic algorithm for the three-matching problem , 2000, IEEE Trans. Evol. Comput..