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

Iteration 1
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 141 ms
The lower bound solution is:
z = -227438.000000 + 1757.000000 = -225681.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 46142.846154
The optimal solution has not been found yet.

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

Iteration 3
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1729.563308 + 6569.609173 = 4840.045865
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 115623.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 748.604710 + 7189.151177 = 7937.755887
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 = 115623.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 = 16 ms
The lower bound solution is:
z = 3040.910126 + 7762.227531 = 10803.137657
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 115623.000000
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 4504.436692 + 8292.323159 = 12796.759851
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 107129.000000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 4523.000000 + 8792.514453 = 13315.514453
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 90375.058824
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 9
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 4489.964140 + 9769.948255 = 14259.912395
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90375.058824
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 = -21961.366756 + 10248.192261 = -11713.174495
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 47 ms
The upper bound solution is:
z = 36716.857143
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 12
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -50983.196948 + 10921.900604 = -40061.296344
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 23770.970588
The time to read the upper bound solution = 16 ms
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 = -49784.803617 + 11064.566477 = -38720.237140
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 = 23770.970588
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 = -48586.410284 + 11207.232349 = -37379.177935
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 23770.970588
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 = 16 ms
The lower bound solution is:
z = -47424.474331 + 11349.898222 = -36074.576109
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 23770.970588
The optimal solution has not been found yet.

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

Iteration 17
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -45141.820364 + 11635.229968 = -33506.590396
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 23770.970588
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 = 16 ms
The lower bound solution is:
z = -44000.493382 + 11777.895841 = -32222.597541
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 23770.970588
The optimal solution has not been found yet.

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

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

Iteration 21
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -40576.512432 + 12205.893460 = -28370.618972
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 = 23770.970588
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 = 16 ms
The lower bound solution is:
z = -39438.847822 + 12348.559333 = -27090.288489
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 23770.970588
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -46921.071474 + 12491.225206 = -34429.846268
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -45152.014649 + 12633.891078 = -32518.123571
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 = 24112.882353
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 = -43440.024176 + 12776.556951 = -30663.467225
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 = 24112.882353
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 = 15 ms
The lower bound solution is:
z = -41728.033700 + 12919.222824 = -28808.810876
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24112.882353
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -40016.043225 + 13061.888697 = -26954.154528
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24112.882353
The optimal solution has not been found yet.

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

Iteration 29
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -36592.062275 + 13347.220443 = -23244.841832
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24112.882353
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 = 15 ms
The lower bound solution is:
z = -34880.071802 + 13489.886316 = -21390.185486
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24112.882353
The optimal solution has not been found yet.

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

Iteration 32
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -40964.365445 + 13775.218062 = -27189.147383
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

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

Iteration 34
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -36341.991163 + 14060.549807 = -22281.441356
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
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 = 0 ms
The lower bound solution is:
z = -34059.337199 + 14203.215680 = -19856.121519
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 = 24902.846154
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 = -31776.683231 + 14345.881553 = -17430.801678
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 = 24902.846154
The optimal solution has not been found yet.

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

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

Iteration 39
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -25559.134496 + 14768.172537 = -10790.961959
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
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 = -32824.825924 + 14910.838410 = -17913.987514
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 42
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -28203.924325 + 15196.170156 = -13007.754169
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
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 = -25948.065719 + 15333.129394 = -10614.936325
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
The optimal solution has not been found yet.

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

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

Iteration 46
The time to create lower bound problem = 46 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -19104.892140 + 15721.180568 = -3383.711572
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
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 = 15 ms
The lower bound solution is:
z = -16896.423439 + 15846.726536 = -1049.696903
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -14613.769470 + 15949.445965 = 1335.676495
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 = 24902.846154
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 46 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -12704.813363 + 16052.165393 = 3347.352030
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 = 24112.882353
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -16224.399748 + 16143.471552 = -80.928196
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -14693.788524 + 16286.137425 = 1592.348901
The time to read the lower bound solution = 188 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 203 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 53
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -11108.509929 + 16468.749742 = 5360.239813
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 = 26321.200000
The time to read the upper bound solution = 16 ms
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 = 15 ms
The lower bound solution is:
z = -9105.264041 + 16605.708980 = 7500.444939
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -7279.357903 + 16691.308504 = 9411.950601
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
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 = -6162.635414 + 16828.267742 = 10665.632328
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -13747.052323 + 16948.107075 = 3201.054752
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 = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -12954.654180 + 17085.066313 = 4130.412133
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 0 ms
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 = 31 ms
The lower bound solution is:
z = -15931.758096 + 17227.732186 = 1295.974090
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 = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -14142.208258 + 17284.798535 = 3142.590277
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -12859.595684 + 17421.757773 = 4562.162089
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 = 16 ms
The upper bound solution is:
z = 111119.363640
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -18495.309198 + 17564.423646 = -930.885552
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 27330.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -15425.015246 + 17604.370090 = 2179.354844
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 = 16 ms
The upper bound solution is:
z = 28749.200000
The time to read the upper bound solution = 0 ms
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 = -12941.859118 + 17724.209423 = 4782.350305
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 27330.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -9659.171927 + 17792.689042 = 8133.517115
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 = 27330.846154
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 = 15 ms
The lower bound solution is:
z = -7665.803983 + 17798.395677 = 10132.591694
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 25272.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -6278.657029 + 17832.635487 = 11553.978458
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26116.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -4390.779137 + 17849.755392 = 13458.976255
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 30877.149733
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 93 ms
The lower bound solution is:
z = -8878.025855 + 17895.408471 = 9017.382616
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 26116.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -6221.423497 + 17929.648280 = 11708.224783
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 = 26116.846154
The optimal solution has not been found yet.

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

Iteration 72
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -2734.972646 + 17935.354915 = 15200.382269
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1946.301077 + 17971.351386 = 16025.050309
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = -760.966038 + 17989.941595 = 17228.975557
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -3383.736232 + 17993.866792 = 14610.130560
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -2599.326394 + 18021.343171 = 15422.016777
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1486.503113 + 18033.118762 = 16546.615649
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1672.138487 + 18056.669944 = 16384.531457
The time to read the lower bound solution = 31 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 125 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 141 ms
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 62 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -3763.030696 + 18084.146323 = 14321.115627
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -2735.578754 + 18084.146323 = 15348.567569
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 = 47 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -2590.922265 + 18107.697505 = 15516.775240
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1830.508607 + 18119.473097 = 16288.964490
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 = 24902.846154
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1151.178336 + 18125.360892 = 16974.182556
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 = 24902.846154
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -711.232647 + 18121.435695 = 17410.203048
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 16 ms
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 = 0 ms
The lower bound solution is:
z = -3628.308850 + 18121.435695 = 14493.126845
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -3078.186539 + 18134.793307 = 15056.606768
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -2688.452123 + 18138.609767 = 15450.157644
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -2506.384152 + 18148.150919 = 15641.766767
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1846.027706 + 18159.600300 = 16313.572594
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 = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -2035.589016 + 18169.141452 = 16133.552436
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
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 = -1314.311764 + 18178.682603 = 16864.370839
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 = 24902.846154
The optimal solution has not been found yet.

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

Iteration 93
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -431.717020 + 18176.800166 = 17745.083146
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 = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -305.897312 + 18185.838997 = 17879.941685
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1234.186984 + 18194.675540 = 16960.488556
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 = 24058.285714
The time to read the upper bound solution = 16 ms
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 = -1246.704240 + 18205.279392 = 16958.575152
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -605.655191 + 18215.883244 = 17610.228053
The time to read the lower bound solution = 63 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -116.069829 + 18215.883244 = 18099.813415
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -209.522757 + 18224.389980 = 18014.867223
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 415.399067 + 18232.896716 = 18648.295783
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
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 = 0 ms
The lower bound solution is:
z = 827.713245 + 18234.433518 = 19062.146763
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1251.357962 + 18231.608224 = 16980.250262
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -1129.470769 + 18238.671460 = 17109.200691
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -5084.808744 + 18244.322048 = 13159.513304
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
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 = 15 ms
The lower bound solution is:
z = -4549.535961 + 18266.924403 = 13717.388442
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -3981.544992 + 18300.827934 = 14319.282942
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
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 = -3304.808716 + 18331.906172 = 15027.097456
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 31 ms
The lower bound solution is:
z = -3028.009298 + 18364.397056 = 15336.387758
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -2296.813412 + 18396.887940 = 16100.074528
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 46 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1708.970484 + 18418.077648 = 16709.107164
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1486.631718 + 18443.505296 = 16956.873578
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 = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -959.985114 + 18466.107651 = 17506.122537
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 = 32 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 31 ms
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1744.714916 + 18475.996181 = 16731.281265
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 = 109 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
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 = -1400.557470 + 18494.360594 = 17093.803124
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 = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -812.782387 + 18511.312359 = 17698.529972
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 = 24902.846154
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -470.736470 + 18516.962948 = 18046.226478
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -62.293268 + 18531.089419 = 18468.796151
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
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 = 0 ms
The lower bound solution is:
z = 426.315911 + 18543.803244 = 18970.119155
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1882.338588 + 18542.390597 = 16660.052009
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 54492.222689
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1321.623929 + 18576.294128 = 17254.670199
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 = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
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 = -1149.525576 + 18603.134424 = 17453.608848
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1090.788348 + 18614.435601 = 17523.647253
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 16 ms
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 = 15 ms
The lower bound solution is:
z = -2080.215552 + 18625.736778 = 16545.521226
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
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 = 31 ms
The lower bound solution is:
z = -1530.435700 + 18645.513838 = 17115.078138
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -3894.492414 + 18652.577074 = 14758.084660
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -3251.277820 + 18682.242664 = 15430.964844
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -2706.813026 + 18714.733549 = 16007.920523
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1951.048892 + 18747.224433 = 16796.175541
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 = 32 ms
The time to compute the upper bound = 93 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1741.144098 + 18779.715317 = 17038.571219
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 15 ms
The lower bound solution is:
z = -1195.876192 + 18803.730319 = 17607.854127
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1974.266867 + 18812.206202 = 16837.939335
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1584.671685 + 18834.808556 = 17250.136871
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1049.668411 + 18853.172969 = 17803.504558
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -884.149469 + 18871.537382 = 17987.387913
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -327.624426 + 18888.489148 = 18560.864722
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
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 = -2220.764497 + 18891.314442 = 16670.549945
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1848.581171 + 18905.440913 = 17056.859742
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1392.069287 + 18915.329443 = 17523.260156
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1257.051819 + 18933.693856 = 17676.642037
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -937.891159 + 18943.582386 = 18005.691227
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 = 16 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -2324.429479 + 18944.995034 = 16620.565555
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1656.636119 + 18963.359446 = 17306.723327
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 = 54492.222689
The time to read the upper bound solution = 15 ms
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 = 16 ms
The lower bound solution is:
z = -1127.174121 + 18997.262978 = 17870.088857
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -3668.187133 + 19002.913567 = 15334.726434
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -2723.668365 + 19035.404451 = 16311.736086
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -2436.241099 + 19067.895335 = 16631.654236
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -1536.551565 + 19100.386220 = 17563.834655
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 24902.846154
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 = 47 ms
The lower bound solution is:
z = -1121.679292 + 19120.163280 = 17998.483988
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1087.285757 + 19139.940340 = 18052.654583
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 = 24112.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1492.201422 + 19162.542694 = 17670.341272
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 = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1334.885189 + 19183.732401 = 17848.847212
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
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 = 15 ms
The lower bound solution is:
z = -799.383458 + 19202.096814 = 18402.713356
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -1125.860752 + 19207.747403 = 18081.886651
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 = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 0 ms
The lower bound solution is:
z = -668.479003 + 19221.873874 = 18553.394871
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -161.272753 + 19233.175052 = 19071.902299
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 18.944052 + 19245.862536 = 19264.806588
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 286.370760 + 19253.973631 = 19540.344391
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 524.327377 + 19265.396322 = 19789.723699
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 23770.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -944.033310 + 19261.813200 = 18317.779890
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 16 ms
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 = -596.120148 + 19274.951314 = 18678.831166
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1745.324636 + 19279.728811 = 17534.404175
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 = 24058.285714
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 = -1413.441993 + 19293.464112 = 17880.022119
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = -1145.334311 + 19304.810666 = 18159.476355
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 0 ms
The lower bound solution is:
z = -935.318065 + 19315.560033 = 18380.241968
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -998.945421 + 19325.712212 = 18326.766791
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -867.603820 + 19334.670018 = 18467.066198
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 = 47 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -608.616431 + 19343.627823 = 18735.011392
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -554.241907 + 19351.391255 = 18797.149348
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 170
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -673.369297 + 19361.543434 = 18688.174137
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 = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 15 ms
The lower bound solution is:
z = -580.657977 + 19368.112492 = 18787.454515
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -577.486173 + 19374.084362 = 18796.598189
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
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 = -444.202880 + 19381.847793 = 18937.644913
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -196.086105 + 19388.416851 = 19192.330746
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -174.646506 + 19394.985908 = 19220.339402
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -165.179790 + 19401.554966 = 19236.375176
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
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 = 0 ms
The lower bound solution is:
z = -35.865168 + 19402.749340 = 19366.884172
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 150.783627 + 19408.124023 = 19558.907650
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -177.006050 + 19410.512771 = 19233.506721
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39.273663 + 19414.095893 = 19374.822230
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -115.235701 + 19418.873390 = 19303.637689
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -4.097092 + 19423.053699 = 19418.956607
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 110.862832 + 19427.234008 = 19538.096840
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 = 26321.200000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 242.210676 + 19433.205878 = 19675.416554
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 = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -470.906962 + 19434.997439 = 18964.090477
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -121.640151 + 19443.955245 = 19322.315094
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 = 26321.200000
The optimal solution has not been found yet.

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

Iteration 188
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 519.672134 + 19452.913050 = 19972.585184
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 = 26321.200000
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 502.936065 + 19456.901355 = 19959.837420
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 23770.970588
The time to read the upper bound solution = 15 ms
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 = -223.449878 + 19452.913050 = 19229.463172
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

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

Iteration 192
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 209.548955 + 19463.168691 = 19672.717646
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 226.162816 + 19468.296511 = 19694.459327
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 = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 395.127965 + 19472.284816 = 19867.412781
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 190.876192 + 19474.563847 = 19665.440039
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 = 26321.200000
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 197
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 593.416053 + 19485.373533 = 20078.789586
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 = 23770.970588
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -25.932923 + 19480.942916 = 19455.009993
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 200
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -150.901085 + 19490.911805 = 19340.010720
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 154.265588 + 19497.003903 = 19651.269491
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -19.171707 + 19503.096002 = 19483.924295
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 79.099560 + 19509.741928 = 19588.841488
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 340.637740 + 19514.172545 = 19854.810285
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 15 ms
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 = 16 ms
The lower bound solution is:
z = -386.954506 + 19516.387854 = 19129.433348
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -256.079205 + 19519.710816 = 19263.631611
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -650.055825 + 19523.587606 = 18873.531781
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -418.622799 + 19530.233532 = 19111.610733
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 210
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -534.326524 + 19534.664149 = 19000.337625
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 212
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -83.326246 + 19544.633038 = 19461.306792
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -21.026399 + 19550.171310 = 19529.144911
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 = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

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

Iteration 216
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 323.765839 + 19561.801680 = 19885.567519
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 0 ms
The lower bound solution is:
z = 257.512024 + 19563.463161 = 19820.975185
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

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

Iteration 220
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -45.524943 + 19573.985877 = 19528.460934
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 222
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -498.563050 + 19592.262173 = 19093.699123
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -615.439260 + 19600.569580 = 18985.130320
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 = 24058.285714
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -497.078429 + 19606.661679 = 19109.583250
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 = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -266.410018 + 19611.646123 = 19345.236105
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -202.553129 + 19615.522913 = 19412.969784
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 = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 71.275814 + 19618.292049 = 19689.567863
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 = 24902.846154
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 147.324384 + 19618.015136 = 19765.339520
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 = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -46.583878 + 19619.676617 = 19573.092739
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 26321.200000
The time to read the upper bound solution = 15 ms
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 = 172.444949 + 19631.306987 = 19803.751936
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 101.199277 + 19626.322543 = 19727.521820
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 233
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 211.830406 + 19632.968469 = 19844.798875
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 46 ms
The lower bound solution is:
z = 189.988782 + 19637.952913 = 19827.941695
The time to read the lower bound solution = 63 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 46 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 236
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -359.186035 + 19646.260320 = 19287.074285
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 = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 15 ms
The lower bound solution is:
z = -339.132297 + 19645.706493 = 19306.574196
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 = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -190.019076 + 19646.814147 = 19456.795071
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 = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -607.232474 + 19650.137110 = 19042.904636
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -470.174094 + 19658.444518 = 19188.270424
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 = 24902.846154
The time to read the upper bound solution = 15 ms
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 = 16 ms
The lower bound solution is:
z = -250.478791 + 19663.428962 = 19412.950171
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -185.103533 + 19665.921184 = 19480.817651
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
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 = -74.192117 + 19667.028838 = 19592.836721
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = -36.444493 + 19668.967233 = 19632.522740
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

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

Iteration 247
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 175.802366 + 19670.213345 = 19846.015711
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 16 ms
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 = 31 ms
The lower bound solution is:
z = 64.297347 + 19670.767172 = 19735.064519
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 16 ms
The lower bound solution is:
z = 140.440812 + 19672.705567 = 19813.146379
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 241.487943 + 19674.367048 = 19915.854991
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 = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 265.300703 + 19675.751616 = 19941.052319
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 253
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 164.174009 + 19678.520752 = 19842.694761
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 = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 303.624157 + 19680.182233 = 19983.806390
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 = 24902.846154
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 = 364.351091 + 19680.182233 = 20044.533324
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 257
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 408.246269 + 19681.561284 = 20089.807553
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 = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 317.023068 + 19680.464664 = 19997.487732
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 260
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 488.116757 + 19684.015412 = 20172.132169
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24112.882353
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 181.868267 + 19685.364977 = 19867.233244
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 66.032648 + 19686.174715 = 19752.207363
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 = 24359.909091
The time to read the upper bound solution = 0 ms
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 = 81.993613 + 19688.334019 = 19770.327632
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 = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 165.199035 + 19689.953496 = 19855.152531
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

Iteration 266
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 294.058903 + 19692.652625 = 19986.711528
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 242.020764 + 19693.192450 = 19935.213214
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 = 24359.909091
The time to read the upper bound solution = 16 ms
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 = 16 ms
The lower bound solution is:
z = 230.343408 + 19695.351753 = 19925.695161
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
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 = 16 ms
The lower bound solution is:
z = 285.637943 + 19694.272102 = 19979.910045
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 380.688856 + 19695.621666 = 20076.310522
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 338.452162 + 19695.621666 = 20034.073828
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

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

Iteration 274
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 401.985019 + 19697.521232 = 20099.506251
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 = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 15 ms
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 = 31 ms
The lower bound solution is:
z = 521.928938 + 19698.858077 = 20220.787015
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 = 24058.285714
The optimal solution has not been found yet.

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

Iteration 277
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 175.862259 + 19701.520715 = 19877.382974
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 232.205519 + 19702.452638 = 19934.658157
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 255.873040 + 19704.050221 = 19959.923261
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 = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 218.272902 + 19705.647803 = 19923.920705
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 16 ms
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 = 201.958606 + 19706.712858 = 19908.671464
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

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

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

Iteration 284
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 305.397438 + 19711.505606 = 20016.903044
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 = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 47 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 256.005561 + 19710.440551 = 19966.446112
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 359.529113 + 19712.304397 = 20071.833510
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 424.748293 + 19714.168244 = 20138.916537
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 32 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 493.359390 + 19715.765826 = 20209.125216
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 16 ms
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 = 564.850203 + 19716.564618 = 20281.414821
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 = 24359.909091
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 371.855891 + 19714.732601 = 20086.588492
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

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

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

Iteration 294
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 268.211234 + 19720.752085 = 19988.963319
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
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 = 242.659305 + 19721.537235 = 19964.196540
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 212.095314 + 19723.892685 = 19935.987999
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 = 24058.285714
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 283.740409 + 19725.724702 = 20009.465111
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24902.846154
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 361.892725 + 19727.033285 = 20088.926010
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 = 32 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 24058.285714
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 302.195863 + 19727.818435 = 20030.014298
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 = 24902.846154
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 405.125345 + 19729.127018 = 20134.252363
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 24359.909091
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 563375 ms
The total time to calculate the lower bounds with CPLEX = 3843 ms
The total time to calculate the upper bounds with CPLEX = 3045 ms
The total time to create the lower bound problems = 8087 ms
The total time to read the lower bound solutions = 2137 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 5083 ms
The total time to read the upper bound solutions = 1947 ms 

The best upper bound found = 23770.970588, the best lower bound found = 20281.414821
Therefore the duality gap is 17.205682%
