Local Search-based Hybrid Algorithms for Finding Golomb Rulers

Authors:
Carlos Cotta;Iván Dotú;Antonio J. Fernández;Pascal Hentenryck
Affiliations:
Dept. Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, Universidad de Málaga, Campus de Teatinos, Málaga, Spain;Dept. Ingeniería Informática, Universidad Autónoma de Madrid, Madrid, Spain;Dept. Lenguajes y Ciencias de la Computación, E.T.S.I. Informática, Universidad de Málaga, Campus de Teatinos, Málaga, Spain;Brown University, Providence, USA 02912
Venue:
Constraints
Year:
2007

Citing 17
Cited 2

Acquistion sequences in PPM communications

IEEE Transactions on Information Theory
Memetic algorithms: a short introduction

New ideas in optimization
Data clustering: a review

ACM Computing Surveys (CSUR)
Embedding Branch and Bound within Evolutionary Algorithms

Applied Intelligence
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Genetic Algorithm Approach to the Search for Golomb Rulers

Proceedings of the 6th International Conference on Genetic Algorithms
A Racing Algorithm for Configuring Metaheuristics

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Unifying Learning with Evolution Through Baldwinian Evolution and Lamarckism

Advances in Computational Intelligence and Learning: Methods and Applications
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Operations Research
Empirical investigation of the benefits of partial lamarckianism

Evolutionary Computation
A memetic approach to golomb rulers

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Analyzing fitness landscapes for the optimal golomb ruler problem

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler

IEEE Transactions on Information Theory

Redundant modeling in permutation weighted constraint satisfaction problems

Constraints
User-Centric optimization with evolutionary and memetic systems

LSSC'11 Proceedings of the 8th international conference on Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Golomb ruler problem is a very hard combinatorial optimization problem that has been tackled with many different approaches, such as constraint programming (CP), local search (LS), and evolutionary algorithms (EAs), among other techniques. This paper describes several local search-based hybrid algorithms to find optimal or near-optimal Golomb rulers. These algorithms are based on both stochastic methods and systematic techniques. More specifically, the algorithms combine ideas from greedy randomized adaptive search procedures (GRASP), scatter search (SS), tabu search (TS), clustering techniques, and constraint programming (CP). Each new algorithm is, in essence, born from the conclusions extracted after the observation of the previous one. With these algorithms we are capable of solving large rulers with a reasonable efficiency. In particular, we can now find optimal Golomb rulers for up to 16 marks. In addition, the paper also provides an empirical study of the fitness landscape of the problem with the aim of shedding some light about the question of what makes the Golomb ruler problem hard for certain classes of algorithm.