Constraint-based local search for the costas array problem

Authors:
Daniel Diaz;Florian Richoux;Philippe Codognet;Yves Caniou;Salvador Abreu
Affiliations:
University of Paris 1-Sorbonne, France;JFLI, CNRS / UPMC / University of Tokyo, Japan;JFLI, CNRS / UPMC / University of Tokyo, Japan;JFLI, CNRS / NII, Japan;Universidade de Évora and CENTRIA FCT/UNL, Portugal
Venue:
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Year:
2012

Citing 4
Cited 0

Yet Another Local Search Method for Constraint Solving

SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Dialectic search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Experiments in parallel constraint-based local search

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Costas Array Problem is a highly combinatorial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, while the parallel version shows nearly linear speedups w.r.t. the sequential one, for instance 120 for 128 cores and 230 for 256 cores.