main page
modules
namespaces
classes
files
Gecode home
Generated on Wed Jan 1 2020 10:37:59 for Gecode by
doxygen
1.8.16
test
flatzinc
trucking.cpp
Go to the documentation of this file.
1
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2
/*
3
* Main authors:
4
* Guido Tack <tack@gecode.org>
5
*
6
* Copyright:
7
* Guido Tack, 2014
8
*
9
* This file is part of Gecode, the generic constraint
10
* development environment:
11
* http://www.gecode.org
12
*
13
* Permission is hereby granted, free of charge, to any person obtaining
14
* a copy of this software and associated documentation files (the
15
* "Software"), to deal in the Software without restriction, including
16
* without limitation the rights to use, copy, modify, merge, publish,
17
* distribute, sublicense, and/or sell copies of the Software, and to
18
* permit persons to whom the Software is furnished to do so, subject to
19
* the following conditions:
20
*
21
* The above copyright notice and this permission notice shall be
22
* included in all copies or substantial portions of the Software.
23
*
24
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31
*
32
*/
33
34
#include "
test/flatzinc.hh
"
35
36
namespace
Test
{
namespace
FlatZinc {
37
38
namespace
{
40
class
Create {
41
public
:
42
44
Create(
void
) {
45
(void)
new
FlatZincTest(
"trucking"
,
46
"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
47
predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
48
predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
49
predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
50
array [1..4] of int: Cost = [30, 27, 23, 20];\n\
51
array [1..6] of int: Demand = [27, 11, 14, 19, 25, 22];\n\
52
array [1..4] of int: Loads = [20, 18, 15, 13];\n\
53
var 0..600: INT____00001 :: is_defined_var :: var_is_introduced;\n\
54
var 0..600: obj :: output_var = INT____00001;\n\
55
array [1..24] of var 0..1: x :: output_array([1..4, 1..6]);\n\
56
constraint int_lin_eq([-1, 30, 30, 30, 30, 30, 30, 27, 27, 27, 27, 27, 27, 23, 23, 23, 23, 23, 23, 20, 20, 20, 20, 20, 20], [INT____00001, x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15], x[16], x[17], x[18], x[19], x[20], x[21], x[22], x[23], x[24]], 0) :: defines_var(INT____00001);\n\
57
constraint int_lin_le([1, 1], [x[19], x[20]], 1);\n\
58
constraint int_lin_le([1, 1], [x[20], x[21]], 1);\n\
59
constraint int_lin_le([1, 1], [x[21], x[22]], 1);\n\
60
constraint int_lin_le([1, 1], [x[22], x[23]], 1);\n\
61
constraint int_lin_le([1, 1], [x[23], x[24]], 1);\n\
62
constraint int_lin_le([1, 1, 1], [x[13], x[14], x[15]], 1);\n\
63
constraint int_lin_le([1, 1, 1], [x[14], x[15], x[16]], 1);\n\
64
constraint int_lin_le([1, 1, 1], [x[15], x[16], x[17]], 1);\n\
65
constraint int_lin_le([1, 1, 1], [x[16], x[17], x[18]], 1);\n\
66
constraint int_lin_le([-20, -18, -15, -13], [x[1], x[7], x[13], x[19]], -27);\n\
67
constraint int_lin_le([-20, -18, -15, -13], [x[2], x[8], x[14], x[20]], -11);\n\
68
constraint int_lin_le([-20, -18, -15, -13], [x[3], x[9], x[15], x[21]], -14);\n\
69
constraint int_lin_le([-20, -18, -15, -13], [x[4], x[10], x[16], x[22]], -19);\n\
70
constraint int_lin_le([-20, -18, -15, -13], [x[5], x[11], x[17], x[23]], -25);\n\
71
constraint int_lin_le([-20, -18, -15, -13], [x[6], x[12], x[18], x[24]], -22);\n\
72
solve ::int_search(x, first_fail, indomain_min, complete) minimize INT____00001;\n\
73
"
,
"obj = 224;\n\
74
x = array2d(1..4, 1..6, [0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0]);\n\
75
----------\n\
76
==========\n\
77
"
);
78
}
79
};
80
81
Create
c
;
82
}
83
84
}}
85
86
// STATISTICS: test-flatzinc
Test
General test support.
Definition:
afc.cpp:39
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
flatzinc.hh