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

Iteration 1
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 109 ms
The lower bound solution is:
z = 11753.000000 + 2333.000000 = 14086.000000
The time to read the lower bound solution = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 200964.968770
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 11485.726187 + 30364.845315 = 41850.571502
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 = 290491.968770
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 8169.779693 + 53277.318522 = 61447.098215
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 = 173707.975520
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 = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 3352.246629 + 67646.710817 = 70998.957446
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 173707.975520
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 = 15 ms
The lower bound solution is:
z = 2802.097000 + 78533.866733 = 81335.963733
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 173707.975520
The optimal solution has not been found yet.

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

Iteration 7
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -1853.990417 + 91482.230228 = 89628.239811
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 = 173707.975520
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 = 0 ms
The lower bound solution is:
z = -10760.203708 + 97699.663343 = 86939.459635
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 = 125113.794580
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

Iteration 10
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -26168.669575 + 106930.950971 = 80762.281396
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 = 110973.671320
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 = 15 ms
The lower bound solution is:
z = -26368.297487 + 108870.777001 = 82502.479514
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
The optimal solution has not been found yet.

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

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

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

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

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

Iteration 17
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -28546.150030 + 121683.564467 = 93137.414437
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 = 110973.671320
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 = -28295.023358 + 123202.491750 = 94907.468392
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
The optimal solution has not been found yet.

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

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

Iteration 21
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -30462.339009 + 128298.590705 = 97836.251696
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
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 = -30233.431237 + 129537.506533 = 99304.075296
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
The optimal solution has not been found yet.

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

Iteration 24
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -30198.457625 + 131475.873622 = 101277.415997
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
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 = -32166.633341 + 132969.306795 = 100802.673454
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
The optimal solution has not been found yet.

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

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

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

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

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

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

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

Iteration 33
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -37024.590476 + 140336.985727 = 103312.395251
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38322.013367 + 141527.520884 = 103205.507517
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38141.610436 + 141072.728450 = 102931.118014
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -37907.224557 + 141638.630180 = 103731.405623
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 = 110973.671320
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 = 0 ms
The lower bound solution is:
z = -39089.880069 + 142525.224426 = 103435.344357
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39718.142951 + 143538.565527 = 103820.422576
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 = 110973.671320
The optimal solution has not been found yet.

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

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

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

Iteration 42
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38994.713623 + 145499.461614 = 106504.747991
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38918.111234 + 145719.514018 = 106801.402784
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 = 110973.671320
The optimal solution has not been found yet.

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

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

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

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

Iteration 48
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38637.641015 + 146739.020577 = 108101.379562
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 = 110973.671320
The optimal solution has not been found yet.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Iteration 64
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38189.924428 + 147358.461959 = 109168.537531
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38114.797728 + 147410.149683 = 109295.351955
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -37976.576284 + 147020.131394 = 109043.555110
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 = 110973.671320
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -37893.406419 + 146936.692112 = 109043.285693
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 = 110973.671320
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 = 0 ms
The lower bound solution is:
z = -37864.987202 + 146935.177680 = 109070.190478
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
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 = 15 ms
The lower bound solution is:
z = -38101.557167 + 147188.276299 = 109086.719132
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110973.671320
The optimal solution has not been found yet.

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

Iteration 71
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39342.179295 + 147662.138964 = 108319.959669
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 = 110387.623710
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

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

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

Iteration 74
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39311.149064 + 147572.931832 = 108261.782768
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = -39274.071964 + 147425.288539 = 108151.216575
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = -39133.996782 + 147090.927881 = 107956.931099
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 = 110387.583650
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 = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39074.641482 + 146957.818429 = 107883.176947
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

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

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

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

Iteration 83
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -38744.814464 + 146886.831420 = 108142.016956
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 = 110387.583650
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 = -38721.222713 + 146901.509357 = 108180.286644
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

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

Iteration 88
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38593.245498 + 146908.261305 = 108315.015807
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 = 110387.583650
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38564.553251 + 146923.856717 = 108359.303466
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 = 110387.583650
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38636.526886 + 147033.390499 = 108396.863613
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 = 110387.583650
The optimal solution has not been found yet.

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

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

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

Iteration 94
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -38576.095243 + 147061.849197 = 108485.753954
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = 0 ms
The lower bound solution is:
z = -38543.080769 + 147063.844449 = 108520.763680
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = -38493.355270 + 147067.460475 = 108574.105205
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

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

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

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

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

Iteration 103
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -38540.998694 + 147316.268896 = 108775.270202
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = 15 ms
The lower bound solution is:
z = -38474.002145 + 147261.497353 = 108787.495208
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 = 110387.583650
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 = 0 ms
The lower bound solution is:
z = -38438.584033 + 147265.753568 = 108827.169535
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 = 110387.583650
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 = 0 ms
The lower bound solution is:
z = -38438.579122 + 147297.951028 = 108859.371906
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = 15 ms
The lower bound solution is:
z = -38408.780361 + 147301.619991 = 108892.839630
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

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

Iteration 111
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -38373.613813 + 147399.542669 = 109025.928856
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = 0 ms
The lower bound solution is:
z = -38379.948103 + 147430.639496 = 109050.691393
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 = 110387.583650
The optimal solution has not been found yet.

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

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

Iteration 115
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38304.297127 + 147422.648619 = 109118.351492
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 = 110387.583650
The optimal solution has not been found yet.

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

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

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

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

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

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

Iteration 122
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -38331.703943 + 147557.743269 = 109226.039326
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = -38501.916059 + 147676.712860 = 109174.796801
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

Iteration 126
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -38696.543645 + 147865.077925 = 109168.534280
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = -38920.105111 + 147997.801686 = 109077.696575
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = -39010.381723 + 148136.199838 = 109125.818115
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
The optimal solution has not been found yet.

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

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

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

Iteration 132
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39020.178312 + 148313.917505 = 109293.739193
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 = 110387.583650
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39008.156466 + 148343.957685 = 109335.801219
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.583650
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 = -39014.940841 + 148385.948913 = 109371.008072
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 = 110387.623710
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 = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39027.101509 + 148439.354594 = 109412.253085
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 = 110387.623710
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 = 0 ms
The lower bound solution is:
z = -39039.213625 + 148480.077041 = 109440.863416
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 = 110387.623710
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 = 0 ms
The lower bound solution is:
z = -39036.293242 + 148500.548886 = 109464.255644
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39052.465139 + 148535.925879 = 109483.460740
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 = 110387.623710
The optimal solution has not been found yet.

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

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

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

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

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

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

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

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

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

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

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

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

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

Iteration 152
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39103.740528 + 148670.826604 = 109567.086076
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 = 110387.623710
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 = 0 ms
The lower bound solution is:
z = -39167.944780 + 148725.306382 = 109557.361602
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39164.788115 + 148735.746880 = 109570.958765
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39163.287489 + 148739.845640 = 109576.558151
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39164.455789 + 148750.201142 = 109585.745353
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 = 110387.623710
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 = 0 ms
The lower bound solution is:
z = -39152.773702 + 148752.979055 = 109600.205353
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39156.926540 + 148771.393683 = 109614.467143
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 = 110387.623710
The optimal solution has not been found yet.

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

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

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

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

Iteration 163
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39210.120502 + 148850.053696 = 109639.933194
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39284.880970 + 148898.976991 = 109614.096021
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = 15 ms
The lower bound solution is:
z = -39345.204959 + 148946.272884 = 109601.067925
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
The optimal solution has not been found yet.

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

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

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

Iteration 169
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39356.716953 + 148998.675166 = 109641.958213
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 = 110387.623710
The optimal solution has not been found yet.

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

Iteration 171
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39350.719527 + 149017.121326 = 109666.401799
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39353.672956 + 149034.066816 = 109680.393860
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39356.845579 + 149048.368454 = 109691.522875
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39364.723278 + 149064.156695 = 109699.433417
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39384.266413 + 149082.887107 = 109698.620694
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39385.451773 + 149093.642121 = 109708.190348
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39451.988422 + 149140.236151 = 109688.247729
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 = 110387.623710
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 = 0 ms
The lower bound solution is:
z = -39451.252057 + 149150.675823 = 109699.423766
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
The optimal solution has not been found yet.

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

Iteration 180
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39465.268403 + 149175.327884 = 109710.059481
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 = 110387.623710
The optimal solution has not been found yet.

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

Iteration 182
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39527.624727 + 149218.383123 = 109690.758396
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39527.987418 + 149226.609456 = 109698.622038
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39552.067169 + 149250.370591 = 109698.303422
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39557.852685 + 149263.447306 = 109705.594621
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39558.741978 + 149274.372816 = 109715.630838
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 = 110387.623710
The optimal solution has not been found yet.

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

Iteration 188
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39552.251528 + 149288.435977 = 109736.184449
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = -39551.464572 + 149296.019113 = 109744.554541
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = 16 ms
The lower bound solution is:
z = -39576.242011 + 149316.096754 = 109739.854743
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39573.444049 + 149321.674734 = 109748.230685
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 = 110387.623710
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -39578.418260 + 149335.180566 = 109756.762306
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 = 110387.623710
The optimal solution has not been found yet.

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

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

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

Iteration 196
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39571.876316 + 149357.693623 = 109785.817307
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = 15 ms
The lower bound solution is:
z = -39573.313364 + 149366.032654 = 109792.719290
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
The optimal solution has not been found yet.

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

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

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

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

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

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

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

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

Iteration 206
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -39643.394145 + 149454.659999 = 109811.265854
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = 15 ms
The lower bound solution is:
z = -39646.382080 + 149464.786051 = 109818.403971
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = -39645.155530 + 149470.227764 = 109825.072234
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
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 = -39665.507428 + 149486.526767 = 109821.019339
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
The optimal solution has not been found yet.

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

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

Iteration 212
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39653.319283 + 149497.158626 = 109843.839343
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 110387.623710
The optimal solution has not been found yet.
The duality gap is acceptably small.
 The current upper (and lower) bound are taken as optimal.
The best upper bound = 110387.583650, the best lower bound = 109843.839343
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 229422 ms
The total time to calculate the lower bounds with CPLEX = 2324 ms
The total time to calculate the upper bounds with CPLEX = 108 ms
The total time to create the lower bound problems = 3319 ms
The total time to read the lower bound solutions = 1062 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 126 ms
The total time to read the upper bound solutions = 15 ms 

The best upper bound found = 110387.583650, the best lower bound found = 109843.839343
Therefore the duality gap is 0.495016%
