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 not whole problem classes. We integrate automated enhancement into the tailoring procedure, which creates a novel setup with great potential, as our empirical analysis confirms: impressive speedups, additional propagation and instance reduction, all for investing little computational effort.
منابع مشابه
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative models of a given problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, the Essence language allows the specification of a problem abstractly, i.e. without making modell...
متن کاملSet Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively model set constraint problems and to encode them automatically into SAT instances. We apply our technique to the Social Golfer Problem and we also use it to b...
متن کاملConngurable Solvers: Tailoring General Methods to Speciic Applications
Applying constraint-based problem solving methods in a new domain often requires considerable work. In this talk I will examine the state of the art in constraint-based problem solving techniques and the diiculties involved in selecting and tuning an algorithm to solve a problem. Most constraint-based solvers have many algorithmic variations, and it can make a very signiicant diierence exactly ...
متن کاملAutomated Constraint Model Enhancement during Tailoring
Constraint modelling is difficult, particularly for novices. Hence, automated methods for improving models are valuable. The context of this paper is tailoring, a process where a solver-independent constraint model is adapted to a target solver. Tailoring is augmented with automated enhancement techniques, in particular common subexpression detection and elimination, which, while powerful, can ...
متن کاملA Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009