A Tabu Search algorithm for difference triangle sets and Golomb rulers

A Tabu Search algorithm for difference triangle sets and Golomb rulers

0.00 Avg rating0 Votes
Article ID: iaor20072027
Country: United Kingdom
Volume: 33
Issue: 4
Start Page Number: 955
End Page Number: 970
Publication Date: Apr 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: communication, combinatorial optimization
Abstract:

We propose a Tabu Search heuristic to design optimal Golomb rulers and Difference Triangle Sets. These two highly combinatorial problems have a number of applications in information transmission in telecommunications, and in particular in the construction of convolutional self-orthogonal codes. Our tabu algorithm obtains remarkable results and finds many Difference Triangle Sets with smaller spans than those obtained so far.

Reviews

Required fields are marked *. Your email address will not be published.