Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization

Table 6

Comparative speed of algorithms.

TSP cases	Number of cities	ABO	MIMM-ACO	MMAS	CGAS	RAI
		Avg time; (secs)	Avg time; (secs)	Avg time; (secs)	Avg time; (secs)	Avg time; (secs)
Ry48p	48	0.07	7.83	7.97	12.35	1.598
Ft70	70	0.05	9.85	10.15	15.32	7.068
Kro124p	100	0.08	33.25	23.4	78.52	30.34
Ftv70	71	0.09	64.53	61.25	69.64	7.376
P43	43	0.1	8.35	9.38	0.997	0.997
Ftv170	171	0.65	108.28	96.73	276.1	276.1