Optimising Quantified Expressions in the Automated Constraint Modelling Tool TAILOR
نویسندگان
چکیده
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. However, CP is often inaccessible to users without expert knowledge in the area, precluding its widespread use. One of the key difficulties lies in formulating an effective constraint model of an input problem for input to a constraint solver. Automated Constraint Modelling tools address this issue by providing assistance in model formulation. TAILOR is one such modelling tool. It incorporates a number of highly effective model optimisations, which can compensate for a wide selection of poor modelling choices that novices (but also experts) often make. In the context of TAILOR, this paper presents new constraint model optimisation techniques concerned with optimising quantified expressions, constructs that are commonly used in high-level constraint modelling languages, similar to for-loops in programming languages. Our experimental results show that quantified expression optimisations can reduce solving time very considerably.
منابع مشابه
Optimising Quantified Expressions in Constraint Models
One of the key difficulties in Constraint Modeling lies in formulating an effective constraint model of an input problem for input to a constraint solver: many different models exist for a given problem and it is often difficult even for experts to determine the model which is solved most effectively by a constraint solver. In recent years, solver-independent modelling languages (MLs) have beco...
متن کاملA Constraint Model for the Settlers Planning Domain
The Settlers planning domain has proved a challenging problem for planning technology. We present a preliminary model of Settlers in the Essence’ specification language. We generate a constraint model for the CSP solver Minion using the automated modelling tool Tailor. We show this model to be competitive with state-of-the-art planning technology.
متن کاملCommon Subexpression Elimination in Automated Constraint Modelling
Typically, there are many alternative models of a given problem as a constraint satisfaction problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, automated constraint modelling systems allow the abstract specification of a problem, which can then be refined automatically to a solver-independent modelling language. The final step is to tailor...
متن کاملAutomatically Enhancing Constraint Model Instances during Tailoring
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhancement techniques of which many are successfully established in related fields, such as common subexpression elimination. Our aim is to apply these techniques in an efficient fashion, since we tailor instance-wise, and...
متن کاملCost Function Modelling for Semi-automated SC, RTG and Automated and Semi-automated RMG Container Yard Operating Systems
This study analyses the concept of cost functions for semi-automated Straddle Carrier (SC), Rubber Tyred Gantry (RTG) and automated Rail Mounted Gantry (RMG) container yard operating cranes. It develops a generic cost based model for a pair-wise comparison, analysis and evaluation of economic efficiency and effectiveness of container yard equipment to be used for decision-making by terminal pla...
متن کامل