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

Table 1

Total capacity of mixed integer program (MIP) and simulation-based heuristic on TSP data sets: bays29, att48, and eil51.

Total capacity	bays29 (29 nodes, )					att48 (48 nodes, )					eil51 (51 nodes, )
Number of facilities ()	1	2	3	5	8	1	3	5	7	9	1	3	5	7	9
MIP	12*	9	8	8	8*	12	9	10	10	9*	13	12	12	12	11
Heuristic: arrival(), , dispatch
Uniform(-), 0, FCFS	9	8	8	7	8	10	8	8	9	9	11	10	10	9	9
Normal(0.5), 0, FCFS	10	9	9	9	8	12	9	10	10	9	12	11	11	11	11
Uniform(-), 0, NN	12	9	8	7	8	15	8	8	8	9	13	10	9	9	9
Normal(0.5), 0, NN	14	11	10	9	8	17	10	8	9	9	14	12	11	10	10
Uniform(-), 0.5, FCFS	#	10	10	8	9	#	10	10	10	10	15	11	11	10	11
Normal(0.5), 0.5, FCFS	#	11	10	10	10	#	11	11	11	11	17	13	13	13	12
Uniform(-), 0.5, NN	#	13	11	9	8	#	10	9	9	9	26	12	11	10	10
Normal(0.5), 0.5, NN	#	16	13	10	9	#	11	10	10	10	31	14	12	11	11

*Optimal; ^#no convergence in capacity.