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

Table 3

Total capacity of mixed integer program (MIP) and simulation-based heuristic on TSP data sets: ch130, kroA150, and si175.

Total capacity	ch130 (130 nodes, )						kroA150 (150 nodes, )						sil175 (175 nodes, )
Number of facilities ()	2	7	10	13	16	19	1	4	8	12	17	20	7	10	15	20	25	30
MIP	—	106	35	40	42	42	54	—	44	51	56	50	—	—	—	—	—	115
Heuristic: arrival(), , dispatch
Uniform(-), 0, FCFS	19	17	17	17	18	19	23	18	18	17	17	20	59	56	55	54	54	53
Normal(0.5), 0, FCFS	20	20	20	20	19	21	25	20	19	21	19	21	68	67	66	65	65	67
Uniform(-), 0, NN	20	16	15	15	16	19	26	17	16	16	17	20	66	62	58	58	58	56
Normal(0.5), 0, NN	22	17	17	16	16	19	27	18	16	16	17	20	77	74	71	72	70	68
Uniform(-), 0.5, FCFS	23	20	19	20	19	20	43	21	20	21	18	20	109	88	82	76	76	74
Normal(0.5), 0.5, FCFS	24	22	23	24	20	22	51	23	21	23	20	22	123	103	92	88	85	86
Uniform(-), 0.5, NN	26	18	17	16	16	19	#	18	17	17	18	20	112	90	78	72	70	67
Normal(0.5), 0.5, NN	27	19	18	18	17	20	#	19	17	19	17	21	125	105	91	85	82	83

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