Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level

Table 2

Total capacity of mixed integer program (MIP) and simulation-based heuristic on TSP data sets: berlin52, pr76, and gr120.

Total capacity	berlin52 (52 nodes, )					pr76 (76 nodes, )							gr120 (120 nodes, )
Number of facilities ()	1	3	5	9	11	1	3	5	8	10	11	12	2	6	10	14	18	22	23
MIP	11	11	10	11	11*	16	17	16	17	16	13	16	—	—	39	29	29	27	35
Heuristic: arrival(), , dispatch
Uniform(-), 0, FCFS	10	9	9	9	11	12	12	11	11	11	11	12	22	21	21	20	18	22	23
Normal(0.5), 0, FCFS	11	10	10	10	11	13	13	13	13	12	12	13	25	22	22	23	23	23	24
Uniform(-), 0, NN	12	8	8	9	11	17	11	11	10	11	11	12	24	19	19	20	19	22	23
Normal(0.5), 0, NN	15	10	9	10	11	19	14	11	11	11	11	12	30	22	22	21	21	22	23
Uniform(-), 0.5, FCFS	15	10	11	10	11	14	14	13	12	12	12	13	29	23	24	24	22	22	24
Normal(0.5), 0.5, FCFS	16	11	11	10	12	27	15	14	14	14	13	15	33	26	25	28	26	26	28
Uniform(-), 0.5, NN	28	10	9	10	11	36	14	13	12	11	11	12	62	22	22	20	22	22	24
Normal(0.5), 0.5, NN	33	11	10	10	11	48	15	14	12	12	11	12	57	24	25	24	23	23	23

*Optimal; —: no solution.