Mining Travel Time of Airport Ferry Network Based on Historical Trajectory Data
Algorithm 1
Calculating the shortest path between ferry OD points by the Floyd algorithm.
(i)
Input: region ferry network , is the set of connection nodes representing each region, and is the travel time between regions obtained by data mining as the weight of edges.
(1)
Initialization matrix , represents the travel time between vertices and . If and are not directly connected, the weight is set to . If and come from the same region, the weight is set to 0.
(2)
Starting from the first node , calculate that is the shortest path from to that only allows the middle to pass through , and update the matrix M.
(3)
Similarly, calculate that is the shortest path from to that only allows the middle to pass through , and update the matrix M.
(4)
When , in matrix is the shortest path from node to
