Constraint-based search for optimal Golomb rulers

M. M. A. Polash (), M. A. H. Newton () and A. Sattar ()
Additional contact information
M. M. A. Polash: Griffith University
M. A. H. Newton: Griffith University
A. Sattar: Griffith University

Journal of Heuristics, 2017, vol. 23, issue 6, No 4, 532 pages

Abstract: Abstract 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.

Keywords: Golomb ruler; Constraints; Local search; Tabu meta-heuristics (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-017-9353-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:23:y:2017:i:6:d:10.1007_s10732-017-9353-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-017-9353-x

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().