Symmetry Breaking and Local Search Spaces

The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust solvers and models. A recently observed phenomenon is the negative effect of symmetry breaking constraints on local search performance. The reasons for this are poorly understood, and we attempt to shed light on the phenomenon by testing three conjectures: that the constraints create deep new local optima; that they can reduce the relative size of the basins of attraction of global optima; and that complex local search heuristics reduce their negative effects.

[1]  Yaneer Bar-Yam,et al.  Dynamics Of Complex Systems , 2019 .

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

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

[4]  Jean-François Puget.  Symmetry Breaking Revisited , 2002, CP.

[5]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[6]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[7]  Wolfgang Christian,et al.  Dynamics of Complex Systems (Studies in Nonlinearity) , 1998 .

[8]  Steven David Prestwich.  First-Solution Search with Symmetry Breaking and Implied Constraints , 2001 .

[9]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[10]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[11]  S. Prestwich,et al.  Supersymmetric Modeling for Local Search , 2002 .

[12]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[13]  Dale Schuurmans,et al.  The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.

[14]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[15]  Boi Faltings,et al.  Applying interchangeability techniques to the distributed breakout algorithm , 2003, IJCAI.

[16]  Steven David Prestwich.  Negative Effects of Modeling Techniques on Search Performance , 2003, Ann. Oper. Res..

[17]  Holger H. Hoos,et al.  UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.

[18]  Steven David Prestwich,et al.  Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search , 2002, Ann. Oper. Res..

[19]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[20]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[21]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[22]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[23]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[24]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .