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

Table 4

Total capacity of mixed integer program (MIP) and simulation-based heuristic on TSP data sets: d198, tsp225, and gil262.

Total capacity	d198 (198 nodes, )				tsp225 (225 nodes, )						gil262 (262 nodes, )
Number of facilities ()	4	5	6	10	2	5	10	15	20	30	4	10	20	25	30	35	40
MIP	—	56	—	52	—	—	—	84	98	81	—	—	—	—	95	108	124
Heuristic: arrival(), , dispatch
Uniform(-), 0, FCFS	12	12	12	14	34	29	27	31	29	30	42	40	37	39	38	40	41
Normal(0.5), 0, FCFS	13	14	15	16	37	32	31	31	34	33	47	45	43	43	46	46	47
Uniform(-), 0, NN	9	9	10	11	40	27	25	25	24	30	47	39	36	35	39	37	40
Normal(0.5), 0, NN	10	9	11	12	46	29	27	29	27	30	55	43	38	40	39	39	41
Uniform(-), 0.5, FCFS	14	14	13	15	50	34	31	31	32	32	54	46	45	43	43	43	45
Normal(0.5), 0.5, FCFS	15	14	14	16	56	37	35	35	37	35	60	50	50	50	51	49	51
Uniform(-), 0.5, NN	9	10	10	12	#	31	26	30	25	30	89	43	37	39	38	37	41
Normal(0.5), 0.5, NN	10	10	10	12	#	35	27	31	29	32	98	45	42	42	40	43	44

—: no solution; ^#no convergence in capacity.