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

Table 5

Results by data-guided lexisearch algorithm using Process 1 and Process 2.

Instance	OptSol	Process 1			Process 2
		BestSol	Error(%)	TotTime	BestSol	Error(%)	TotTime
br17	39	39	0.00	80.56	39	0.00	80.56
ftv33	1286	1286	0.00	742.48	1286	0.00	161.84
ftv35	1473	1473	0.00	379.42	1473	0.00	379.42
ftv38	1530	1530	0.00	1868.85	1530	0.00	1868.85
p43	5620	5634	0.25	14400.00	5634	0.25	14400.00
ftv44	1613	1613	0.00	11334.98	1613	0.00	11334.98
ftv47	1776	1853	4.34	14400.00	1853	4.34	14400.00
ry48p	14420	16381	13.60	14400.00	16381	13.6	14400.00
ft53	6905	8116	17.54	14400.00	8116	17.54	14400.00
ftv55	1608	1711	6.41	14400.00	1711	6.41	14400.00
ftv64	1839	2052	11.58	14400.00	2052	11.58	14400.00
ft70	38673	40529	4.80	14400.00	40529	4.80	14400.00
ftv70	1950	2108	8.10	14400.00	2108	8.10	14400.00
Average			5.12	9969.71		5.12	9925.05