Dominance breaking constraints

Chu, Geoffrey; Stuckey, Peter J.

doi:10.1007/s10601-014-9173-7

Cited by 17 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly to determining the best possible search strategy automatically, it would be highly desirable if solvers could automatically compile/rewrite models into more effective representations. Some early work exists [28,14,44,53] and we argue that much more can be done here.…”

Section: Deviations In Solution Costsmentioning

confidence: 87%

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Koehler

Bürgler

Fontana

et al. 2020

Preprint

View full text Add to dashboard Cite

Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine.In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of a cable tree. We summarize our investigations to model this cable tree wiring problem (CTW) as a traveling salesman problem with atomic, soft atomic, and disjunctive precedence constraints as well as tour-dependent edge costs such that it can be solved by state-of-the-art constraint programming (CP), Optimization Modulo Theories (OMT), and mixed-integer programming (MIP) solvers. It is further shown, how the CTW problem can be viewed as a soft version of the coupled tasks scheduling problem. We discuss various modeling variants for the problem, prove its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances. The complete benchmark set with all models and instance data is available on github and is accepted for inclusion in the MiniZinc challenge 2020.

show abstract

Section: Deviations In Solution Costsmentioning

confidence: 87%

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Koehler

Bürgler

Fontana

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…The concept of dominance is also used in different contexts in the constraint programming community. Dominance breaking [5] for COPs creates constraints that, given a mapping σ, prevent the finding of solutions θ such that σ(θ) is a better solution of the COP. They can drastically improve solving performance.…”

Section: Related Work and Discussionmentioning

confidence: 99%

“…They can drastically improve solving performance. [5] rely on a notion of dominance relation that applies to all valuations and not just solutions, so that sub-trees can be pruned during the search. In that sense they are complementary to the solution dominance we consider in this paper.…”

Section: Related Work and Discussionmentioning

confidence: 99%

Solution Dominance over Constraint Satisfaction Problems

Guns¹,

Stuckey²,

Tack³

2018

Preprint

Self Cite

View full text Add to dashboard Cite

Constraint Satisfaction Problems (CSPs) typically have many solutions that satisfy all constraints. Often though, some solutions are preferred over others, that is, some solutions dominate other solutions. We present solution dominance as a formal framework to reason about such settings. We define Constraint Dominance Problems (CDPs) as CSPs with a dominance relation, that is, a preorder over the solutions of the CSP. This framework captures many well-known variants of constraint satisfaction, including optimization, multi-objective optimization, Max-CSP, minimal models, minimum correction subsets as well as optimization over CP-nets and arbitrary dominance relations. We extend MiniZinc, a declarative language for modeling CSPs, to CDPs by introducing dominance nogoods; these can be derived from dominance relations in a principled way. A generic method for solving arbitrary CDPs incrementally calls a CSP solver and is compatible with any existing solver that supports MiniZinc. This encourages experimenting with different solution dominance relations for a problem, as well as comparing different solvers without having to modify their implementations.

show abstract

“…From a solver's perspective, the model should, e.g., allow for maximum constraint propagation. Today's solvers are able to determine the best possible search strategy automatically, whereas algorithms for automatic problem reformulation are only in its beginnings, see for example [14,29,46,54] and we argue that much more can be done here.…”

Section: Algorithmic Insights For Improving Modelsmentioning

confidence: 99%

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

et al. 2021

View full text Add to dashboard Cite

Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine. In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of a cable tree. We summarize our investigations to model this cable tree wiring problem (CTW). as a traveling salesman problem with atomic, soft atomic, and disjunctive precedence constraints as well as tour-dependent edge costs such that it can be solved by state-of-the-art constraint programming (CP), Optimization Modulo Theories (OMT), and mixed-integer programming (MIP). solvers. It is further shown, how the CTW problem can be viewed as a soft version of the coupled tasks scheduling problem. We discuss various modeling variants for the problem, prove its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances. The complete benchmark set with all models and instance data is available on github and was included in the MiniZinc challenge 2020.

show abstract

Dominance breaking constraints

Cited by 17 publications

References 26 publications

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Solution Dominance over Constraint Satisfaction Problems

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

Contact Info

Product

Resources

About