Jip J. Dekker
1d9faf38de
git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
113 lines
4.6 KiB
MiniZinc
113 lines
4.6 KiB
MiniZinc
%
|
|
% Main authors:
|
|
% Guido Tack <tack@gecode.org>
|
|
%
|
|
% Copyright:
|
|
% Guido Tack, 2007
|
|
%
|
|
% This file is part of Gecode, the generic constraint
|
|
% development environment:
|
|
% http://www.gecode.org
|
|
%
|
|
% Permission is hereby granted, free of charge, to any person obtaining
|
|
% a copy of this software and associated documentation files (the
|
|
% "Software"), to deal in the Software without restriction, including
|
|
% without limitation the rights to use, copy, modify, merge, publish,
|
|
% distribute, sublicense, and/or sell copies of the Software, and to
|
|
% permit persons to whom the Software is furnished to do so, subject to
|
|
% the following conditions:
|
|
%
|
|
% The above copyright notice and this permission notice shall be
|
|
% included in all copies or substantial portions of the Software.
|
|
%
|
|
% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
% EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
% MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
% NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
% LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
% OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
% WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
%
|
|
%
|
|
|
|
% This file contains predicate definitions for additional constraints available
|
|
% in the Gecode FlatZinc interpreter.
|
|
|
|
% Additional search annotations
|
|
annotation afc_min;
|
|
annotation afc_size_min;
|
|
annotation afc_max;
|
|
annotation afc_size_max;
|
|
annotation activity_min;
|
|
annotation activity_size_min;
|
|
annotation activity_max;
|
|
annotation activity_size_max;
|
|
annotation random;
|
|
annotation int_assign(array[int] of var int: x, ann:a);
|
|
|
|
annotation int_default_search(ann: varsel, ann: valsel);
|
|
annotation bool_default_search(ann: varsel, ann: valsel);
|
|
annotation set_default_search(ann: varsel, ann: valsel);
|
|
annotation float_default_search(ann: varsel, ann: valsel);
|
|
|
|
% Simple LNS: upon restart, for each variable the probability of it being
|
|
% fixed to the previous solution is 'percentage' (out of 100).
|
|
annotation relax_and_reconstruct(array[int] of var int: x, int: percentage);
|
|
|
|
% Simple LNS: upon restart, for each variable the probability of it being
|
|
% fixed to the previous solution is 'percentage' (out of 100). Start from
|
|
% an initial solution y.
|
|
annotation relax_and_reconstruct(array[int] of var int: x, int: percentage, array[int] of int: y);
|
|
|
|
% i in z <-> forall (j in x) (i in y[j])
|
|
predicate gecode_array_set_element_intersect(var set of int: x,
|
|
array[int] of var set of int: y, var set of int: z);
|
|
|
|
% (i in z <-> exists (j in x) (i in y[j])) /\ (i in x /\ j in x /\ i!=j -> disjoint(y[i],y[j]))
|
|
predicate gecode_array_set_element_partition(var set of int: x,
|
|
array[int] of var set of int: y, var set of int: z);
|
|
|
|
% z subset u /\ ( i in z <-> forall (j in x) (i in y[j]) )
|
|
predicate gecode_array_set_element_intersect_in(var set of int: x,
|
|
array[int] of var set of int: y,
|
|
var set of int: z, set of int: u);
|
|
|
|
% Every subsequence of x of length l has at least m and at most occurrences
|
|
% of the values in S
|
|
predicate gecode_among_seq_int(array[int] of var int: x, set of int: S,
|
|
int: l, int: m, int: n);
|
|
|
|
% Every subsequence of x of length l has at least m and at most occurrences
|
|
% of the value b
|
|
predicate gecode_among_seq_bool(array[int] of var bool: x, bool: b,
|
|
int: l, int: m, int: n);
|
|
|
|
% Overloading for among_seq
|
|
predicate among_seq(array[int] of var int: x, set of int: S,
|
|
int: l, int: m, int: n) = gecode_among_seq_int(x,S,l,m,n);
|
|
predicate among_seq(array[int] of var bool: x, bool: b,
|
|
int: l, int: m, int: n) = gecode_among_seq_bool(x,b,l,m,n);
|
|
|
|
% Circuit constraints
|
|
predicate gecode_circuit_cost_array(array[int] of int: c,
|
|
array[int] of var int: x, array[int] of var int: y, var int: z);
|
|
predicate gecode_circuit_cost(array[int] of int: c, array[int] of var int: x,
|
|
var int: z);
|
|
|
|
predicate circuit_cost_array(array[int] of int: c,
|
|
array[int] of var int: x, array[int] of var int: y, var int: z) =
|
|
gecode_circuit_cost_array(c,[x[i]-min(index_set(x)) | i in index_set(x)],
|
|
y,z);
|
|
predicate circuit_cost(array[int] of int: c, array[int] of var int: x,
|
|
var int: z) =
|
|
gecode_circuit_cost(c, [x[i]-min(index_set(x)) | i in index_set(x)], z);
|
|
|
|
% Scheduling constraints
|
|
predicate gecode_schedule_unary(array[int] of var int: x, array[int] of int: p);
|
|
predicate gecode_schedule_unary_optional(array[int] of var int: x,
|
|
array[int] of int: p, array[int] of var bool: m);
|
|
|
|
predicate gecode_schedule_cumulative_optional(array[int] of var int: start,
|
|
array[int] of int: duration, array[int] of int: usage,
|
|
array[int] of var bool: m, int: capacity);
|