[Retracted] Research on Optimal Route Planning for Self-Driving Tour Based on Road Network Structure

Table 4

Running time of different algorithms.

	Dijkstra’s algorithm	Bellman-Ford algorithm	A^∗ algorithm
Business volume	Running time (ms)	Running time (ms)	Running time (ms)
100	129	82	1741
300	342	265	1803
600	545	408	1769
900	1032	603	1796
1200	1360	1206	1864
1500	1707	1532	1872
1800	2013	1857	1900
2100	2365	2043	1934
2400	2681	2465	1989
2700	2964	2689	2041
3000	3335	3013	2103