Evolutionary search for low autocorrelated binary sequences

The search for low autocorrelated binary sequences is a classical example of a discrete frustrated optimization problem. We demonstrate the efficiency of a class of evolutionary algorithms to tackle the problem. A suitable mutation operator using a preselection scheme is constructed, and the optimal parameters of the strategy are determined