The program initially produces the following output. The member function IloSolver::printInformation displays details about how Solver solved the problem.

50 clients, 16 warehouses
Capacities: [58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268, 58268]
Build costs: [7500, 7500, 7500, 7500, 7500, 7500, 7500, 7500, 7500, 7500, 0, 7500, 7500, 7500, 7500, 7500]
Demands: [146, 87, 672, 1337, 31, 559, 2370, 1089, 33, 32, 5495, 904, 1466, 143, 615, 564, 226, 3016, 253, 195, 38, 807, 551, 304, 814, 337, 4368, 577, 482, 495, 231, 322, 685, 12912, 325, 366, 3671, 2213, 705, 328, 1681, 1117, 275, 500, 2241, 733, 222, 49, 1464, 222]
 
Initial Solution
[965952]
IlcIntVarArrayI[[10] [10] [10] [10] [10] [10] [1] [10] [10] [10] [3] [10] [10] [10] [10] [7] [3] [8] [3] [7] [3] [9] [10] [10] [10] [10] [12] [10] [10] [14] [10] [10] [10] [2] [10] [3] [2] [10] [7] [10] [10] [3] [7] [9] [12] [7] [7] [7] [10] [10]]
Iter = 1, 943477 : 0111010111101010 (Best = 943477)
Iter = 2, 939949 : 0111010111111010 (Best = 939949)
Iter = 3, 937269 : 1111010111111010 (Best = 937269)
Iter = 4, 934199 : 1111010111111000 (Best = 934199)
Iter = 5, 935152 : 1111010111111001 (Best = 934199)
Iter = 6, 935445 : 1111010110111001 (Best = 934199)
Iter = 7, 933569 : 1111011110111001 (Best = 933569)
Iter = 8, 932616 : 1111011110111000 (Best = 932616)
Iter = 9, 933876 : 1111011110101000 (Best = 932616)
Iter = 10, 935883 : 1111011110101100 (Best = 932616)
Iter = 11, 938953 : 1111011110101110 (Best = 932616)
Iter = 12, 937692 : 1111011110111110 (Best = 932616)
Iter = 13, 935686 : 1111011110111010 (Best = 932616)
Iter = 14, 932616 : 1111011110111000 (Best = 932616)
Iter = 15, 933569 : 1111011110111001 (Best = 932616)
Iter = 16, 934829 : 1111011110101001 (Best = 932616)
Iter = 17, 937899 : 1111011110101011 (Best = 932616)
Iter = 18, 936946 : 1111011110101010 (Best = 932616)
Iter = 19, 935686 : 1111011110111010 (Best = 932616)
Iter = 20, 932616 : 1111011110111000 (Best = 932616)
Iter = 21, 933569 : 1111011110111001 (Best = 932616)
Iter = 22, 934829 : 1111011110101001 (Best = 932616)
Iter = 23, 937899 : 1111011110101011 (Best = 932616)
Iter = 24, 936946 : 1111011110101010 (Best = 932616)
Iter = 25, 935686 : 1111011110111010 (Best = 932616)
Iter = 26, 932616 : 1111011110111000 (Best = 932616)
Iter = 27, 933569 : 1111011110111001 (Best = 932616)
Iter = 28, 934829 : 1111011110101001 (Best = 932616)
Iter = 29, 937899 : 1111011110101011 (Best = 932616)
Iter = 30, 936946 : 1111011110101010 (Best = 932616)
No better solution found
 
Final Solution
[932616]
IlcIntVarArrayI[[7] [11] [0] [5] [7] [0] [1] [2] [7] [7] [3] [10] [5] [0] [6] [7] [3] [8] [3] [6] [3] [6] [10] [0] [11] [10] [12] [10] [10] [0] [0] [10] [0] [2] [11] [11] [5] [5] [7] [5] [10] [3] [7] [6] [12] [7] [7] [6] [5] [11]]
 
 

Here is how to interpret this program output:

The initial output displays the input problem data: the number of clients, the number of warehouses, the array of capacities of the warehouses, the array of building costs of the warehouses, and the array of the demands of the customers.

The initial solution uses nine warehouses and has a total cost of 965952.

After 30 iterations, the best solution found by local search is passed to the complete search, which is unable to find a better solution than that found by local search. The final solution uses eleven warehouses and has a total cost of 932616.

The IlcIntVarArray indicates the warehouse to which each of the 50 customers is assigned.