论文信息 - GRASP for Low Autocorrelated Binary Sequences

GRASP for Low Autocorrelated Binary Sequences

The search for low autocorrelated binary sequences(LABS) is a combinatorial optimization problem, which is NP-hard. In this paper, we apply Greedy Randomized Adaptive Search Procedures (GRASP) to tackle the LABS problem. The algorithm is capable of systematically recovering best-known solutions reported by now. Furthermore, it can find out good autocorrelated binary sequences sequences in considerably less time as comparison with other heuristic methods.

Shaowei Wang | Huchen Wang | Shaowei Wang | Huchen Wang

[1] Matthias F. Stallmann,et al. Reliable Cost Predictions for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms , 2003 .

[2] Pascal Van Hentenryck,et al. A Note on Low Autocorrelation Binary Sequences , 2006, CP.

[3] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[4] Carlos Cotta,et al. Finding low autocorrelation binary sequences with memetic algorithms , 2009, Appl. Soft Comput..

[5] Dieter Beule,et al. Evolutionary search for low autocorrelated binary sequences , 1998, IEEE Trans. Evol. Comput..

[6] J. Fontanari. A STATISTICAL MECHANICS ANALYSIS OF THE SET COVERING PROBLEM , 1996 .

[7] MARCEL J. E. GOLAY,et al. Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.

[8] J. Bernasconi. Low autocorrelation binary sequences : statistical mechanics and configuration space analysis , 1987 .

[9] Marcel J. E. Golay,et al. The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.

[10] S. Wang. Efficient heuristic method of search for binary sequences with good aperiodic autocorrelations , 2008 .

[11] S. Mertens. Exhaustive search for low-autocorrelation binary sequences , 1996 .