| 1. |
- Aggoun, Abderrahmane, et al.
(författare)
-
Integrating rule-based modelling and constraint programming for solving industrial packing problems
- 2010. - 4
-
Ingår i: ERCIM News. - : ERCIM EEIG. - 0926-4981 .- 1564-0094. ; , s. 34-35
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- Packing items in bins is an old but nevertheless challenging combinatorial problem with numerous applications in industry. We report on an original approach based on constraint programming and rule-based modelling, which has been investigated in the framework of the FP6 ‘specific targeted research project’ Net-WMS (Towards integrating virtual reality and optimization techniques in a new generation of Networked businesses in Warehouse Management Systems under constraints). It has applications in the automotive industry.
|
|
| 2. |
|
|
| 3. |
- Arafailova, Ekaterina, et al.
(författare)
-
Global Constraint Catalog Volume II: Time-Series Constraints
- 2016
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with accumulators.
|
|
| 4. |
- Arafailova, Ekaterina, et al.
(författare)
-
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints
- 2016
-
Ingår i: Principles and Practice of Constraint Programming. - Cham : Springer Publishing Company. - 9783319449524 - 9783319449531 ; , s. 13-29
-
Konferensbidrag (refereegranskat)abstract
- Integer time series are often subject to constraints on the aggregation of the integer features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the peak widths. It is currently unknown how to maintain domain consistency efficiently on such constraints. We propose parametric ways of systematically deriving glue constraints, which are a particular kind of implied constraints, as well as aggregation bounds that can be added to the decomposition of time-series constraints [5]. We evaluate the beneficial propagation impact of the derived implied constraints and bounds, both alone and together.
|
|
| 5. |
|
|
| 6. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
- 2007. - 1
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time constraints. The constraint kernel is generic in the sense that one of its parameters is a set of constraints on subsets of the objects. These constraints are handled globally by the kernel. We first illustrate how to model several placement problems with the constraint kernel. We then explain how new constraints can be introduced and plugged into the kernel. Based on these interfaces, we develop a generic k-dimensional lexicographic sweep algorithm for filtering the attributes of an object (i.e., its shape and the coordinates of its origin as well as its start, duration and end in time) according to all constraints where the object occurs. Experiments involving up to hundreds of thousands of objects and 1 million integer variables are provided in 2, 3 and 4 dimensions, both for simple shapes (i.e., rectangles, parallelepipeds) and for more complex shapes.
|
|
| 7. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A Modelling Pearl with Sortedness Constraints
- 2015. - 9
-
Ingår i: GCAI 2015. Global Conference on Artificial Intelligence. - : EasyChair. ; , s. 27-41
-
Konferensbidrag (refereegranskat)abstract
- Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) constraint, which holds if S is a nondecreasing rearrangement of the list L, the permutation being made explicit by the optional list P. However, such sortedness constraints do not seem to be used much in practice. We argue that reasons for this neglect are that it is impossible to require the underlying sort to be stable, so that Sort cannot be guaranteed to be a total-function constraint, and that L cannot contain tuples of variables, some of which form the key for the sort. To overcome these limitations, we introduce the StableKeysort constraint, decompose it using existing constraints, and propose a propagator. This new constraint enables a powerful modelling idiom, which we illustrate by elegant and scalable models of two problems that are otherwise hard to encode as constraint programs.
|
|
| 8. |
|
|
| 9. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A New multi-resource cumulatives constraint with negative heights
- 2002. - 1
-
Ingår i: CP'2002, Principles and Practice of Constraint Programming. - Berlin, Heidelberg : Springer-Verlag. ; , s. 63-79
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a new cumulatives constraint which generalizes the original cumulative constraint in different ways. The two most important aspects consist in permitting multiple cumulative resources as well as negative heights for the resource consumption of the tasks. This allows modeling in an easy way new scheduling and planning problems. The introduction of negative heights has forced us to come up with new propagation algorithms and to revisit existing ones. The first propagation algorithm is derived from an idea called sweep which is extensively used in computational geometry; the second algorithm is based on a combination of sweep and constructive disjunction, while the last is a generalization of task intervals to this new context. A real-life timetabling problem originally motivated this constraint which was implemented within the SICStus finite domain solver and evaluated against different problem patterns.
|
|
| 10. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A New Multi-Resource cumulatives Constraint with Negative Heights
- 2001. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This paper presents a new cumulatives constraint which generalizes the original cumulative constraint in different ways. The two most important aspects consist in permitting multiple cumulative resources as well as negative heights for the resource consumption of the tasks. This allows modeling in an easy way new scheduling and planning problems. The introduction of negative heights has forced us to come up with new propagation algorithms and to revisit existing ones. The first propagation algorithm is derived from an idea called sweep which is extensively used in computational geometry; the second algorithm is based on a combination of sweep and constructive disjunction, while the last is a generalization of task intervals to this new context. A real-life timetabling problem originally motivated this constraint which was implemented within the SICStus finite domain solver and evaluated against different problem patterns.
|
|
