Static Symmetry Breaking with the Reflex Ordering
نویسندگان
چکیده
LexLeader, a state of the art static symmetry breaking method, adds a lex ordering constraint for each variable symmetry of the problem to select the lexicographically least solution. In practice, the same method can also be used for partial symmetry breaking by breaking only a given subset of symmetries. We propose a new total ordering, reflex, as basis of a new symmetry breaking constraint that collaborates well among themselves as well as with Precedence constraints, thereby breaking more composition symmetries in partial symmetry breaking. An efficient GAC filtering algorithm is presented for the reflex ordering constraint. We propose the ReflexLeader method, which is a variant of LexLeader using the reflex ordering instead, and give conditions when ReflexLeader is safe to combine with the Precedence and multiset ordering constraints. Extensive experimentations demonstrate empirically our claims and substantial advantages of the reflex ordering over the lex ordering in partial symmetry breaking.
منابع مشابه
Symmetry Breaking and Branching Constraints
Symmetry breaking is the process of eliminating redundant search by taking advantage of the symmetries in a problem. Symmetry breaking techniques can be combined with other search heuristics, such as branching constraints and variable orderings. The interaction between dynamic symmetry breaking and domain splitting is discussed, and preliminary results are presented showing the impact of variab...
متن کاملSymmetry Breaking by Nonstationary Optimisation
We describe a new partial symmetry breaking method that can be used to break arbitrary variable/value symmetries in combination with depth first search, static value ordering and dynamic variable ordering. The main novelty of the method is a new dominance detection technique based on local search in the symmetry group. It has very low time and memory requirements, yet in preliminary experiments...
متن کاملPosting Static Symmetry Breaking Constraints Dynamically
Symmetry is an important feature of many combinatorial search problems. We propose a new method for dynamically posting static symmetry breaking constraints during search. This method is based on the observations that any symmetry of a set of symmetry breaking constraints can be used to break symmetry, and different symmetries pick out different solutions. We choose which symmetry to post as br...
متن کاملGAPLex: Combining Static and Dynamic Symmetry Breaking
We describe a novel and effective suite of algorithms that combine the efficiency and ease of use of lex-ordering, with the power of breaking symmetry in CSPs by using computational group theory during search. We show that our new symmetry breaking method, GAPLex, is sound (will neither lose solutions nor return incorrect solutions) and complete (will return exactly one member from each class o...
متن کاملCombining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...
متن کامل