Journal of the Operational Research Society - Table 4 for article: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem

FROM:

Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem

N Aras, M Orbay and I K Altinel

Instance	(m, n)	Best % Dev.	Average % Dev.	Worst % Dev.	CPU time (s)	Average no. of iterations
8	(4,8)	6.68	51.68	112.36	1.55	2.44
9	(5,15)	0.00	51.32	105.09	2.77	3.12
15	(5,10)	2.19	99.67	277.30	1.94	2.76
16	(4,10)	0.00	43.06	91.12	1.64	2.60
23	(5,8)	3.78	40.22	86.55	1.91	2.40
26	(5,12)	0.00	50.18	137.32	2.16	2.88
29	(5,15)	7.68	22.89	43.21	2.33	2.92
30	(5,20)	1.48	11.46	36.11	2.72	3.36

I1	(5,20)	0.65	19.84	40.55	2.20	3.52
I2	(6,20)	5.61	26.90	44.59	2.77	3.32
I3	(7,20)	11.79	45.25	71.77	3.30	3.72
I4	(8,20)	30.07	56.09	102.82	3.69	3.36
I5	(9,20)	36.27	71.74	137.92	4.13	3.64
I6	(10,20)	59.06	100.08	148.82	4.91	3.52

I7	(5,25)	8.93	29.38	51.92	3.48	3.08
I8	(6,25)	13.34	35.26	74.19	4.28	3.60
I9	(7,25)	9.03	47.18	97.13	5.02	3.48
I10	(8,25)	32.05	66.70	113.87	5.86	3.44
I11	(9,25)	26.64	52.17	81.70	6.38	3.36
I12	(10,25)	13.51	44.48	74.36	7.19	3.28

I13	(5,30)	-0.89	7.76	31.59	4.89	3.84
I14	(6,30)	2.38	11.85	25.85	4.94	4.16
I15	(7,30)	4.58	23.96	46.81	6.56	4.36
I16	(8,30)	4.82	18.98	52.79	7.70	4.00
I17	(9,30)	17.76	40.66	74.50	8.80	3.56
I18	(10,30)	12.23	30.60	61.21	14.94	4.32

I19	(5,40)	-0.48	11.32	30.28	5.75	4.44
I20	(5,50)	-4.35	6.07	15.73	7.25	5.00

I21	(5,100)	-5.57	-1.61	6.35	18.52	5.88
I22	(5,100)	-4.40	3.21	11.70	15.53	5.12
I23	(5,100)	36 247	39981.12	45 527	16.09	5.24
I24	(5,100)	33 947	38370.10	45 233	15.38	5.20
I25	(5,100)	36 669	39 671	43 615	15.41	5.28