Packages
fixpoint
0.18.1
0.22.2
0.22.1
0.21.5
0.21.4
0.21.3
0.21.2
0.21.1
0.21.0
0.20.6
0.20.5
0.20.4
0.20.3
0.20.2
0.20.1
0.19.5
0.19.4
0.19.3
0.19.2
0.19.1
0.18.2
0.18.1
0.17.6
0.17.5
0.17.4
0.17.3
0.17.2
0.17.1
0.16.5
0.16.4
0.16.3
0.16.2
0.16.1
0.16.0
0.15.6
0.15.5
0.15.4
0.15.3
0.15.2
0.15.1
0.15.0
0.14.9
0.14.8
0.14.7
0.14.6
0.14.5
0.14.4
0.14.3
0.14.2
0.14.1
0.13.5
0.13.4
0.13.2
0.13.1
0.12.9
0.12.8
0.12.7
0.12.6
0.12.5
0.12.4
0.12.2
0.12.1
0.11.8
0.11.7
0.11.6
0.11.5
0.11.4
0.11.3
0.11.2
0.11.1
0.10.7
0.10.6
0.10.5
0.10.4
0.10.3
0.10.2
0.10.1
0.9.12
0.9.11
0.9.10
0.9.9
0.9.8
0.9.7
0.9.6
0.9.5
0.9.4
0.9.3
0.9.2
0.9.1
0.9.0
0.8.52
0.8.51
0.8.50
0.8.49
0.8.48
0.8.46
0.8.44
0.8.43
0.8.42
0.8.41
0.8.40
0.8.39
0.8.38
0.8.37
0.8.36
0.8.35
0.8.34
0.8.33
0.8.32
0.8.31
0.8.30
0.8.29
0.8.28
0.8.27
0.8.26
0.8.25
0.8.24
0.8.23
0.8.22
0.8.21
0.8.20
0.8.19
0.8.18
0.8.17
0.8.16
0.8.15
0.8.14
0.8.13
0.8.12
0.8.11
0.8.10
0.8.9
0.8.8
0.8.7
0.8.6
0.8.5
0.8.4
0.8.3
0.8.2
0.8.1
0.8.0
0.7.10
0.7.9
0.7.8
0.7.7
0.7.6
0.7.5
0.7.4
0.7.3
0.7.2
0.7.1
0.7.0
0.6.5
0.6.4
0.6.3
0.6.2
0.6.1
0.6.0
0.5.12
0.5.11
0.5.10
0.5.9
0.5.8
0.5.7
0.5.6
0.5.5
0.5.4
0.5.3
0.5.2
0.5.1
0.5.0
0.4.3
0.4.2
0.4.1
0.4.0
0.3.6
0.3.5
0.3.4
0.3.3
0.3.2
0.3.1
0.3.0
0.2.3
0.2.2
0.2.1
0.1.3
0.1.2
0.1.1
0.1.0
Constraint Programming Solver
Current section
Files
Jump to
Current section
Files
data/bin_packing/bin_packing_experimental.mzn
% Use this editor as a MiniZinc scratch book
include "globals.mzn";
int: capacity = 1000;
int: N = 60;
array[1..N] of int: weights = [495,474,473,472,466,450,445,444,439,430,419,414,410,395,372,370,
366,366,366,363,361,357,355,351,350,350,347,320,315,307,303,299,
298,298,292,288,287,283,275,275,274,273,273,272,272,271,269,269,
268,263,262,261,259,258,255,254,252,252,252,251];
item_placement = [9, 4, 1, 20, 18, 19, 16, 11, 3, 15, 8, 10, 7, 12, 6, 5, 14, 21, 9, 17, 5, 2, 14, 13, 13, 12, 3, 18, 2, 8, 7, 10, 21, 17, 19, 6, 10, 16, 15, 11, 8, 17, 7, 1, 2, 11, 16, 20, 5, 15, 21, 6, 4, 4, 1, 14, 20, 13, 19, 12];
int: upper_bound = 23;
% int: capacity = 100;
% int: N = 50;
% array[1..N] of int: weights = [99,98,95,95,95,94,94,91,88,87,86,85,76,74,73,71,68,60,55,54,51,
% 45,42,40,39,39,36,34,33,32,32,31,31,30,29,26,26,23,21,21,21,19,
% 18,18,16,15,5,5,4,1];
% int: upper_bound = 26;
% int: capacity = 1000;
% int: N = 120;
% array[1..N] of int: weights = [
% 497,497,495,485,480,478,474,473,472,470,466,450,446,445,445,444,
% 439,434,430,420,419,414,412,410,407,405,400,397,395,376,372,370,
% 366,366,366,366,366,363,363,362,361,357,357,356,356,355,352,351,
% 350,350,350,347,336,333,329,325,320,315,314,313,307,303,302,301,
% 299,298,298,298,295,294,292,290,288,287,283,282,282,276,275,275,
% 274,273,273,272,272,271,271,269,269,268,267,267,266,263,263,262,
% 262,261,260,259,259,259,258,256,255,254,254,254,253,253,253,253,
% 252,252,252,252,251,251,250,250
% ];
%int: upper_bound = 45;
array[1..N] of var 1..upper_bound: item_placement; % = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 19, 20, 18, 21, 22, 23, 23, 24, 17, 25, 24, 25, 23, 16, 14, 15, 13, 22, 22, 25, 22, 24, 24, 25, 12, 3, 4, 5, 1];
% The total number of trucks has to be minimized
constraint bin_packing(capacity, item_placement, weights);
var 1..upper_bound: total_bins = max(item_placement);
solve minimize(total_bins);