A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

Table 1

Data sets for TSP.

Data set	Number of cities	Optimum
ch130	130	6,110
ch150	150	6,528
d198	198	15,780
a280	280	2,579
pcb442	442	50,778
d493	493	35,002
u574	574	36,905
u724	724	41,910
pr1002	1,002	259,045
u1060	1,060	224,094
d1291	1,291	50,801
u1432	1,432	152,970
d1655	1,655	62,128
u2152	2,152	64,253
pr2392	2,392	378,032
pcb3038	3,038	137,694
fnl4461	4,461	182,566
usa13509	13,509	19,982,889