Floyd-A<sup><i>∗</i></sup> Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left" rowspan="2">
                  Procedures</td><td align="center" colspan="2">Item</td></tr><tr class="thead"><td align="center">Running time (ms)</td><td align="center">Relative reduction of running time (%)</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">Dijkstra-like</td><td align="center">43.5</td><td align="center">0</td></tr><tr><td align="left">Plain-A*</td><td align="center">34.2</td><td align="center">21.4</td></tr><tr><td align="left">Floyd-A*</td><td align="center">15.7</td><td align="center">63.9</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Efficiency comparison of three procedures for LTIP in Shenyang City USPT network.

Mathematical Problems in Engineering

tab4

Table 4

Table 4: Floyd-A<sup><i>∗</i></sup> Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network 

Mathematical Problems in Engineering

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

Table 4

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