Skip to main content
SpringerLink
Log in

Exploiting relaxation in local search for LABS

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Branch-and-bound uses relaxation to prune search trees but sometimes scales poorly to large problems. Conversely, local search often scales well but may be unable to find optimal solutions. Both phenomena occur in the construction of low-autocorrelation binary sequences (LABS), a problem arising in communication engineering. This paper proposes a hybrid approach to optimization: using relaxation to prune local search spaces. An implementation gives very competitive results, showing the feasibility of the approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In Lecture notes in computer science : Vol. 1713. Proceedings of the fifth international conference on principles and practice of constraint programming (pp. 73–87). Berlin: Springer.

    Google Scholar 

  • Balas, E., & Toth, P. (1985). Branch and bound methods. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy & D. B. Shmoys (Eds.), The traveling salesman problem: a guided tour of combinatorial optimization. New York: Wiley.

    Google Scholar 

  • Beenker, G., Claasen, T., & Hermens, P. (1985). Binary sequences with a maximally flat amplitude spectrum. Philips Journal of Research, 40, 289–304.

    Google Scholar 

  • Bernasconi, J. (1987). Low autocorrelation binary sequences: statistical mechanics and configuration space analysis. Journal de Physique, 48, 559–567.

    Article  Google Scholar 

  • Brglez, F., Li, X. Y., Stallman, M. F., & Militzer, B. (2003). Reliable cost prediction for finding optimal solutions to labs problem: evolutionary and alternative algorithms. In Fifth international workshop on frontiers in evolutionary algorithms, Cary, NC, USA.

  • de Groot, C., Würtz, D., & Hoffmann, K. H. (1992). Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies. Optimization, 23, 369–384.

    Article  Google Scholar 

  • Freuder, E. C., Dechter, R., Ginsberg, M. L., Selman, B., & Tsang, E. (1995). Systematic versus stochastic constraint satisfaction. In Fourteenth international joint conference on artificial intelligence (pp. 2027–2032). San Mateo: Morgan Kaufmann.

    Google Scholar 

  • Golay, M. (1982). The merit factor of long low autocorrelation binary sequences. IEEE Transactions on Information Theory, 28(3), 543–549.

    Article  Google Scholar 

  • Golay, M., & Harris, D. (1990). A new search for skew-symmetric binary sequences with optimal merit factors. IEEE Transactions on Information Theory, 36, 1163–1166.

    Article  Google Scholar 

  • Hirsch, E. A., & Kojevnikov, A. (2001). Solving boolean satisfiability using local search guided by unit clause elimination. In Seventh international conference on principles and practice of constraint programming, Cyprus.

  • Hoos, H. H., & Stützle, T. (1998). Evaluating Las Vegas algorithms—pitfalls and remedies. In Fourteenth conference on uncertainty in artificial intelligence (pp. 238–245). San Mateo: Morgan Kaufmann.

    Google Scholar 

  • Jussien, N., & Lhomme, O. (2002). Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1), 21–45.

    Article  Google Scholar 

  • Lewandowski, G., & Condon, A. (1996). Experiments with parallel graph coloring heuristics and applications of graph coloring. In D. S. Johnson & M. A. Trick (Eds.), DIMACS series in discrete mathematics and theoretical computer science: Vol. 26. Cliques, coloring and satisfiability: second DIMACS implementation challenge (pp. 309–334). Providence: American Mathematical Society.

    Google Scholar 

  • Lin, S., & Kernighan, B. W. (1973). An effective heuristic for the traveling salesman problem. Operations Research, 21, 498–516.

    Article  Google Scholar 

  • Mertens, S. (1996). Exhaustive search for low-autocorrelation binary sequences. Journal of Physics A: Mathematical and General, 29, L473–L481.

    Article  Google Scholar 

  • Mertens, S., & Bessenrodt, C. (1998). On the ground states of the Bernasconi model. Journal of Physics A: Mathematical and General, 31, 3731–3749.

    Article  Google Scholar 

  • Militzer, B., Zamparelli, M., & Beule, D. (1998). Evolutionary search for low autocorrelated binary sequences. IEEE Transactions on Evolutionary Computing, 2, 34–39.

    Article  Google Scholar 

  • Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1994). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. In E. C. Freuder & A. K. Mackworth (Eds.), Constraint-based reasoning. Cambridge: MIT Press.

    Google Scholar 

  • Morgenstern, C. (1996). Distributed Coloration Neighborhood Search. In D. S. Johnson & M. A. Trick (Eds.), DIMACS series in discrete mathematics and theoretical computer science: Vol. 26. Cliques, coloring and satisfiability: second DIMACS implementation challenge (pp. 335–357). Providence: American Mathematical Society.

    Google Scholar 

  • Mühlenbein, H. (1991). Asynchronous parallel search by the parallel genetic algorithm. In Third IEEE symposium on parallel and distributed processing (pp. 526–533). Los Alamitos: IEEE Computer Society.

    Chapter  Google Scholar 

  • Pesant, G., & Gendreau, M. (1996). A view of local search in constraint programming. In Lecture notes in computer science: Vol. 1118. Second international conference on principles and practice of constraint programming (pp. 353–366). Berlin: Springer.

    Google Scholar 

  • Prestwich, S. D. (2000). A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences. In Lecture notes in computer science: Vol. 1894. Sixth international conference on principles and practice of constraint programming (pp. 337–352). Berlin: Springer.

    Google Scholar 

  • Prestwich, S. D. (2002a). Coloration neighbourhood search with forward checking. Annals of Mathematics and Artificial Intelligence, 34(4), 327–340.

    Article  Google Scholar 

  • Prestwich, S. D. (2002b). Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research 115, 51–72.

    Article  Google Scholar 

  • Prestwich, S. D. (2003). Negative effects of modeling techniques on search performance. Annals of Operations Research, 18, 137–150.

    Article  Google Scholar 

  • Prestwich, S. D. (2004). Incomplete dynamic backtracking for linear pseudo-boolean problems. Annals of Operations Research, 30, 57–73.

    Article  Google Scholar 

  • Prestwich, S. D., & Roli, A. (2005). Symmetry breaking and local search spaces. In Lecture notes in computer science: Vol. 3524. Second international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 273–287). Berlin: Springer.

    Google Scholar 

  • Reinholz, A. (1993). Ein paralleler genetischer algorithmus zur optimierung der binären autokorrelations-funktion. Diplom thesis, Universität Bonn.

  • Reinholz, A. (2005) Private communication (email address: andreas.reinholz@gmx.de).

  • Schaerf, A. (1997). Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Fifteenth international joint conference on artificial intelligence (pp. 1254–1259). San Mateo: Morgan Kaufmann.

    Google Scholar 

  • Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Tenth national conference on artificial intelligence (pp. 440–446). Cambridge: MIT Press.

    Google Scholar 

  • Wang, Q. (1987). Optimization by simulating molecular evolution. Biological Cybernetics, 57, 95–101.

    Article  Google Scholar 

  • Zhang, W. (2002). Depth-first branch-and-bound versus local search: a case study. In Seventeenth national conference on artificial intelligence (pp. 930–935). Austin, TX.

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, Department of Computer Science, University College, Cork, Ireland

    Steven Prestwich

Authors
  1. Steven Prestwich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Steven Prestwich.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prestwich, S. Exploiting relaxation in local search for LABS. Ann Oper Res 156, 129–141 (2007). https://doi.org/10.1007/s10479-007-0226-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0226-9

Keywords

Search

Navigation