A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem

Table 9

Computational times for random asymmetric instances drawn from different intervals of data.

Interval	n	No. of Instances	PSA		LSA		DGLSA
			Average	Std dev	Average	Std dev	Average	Std dev
[1,10]	30–45	80	577.91	1860.81	338.93	1319.01	281.34	899.65
[1,𝑛]	30–45	80	287.66	921.44	276.83	772.14	192.62	594.60
[1,10^2]	30–45	80	214.05	1153.17	461.72	2278.94	220.18	627.33
[1,10^3]	30–45	80	68.04	151.58	147.83	312.02	112.30	333.00
[1,10^4]	30–45	80	434.08	2382.00	459.14	123.89	420.41	1911.07
Average			314.59	1497.05	339.29	1515.41	244.66	1021.90