Constraint 2 is not relaxed
Constraint 3 is relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 438 ms

Iteration 1
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 125 ms
The lower bound solution is:
z = -12570.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 73819.861905
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -10495.643316
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 77885.230769
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -8472.071187
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77885.230769
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -6669.048598
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 77115.230769
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 63 ms
The lower bound solution is:
z = -5220.248208
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -3797.526226
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -2400.413237
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1028.448286
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 318.821297
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 1641.840027
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 2941.044423
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 4216.863140
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 5469.717113
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 77115.230769
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 6574.679812
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 7381.621998
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 8178.880879
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 8966.572650
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 9744.812121
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 10513.712719
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 11273.386509
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 21
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 12023.944214
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 22
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 12765.495227
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 13498.147628
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 14222.008197
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 14937.182443
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 26
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 15643.774598
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 16341.887643
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17031.623333
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 17713.082198
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18386.363553
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19051.565535
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19708.785091
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20358.118011
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20999.658936
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21633.501374
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 22259.737698
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 22878.459193
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 23489.756023
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 24093.717293
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 24690.431031
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 25279.984201
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 42
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 25862.462732
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 26437.951523
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 27006.534447
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 27568.294375
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 28123.313189
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 28671.671770
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 29213.450054
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 29748.726995
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 30277.580614
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 30800.087990
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 31316.325275
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 31826.367717
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 32330.289648
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 32828.164513
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 33320.064881
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 33806.062445
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 34286.228041
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 59
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 34760.631647
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 35229.342408
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 35692.428643
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 36149.957844
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 36601.996694
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 37048.611074
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 37489.866084
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 37925.826033
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 38356.554464
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 38782.114156
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 39202.567127
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 39617.974664
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 71
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 40028.397310
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 72
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 40433.894887
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 40834.526489
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 74
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 41180.498968
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 81869.015385
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 41426.186693
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 41814.910795
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 42154.399257
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 81869.015385
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 42388.962985
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 42766.133773
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 43099.285346
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 81869.015385
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 43323.101969
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 43506.082529
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 43687.965204
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 43868.454499
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 43958.308721
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 44047.893381
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44137.209285
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44226.257244
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 44315.038058
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44403.552531
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 91
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44491.801459
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 44579.785639
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 93
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44667.505868
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 44754.962935
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 44842.157633
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 44929.090746
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 45015.763059
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 45102.175356
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 45188.328416
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 100
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 45274.223015
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 45359.859932
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 45445.239938
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 45530.363805
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 45615.232300
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 45699.846188
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 45784.206236
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 107
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 45868.313202
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 45952.167847
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46035.770930
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 46119.123202
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46202.225419
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46285.078328
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 46367.682679
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46450.039218
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46532.148686
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 46614.011824
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46695.629375
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 46777.002072
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 46858.130652
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 46939.015844
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47019.658384
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 47100.058995
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47180.218403
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 124
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47260.137334
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 47339.816507
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 47419.256643
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 47498.458459
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 47577.422669
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47656.149987
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 47734.641124
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 47812.896783
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47890.917681
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 47968.704512
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48046.257987
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48123.578797
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48200.667647
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48277.525229
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48354.152239
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48430.549370
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48506.717304
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48582.656738
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48658.368356
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 48733.852837
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48809.110864
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 48884.143117
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 48958.950272
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49033.533008
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49107.891993
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49182.027903
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49255.941406
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49329.633169
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 152
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49403.103853
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49476.354128
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49549.384649
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49622.196085
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 49694.789079
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49767.164299
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49839.322394
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 49911.264011
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 49982.989802
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50054.500421
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50075.146968
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50031.819052
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50067.436127
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50102.884159
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50044.791927
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50080.367393
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50115.942861
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50108.877836
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50093.269546
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50128.825427
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 50136.579167
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50106.183481
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50141.708404
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50164.249294
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50119.115110
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50154.598527
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50190.081946
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50170.239192
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50167.479547
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50202.924218
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50197.853882
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50180.334103
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50215.759510
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50225.453569
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50193.205488
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50228.597099
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50253.018057
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50206.091532
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50241.441799
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50276.792062
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50258.983683
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50254.272607
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50289.587209
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50286.497039
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50267.079991
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50302.375403
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50313.995446
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50279.908963
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50315.167761
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50341.454700
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50292.749583
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50327.967195
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50363.184806
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 205
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50347.396149
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50340.747984
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50375.933001
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50374.808545
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50353.508371
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 210
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50388.674267
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50402.206042
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50366.295069
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50401.421551
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 214
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50429.561179
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50379.089251
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50414.174704
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50449.260155
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50435.478549
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50426.905665
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 220
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50461.961569
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50462.790355
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50439.621265
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50474.656870
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50490.085592
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50452.364577
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50487.359239
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50517.338071
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50465.110748
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50500.064535
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50535.018320
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50523.231451
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50512.745861
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50547.673129
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50550.443038
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 235
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50525.419577
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50560.323706
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50577.634060
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50538.117975
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50572.981316
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50604.784276
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50550.816315
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50568.227624
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50585.638931
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50603.050239
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50620.461548
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50621.278268
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50609.367188
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50626.766124
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50634.830397
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50615.683680
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50633.072453
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50648.372098
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50622.000592
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50639.379210
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50656.757826
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 256
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50651.298005
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50645.679821
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 47 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50663.052147
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50664.829782
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50651.979334
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50669.345610
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50678.356025
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50658.284690
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50675.640821
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50691.872305
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50664.589745
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50681.935737
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50699.281729
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 269
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50694.792282
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50688.224060
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50705.564495
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50708.299214
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50694.513191
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50711.846863
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 275
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50721.799626
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50700.807425
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50718.130976
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50735.290530
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50707.100645
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50724.414075
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50741.727502
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50738.204586
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50730.690135
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50747.998734
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50751.686724
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50736.968895
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50754.270025
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50765.161352
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50743.252034
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50760.543059
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50777.834085
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50768.074498
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50766.813986
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50784.095506
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 50781.535538
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50773.078400
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 50790.355225
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50794.992925
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 92929.864286
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50779.346809
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 79158.904762
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 50796.615461
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 79158.904762
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 403828 ms
The total time to calculate the lower bounds with CPLEX = 3261 ms
The total time to calculate the upper bounds with CPLEX = 1062 ms
The total time to create the lower bound problems = 2716 ms
The total time to read the lower bound solutions = 959 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 926 ms
The total time to read the upper bound solutions = 279 ms 

The best upper bound found = 73819.861905, the best lower bound found = 50796.615461
Therefore the duality gap is 45.324371%
