Constraint-based search for optimal Golomb rulers

Finding optimal Golomb rulers is an extremely challenging combinatorial problem. The distance between each pair of mark is unique in a Golomb ruler. For a given number of marks, an optimal Golomb ruler has the minimum length. Golomb rulers are used in application areas such as X-ray crystallography, radio astronomy, information theory, and pulse phase modulation. The most recent optimal Golomb ruler search algorithm hybridises a range of techniques such as greedy randomised adaptive search, scatter search, tabu search, clustering techniques, and constraint programming, and obtains optimal Golomb rulers of up to 16 marks with very low success rates. In this paper, we provide tight upper bounds for Golomb ruler marks and present heuristic-based effective domain reduction techniques. Using these along with tabu and configuration checking meta-heuristics, we then develop a constraint-based multi-point local search algorithm to perform a satisfaction search for optimal Golomb rulers of specified length. We then present an algorithm to perform an optimisation search that minimises the length using the satisfaction search repeatedly. Our satisfaction search finds optimal Golomb rulers of up to 19 marks while the optimisation search finds up to 17 marks.

[1]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[2]  Konstantinos Drakakis,et al.  A review of the available construction methods for Golomb rulers , 2009, Adv. Math. Commun..

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

[4]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[5]  Andrew Lewis,et al.  Twin Removal in Genetic Algorithms for Protein Structure Prediction Using Low-Resolution Model , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[6]  S. Prestwich,et al.  Supersymmetric Modeling for Local Search , 2002 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[9]  Pascal Van Hentenryck,et al.  Differentiable Invariants , 2006, CP.

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

[11]  Pascal Van Hentenryck,et al.  Parallel Local Search in Comet , 2005, CP.

[12]  Michael J. Maher,et al.  Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation , 2011, CP.

[13]  Abderrazak Jemai,et al.  A hybrid genetic algorithm for Golomb ruler problem , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[14]  Ian Miguel,et al.  Automatically Generating Streamlined Constraint Models with Essence and Conjure , 2015, CP.

[15]  William T. Rankin,et al.  Optimal Golomb Rulers: An Exhaustive Parallel Search Implementation , 1993 .

[16]  Arthur J. Bernstein,et al.  A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.

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

[18]  Pascal Van Hentenryck,et al.  Local Search-based Hybrid Algorithms for Finding Golomb Rulers , 2007, Constraints.

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

[20]  A. K. Dewdney.  Computer recreations : the complete computer caricaturist and whimsical tour of face space , 1986 .

[21]  Abdul Sattar,et al.  Constraint-Based Local Search for Golomb Rulers , 2015, CPAIOR.

[22]  Steven Prestwich,et al.  Trading Completeness for Scalability: Hybrid Search for Cliques and Rulers , 2015 .

[23]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

[25]  Brigitte Jaumard,et al.  A Constraint-Based Approach to the Golomb Ruler Problem , 2007 .

[26]  W. C. Babcock.  Intermodulation interference in radio systems frequency of occurrence and control by channel selection , 1953 .

[27]  Robert M. Gagliardi,et al.  Acquisition sequences in PPM communications , 1987, IEEE Trans. Inf. Theory.

[28]  Pascal Van Hentenryck,et al.  Constraint-based local search , 2018, Handbook of Heuristics.

[29]  Andrea Roli,et al.  Symmetry Breaking and Local Search Spaces , 2005, CPAIOR.

[30]  Pascal Van Hentenryck,et al.  A simple hybrid evolutionary algorithm for finding Golomb rulers , 2005, 2005 IEEE Congress on Evolutionary Computation.

[31]  Kaile Su,et al.  Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

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

[33]  Meinolf Sellmann,et al.  Streamlined Constraint Reasoning , 2004, CP.

[34]  Toby Walsh,et al.  Modelling the Golomb Ruler Problem , 1999 .

[35]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..