Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem

Table 4

Comparison result of our algorithm with the results of Chen and Chien (2011) [26].

TSPLIB	Chen and Chien (2011) [26]			Proposed algorithm
	Best	Mean	SD	Best	Mean	SD
berlin52	7542	7542	0.00	7542	7542	0.00
eil76	538	540.20	2.94	538	540.494	1.473
kroA100	21282	21370	123.36	21282	21307.554	34.983
kroB100	22141	22282.87	183.99	22139	22193.114	53.678
kroC100	20749	20878.97	158.64	20749	20770	34.937
kroD100	21309	21620.47	226.60	21294	21338.03	63.797
kroE100	22068	22183.47	103.32	22068	22093.099	14.819
eil101	630	635.23	3.59	629	634.355	4.479
lin105	14379	14406.37	37.28	14379	14434.907	59.097
ch130	6141	6205.63	43.70	6110	6173.038	24.544
ch150	6528	6563.70	22.45	6528	6554.589	17.303