A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem

Table 4

The parameters of instances.

Instance	Num	Num.C	Maxiter	L	Tt
att48	400	20 × 20	50	100	0.01
berlin52	400	20 × 20	50	100	0.01
bier127	1600	40 × 40	100	500	0.001
ch130	1600	40 × 40	100	500	0.001
chn31	400	20 × 20	50	100	0.01
eil51	400	20 × 20	50	100	0.01
eil76	900	30 × 30	100	500	0.01
kroa100	400	20 × 20	50	100	0.01
kroa200	1600	40 × 40	100	500	0.001
oliver30	400	20 × 20	50	100	0.01
pr107	1600	40 × 40	50	500	0.001
pr136	1600	40 × 40	100	500	0.001
pr152	1600	40 × 40	100	500	0.001