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

Table 2

The solution point, corresponding objective function, and time in seconds provided by the heuristic algorithm.

Prob		Solution point	Objective function value	Time (sec)
P1	5		38.6308975914
P2	5		35.6524439425
P3	5		32.8210021279
P4	10		18.9069002076	0.0001
P5	10		18.4514161651	0.0001
P6	10		106.1627295736	0.0001
P7	50		723.0047301353	0.0002
P8	50		114.6249767471	0.0007
P9	50		455.1344852622	0.0002
P10	100		231.0855570171	0.0003
P11	100		297.6045429275	0.0009
P12	100		286.7386225628	0.0005
P13	250		549.9465893405	0.0008
P14	250		543.7610648263	0.0007
P15	250		536.8203916176	0.0015
P16	500		6194.3817254403	0.0032
P17	500		1019.3526027819	0.0041
P18	500		4667.4820432420	0.0036