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