Floyd-A^∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

Table 3

Efficiency comparison of three procedures for LTIP-USPT in Figure 7.

Procedures	Item
	Running time (ms)	Relative reduction of running time (%)	Expanding times of nodes (sec.)	Relative reduction of expansion times (%)
Dijkstra-like	2.0422	0	53.64	0
Plain-A*	1.78	12.84	40.049	25.34
Floyd-A*	1.3621	33.3	20.611	61.58