Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

Table 3

Comparison of the best solutions obtained from the FA, E-FA, ABC, and CB-ABC algorithms for 18 test instances over 30 runs.

Prob		FA	E-FA	ABC	CB-ABC
P1	5	38.6308975997	38.6308975913	38.6309142364	38.6308975913
P2	5	32.6409719983	32.6409719926	32.6409728972	32.6409719926
P3	5	32.8210027975	32.8210021279	32.8210021279	32.8210021279
P4	10	18.7528484406	18.7528484372	18.7528484934	18.7528484372
P5	10	18.3972444320	18.3972444317	18.3972444324	18.3972444317
P6	10	105.9917830548	105.9917830153	105.9917835005	105.9917830153
P7	50	723.0047799356	723.0047449044	723.0047448967	723.0047448967
P8	50	108.9894160829	108.9894138822	108.9894138815	108.9894138815
P9	50	455.1344837962	455.1344639665	455.1344639631	455.1344639631
P10	100	231.0855604428	231.0855570172	231.0855570166	231.0855570165
P11	100	297.2586347001	297.2586211173	297.2586217396	297.2586211143
P12	100	286.7386294462	286.7386225632	286.7386225626	286.7386225626
P13	250	549.9466005355	549.9465893424	549.9476076576	549.9465893411
P14	250	543.7610916668	543.7610648272	543.7611199289	543.7610648263
P15	250	536.8204201801	536.8203916186	536.8203922596	536.8203916167
P16	500	6193.7933019446	6193.7927947779	6193.7927947450	6193.7927947450
P17	500	1017.8088547714	1017.8088230476	1017.8091304405	1017.8088230326
P18	500	4667.0497043757	4667.0492697127	4667.0515567517	4667.0492696773