Discrete Bird Swarm Algorithm Based on Information Entropy Matrix for Traveling Salesman Problem

Table 3

The running time of DBA [9], IDCS [6], and DBSA algorithm.

No	Instance	DBA	IDCS	DBSA
1	Eil51	0.20	1.16	0.16
2	Berlin52	0.03	0.09	0.02
3	St70	0.43	1.56	0.21
4	Pr76	0.57	4.73	0.11
5	Eil76	1.54	6.54	0.10
6	KroA100	1.36	2.70	0.21
7	KroB100	3.35	8.74	0.49
8	KroC100	2.51	3.36	0.21
9	KroD100	7.55	8.35	0.38
10	KroE100	11.12	14.18	0.53
11	Eil101	17.09	18.74	0.31
12	Lin105	2.27	5.01	0.25
13	Pr107	18.01	12.89	0.43
14	Pr124	2.57	3.36	0.17
15	Bier127	19.14	25.50	0.50
16	Ch130	13.68	23.12	0.51
17	Pr136	22.10	35.82	0.69
18	Pr144	2.12	2.96	0.58
19	Ch150	25.70	27.74	0.79
20	KroA150	21.75	31.23	0.78
21	KroB150	22.17	33.01	0.81
22	Pr152	15.24	14.86	0.64
23	Rat195	42.30	57.25	1.06
24	D198	38.75	59.95	1.16
25	KroA200	46.97	62.08	1.12
26	KroB200	53.10	64.06	1.13
27	Ts225	18.24	47.51	0.55
28	Tsp225	80.61	76.16	1.30
29	Pr226	44.89	50.00	1.04
30	Gil262	81.25	102.39	1.58
31	Pr264	64.51	82.93	1.37
32	A280	28.6	115.57	1.37
33	Pr299	102.64	138.20	1.84
34	Lin318	120.14	156.17	2.04
35	Rd400	194.11	264.94	2.81
36	Fl417	112.36	274.59	3.75
37	Pr439	223.09	308.75	3.22
38	Rat575	423.56	506.67	4.07
39	Rat783	758.49	968.66	6.52
40	Rr1002	1195.20	1662.61	9.94
41	Nrw1379	1863.12	3160.47	16.52