Ilp and Constraint Programming Approaches to a Template Design Problem
نویسندگان
چکیده
We describe a design problem arising in the colour printing industry and discuss a number of integer linear programming and constraint programming approaches to its solution. Despite the apparent simplicity of the problem it presents a challenge for both approaches. We present results for three typical cases and show that the constraint programming approach provides better results , although in some cases after considerable handcrafting. We also show that the results obtained by constraint programming can be improved by a simple goal programming model.
منابع مشابه
Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem
Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملUsing CP and ILP with tree decomposition to solve the sum colouring problem
The Minimum Sum Colouring Problem is an NP-hard problem derived from the well-known graph colouring problem. It consists in finding a proper colouring which minimizes the sum of the assigned colours rather than the number of those colours. This problem often arises in scheduling and resource allocation. Mainly incomplete approaches were proposed, but Integer Linear Programming (ILP) and Constra...
متن کاملDirected self-assembly cut mask assignment for unidirectional design
Recently, directed self-assembly (DSA) has emerged as a promising lithography solution for cut manufacturing. We perform a comprehensive study on the DSA aware mask optimization problem to provide a DSA friendly design on cut layers. We first formulate the problem as an integer linear programming (ILP) to assign cuts to different guiding templates, targeting both conflict minimization and line-...
متن کامل