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

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

Iteration 2
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 25734.000000
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 = 87255.000000
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 = 25734.000000
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 = 87255.000000
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 25734.000000
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 = 87255.000000
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 25734.000000
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 = 87255.000000
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 24875.208673
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 = 71891.000000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 24425.815002
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 = 71891.000000
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 24131.041835
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 = 71891.000000
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21404.369853
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 = 29660.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 21115.905432
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20905.959065
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20740.757344
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20604.506542
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 20488.537902
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20387.577825
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20298.176264
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20217.952653
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20145.194207
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20078.627082
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20017.278951
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 20041.526784
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 20006.746931
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 19967.360321
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19927.810262
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19889.220046
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 19851.940204
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19816.063142
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19781.579296
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19748.437832
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19716.569914
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19685.902516
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 19656.362288
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19627.878828
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19600.386197
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 19573.822958
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19548.131928
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19523.260408
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19499.160149
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19475.786519
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19453.098260
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19431.057260
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 19409.628855
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 19388.780310
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19368.481691
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19348.705383
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19329.425630
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19310.618266
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19292.261160
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19274.333227
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 19256.815486
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 = 29660.000000
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 = 19239.689290
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 19222.938091
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 19206.545854
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19190.497412
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 19174.779139
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19159.377444
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19144.280125
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19129.475171
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 19114.952026
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19100.699819
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 19086.708729
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19072.969439
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 19059.473201
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19046.211560
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 19033.176402
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 19020.360324
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = 19007.755903
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18995.356478
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 46 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 18983.155534
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18971.146554
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18959.323855
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18947.681751
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18936.214825
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18924.917683
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18913.785501
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18902.813747
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 18891.997736
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18881.332892
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18870.815375
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18860.441047
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18850.206145
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18845.156604
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18840.172973
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18835.253806
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18830.397333
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18825.601892
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18820.866205
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18816.188698
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18811.567944
The time to read the lower bound solution = 32 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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18807.002465
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18802.491066
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18798.032678
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 = 29660.000000
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 = 31 ms
The lower bound solution is:
z = 18793.625872
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18789.269305
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18784.962092
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18780.703148
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18776.491181
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18772.325506
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18768.204694
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18764.128178
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18760.094769
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18756.103713
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18752.153906
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18748.244889
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18744.375446
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18740.545051
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18736.752796
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18732.997845
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18729.279682
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 18725.597327
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18721.950502
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18718.338123
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18714.759661
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18711.214767
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18707.702447
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 18704.222244
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18700.773512
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18697.355754
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 = 29660.000000
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 = 18693.968543
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 = 29660.000000
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 = 32 ms
The lower bound solution is:
z = 18690.611052
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18687.283020
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18683.983949
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18680.713071
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18677.470065
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18674.254450
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18671.065889
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18667.903755
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18664.767821
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18661.657231
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18658.572100
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18655.511741
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18652.475803
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18649.463792
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18646.475379
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 = 29660.000000
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 = 18643.510575
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18640.568413
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18637.648901
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18634.751599
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 = 29660.000000
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 = 31 ms
The lower bound solution is:
z = 18631.876264
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18629.022377
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18626.189822
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18623.378143
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18620.587255
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18617.816421
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18615.065851
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18612.334947
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18609.623460
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18606.931174
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 18604.257724
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18601.603119
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18598.966794
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 = 29660.000000
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 = 31 ms
The lower bound solution is:
z = 18596.348640
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18593.748253
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18591.165688
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18588.600420
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18586.052475
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18583.521319
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18581.007025
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18578.509093
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18576.027606
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18573.562159
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18572.337268
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18571.120307
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18569.911128
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18568.709469
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18567.515418
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18566.328852
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18565.149557
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18563.977695
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18562.812799
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18561.655140
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18560.504386
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18559.360531
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18558.223629
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18557.093445
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18555.970019
The time to read the lower bound solution = 32 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 = 29660.000000
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18554.853047
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18553.742619
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18552.638648
The time to read the lower bound solution = 46 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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18551.541056
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18550.449822
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18549.364654
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18548.285777
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18547.212894
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18546.146171
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18545.085190
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18544.030387
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18542.981120
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18541.937717
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18540.899946
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18539.868010
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18538.841419
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18537.820360
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18536.804749
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18535.794691
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18534.789805
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18533.790368
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18532.795979
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18531.806920
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18530.822727
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18529.843810
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18528.869877
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18527.900874
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18526.936763
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18525.977704
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18525.023198
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18524.073637
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18523.128586
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18522.188376
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 = 29660.000000
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 = 0 ms
The lower bound solution is:
z = 18521.252764
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18520.321832
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18519.395210
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18518.473250
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18517.555567
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18516.642581
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18515.733695
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18514.829135
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18513.928947
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18513.032996
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18512.141219
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18511.253681
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18510.370250
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18509.490886
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18508.615486
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18507.744221
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18506.876728
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18506.013419
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18505.153784
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18504.298168
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18503.446340
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18502.598433
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18501.754008
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18500.913492
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 = 29660.000000
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 = 18500.076728
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 = 29660.000000
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 = 18499.243589
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18498.414020
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18497.588070
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18496.765708
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18495.946857
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18495.131610
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18494.319764
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 18493.915662
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18493.513081
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18493.112301
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18492.713263
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18492.315761
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18491.920122
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18491.525776
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18491.133386
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18490.742430
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18490.353128
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18489.965424
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 18489.579425
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18489.194785
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18488.811801
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18488.430211
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18488.050359
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18487.671875
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18487.294931
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18486.919409
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 = 29660.000000
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 = 18486.545342
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18486.172820
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18485.801791
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18485.432241
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18485.064028
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = 18484.697209
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18484.331915
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18483.967859
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18483.605266
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 = 29660.000000
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 = 15 ms
The lower bound solution is:
z = 18483.244039
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18482.884249
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18482.525865
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18482.168664
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18481.812886
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18481.458419
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18481.105165
The time to read the lower bound solution = 32 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 = 29660.000000
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18480.753472
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18480.402868
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18480.053634
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18479.705528
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18479.358944
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18479.013405
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18478.669259
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18478.326330
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 18477.984520
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18477.643949
The time to read the lower bound solution = 32 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 = 29660.000000
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 = 18477.304800
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 = 29660.000000
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 = 16 ms
The lower bound solution is:
z = 18476.966590
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18476.629762
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18476.293964
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18475.959591
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18475.626231
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18475.294045
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18474.962935
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18474.633152
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18474.304409
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 18473.976824
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18473.650179
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18473.324848
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 = 29660.000000
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18473.000583
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 = 29660.000000
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 321235 ms
The total time to calculate the lower bounds with CPLEX = 3719 ms
The total time to calculate the upper bounds with CPLEX = 30 ms
The total time to create the lower bound problems = 6860 ms
The total time to read the lower bound solutions = 2566 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 32 ms
The total time to read the upper bound solutions = 16 ms 

The best upper bound found = 29660.000000, the best lower bound found = 25734.000000
Therefore the duality gap is 15.256081%
