Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem

Table 1

Comparison for OR-Library instances.

Instances			SA			CSA
Name	Size (𝑚×𝑛)	Optimal solution	Result	Gap (%)	CPU time^(S)	Result	Gap (%)	CPU time^(S)
Cap71	16×50	932615.750	1192413.575	6.995	4.233	932615.750	0	0.921
Cap72	16×50	977799.400	1012970.190	5.970	4.690	977799.400	0	1.599
Cap73	16×50	1010641.450	1100470.190	8.179	4.435	1010641.450	0	0.732
Cap74	16×50	1034976.975	1212970.191	12.276	6.438	1034976.975	0	1.499
Cap101	25×50	796648.440	886494.475	9.250	12.552	796648.440	0	2.192
Cap102	25×50	854704.200	998953.625	15.698	13.652	854704.200	0	2.612
Cap103	25×50	893782.1125	1002291.150	11.412	12.002	893782.1125	0	1.798
Cap104	25×50	928941.750	1177291.150	24.333	18.263	928941.750	0	5.048
Cap131	50×50	793439.5620	856571.455	6.607	54.688	793439.562	0	24.723
Cap132	50×50	851495.3250	1011571.450	16.732	45.563	851495.325	0	19.803
Cap133	50×50	893076.7120	1219071.450	32.485	56.549	893076.712	0	8.842
Cap134	50×50	928941.7500	1374071.452	41.690	49.156	928941.750	0	14.972