# Mining Travel Time of Airport Ferry Network Based on Historical Trajectory Data

Authors: Cong Ding; Jun Bi; Dongfan Xie; Xiaomei Zhao; Yi Liu
Journal: Journal of Advanced Transportation
 (2021)

---

## Abstract

An airport ferry vehicle is a ground service vehicle used to transfer passengers between the far apron and the terminal. The travel time of ferry tasks in the airport ferry network is an important decision-making basis for ferry vehicle scheduling. This paper presents a graph-based method to mine the travel time between nodes in the airport ferry network. Firstly, combined with map and trajectory information, the method takes the terminal boarding gates, parking lots, and remote stands as road network nodes to build a complete airport ferry road network. Then, this paper uses big data processing technology to identify the travel time between regional connection nodes by data fusion through the temporal and spatial relationship between flight schedule and ferry vehicle GPS travel trajectory. Finally, the Floyd shortest path algorithm in graph theory is used to obtain the shortest path and travel time of all OD points. The experimental results show that all the ferry times calculated by the method proposed in this paper can better reflect the actual driving situation. This method saves the manpower, material resources, and time cost of on-site investigation and lays a foundation for the scheduling of ferry vehicles.


---

## Body

## 1. Introduction

When the aircraft is parked at a far apron, passengers need ferry vehicles to transfer between the aircraft and the terminal. After the airport operation center obtains the flight schedule and gate assignment [1, 2] results in a period of time, it will consider the travel time consumed by the ferry task in the road network and reasonably arrange the ferry vehicles for each flight parked in a remote stand. Only a reasonable ferry scheduling plan can ensure the normal implementation of the flight schedule. At present, the scheduling of ferry vehicles in many airports mainly depends on experienced staff. The efficiency of the scheduling results is difficult to be ensured, which is easy to lead to flight delays. Therefore, how to establish the optimal scheduling model of ferry vehicles by scientific means and improve the service level of airport ferry vehicles has attracted the attention of some scholars.The premise of ferry vehicle scheduling modeling is to know the travel time information between OD points in the ferry network. However, due to the closed environment in the airport flight area, nonstaff cannot enter the interior for field measurement. With the rapid development of smart airports, in order to realize the digitization and intelligence of airport management and meet the needs of airport safety management, some airports have established ground service vehicle GPS real-time monitoring and management systems to realize vehicle positioning, real-time tracking, track playback, cross-border alarm, and other functions. The historical GPS track data of ferry vehicles recorded by the system can reflect the time information and spatial information of vehicles in the process of performing flight support tasks. Therefore, using the trajectory data to mine and extract the travel time of the airport ferry network is a new idea.This paper proposed a novel graph-based method to mine the travel time in the airport ferry network. The research work is mainly divided into three aspects. Firstly, combined with the map and trajectory information, this paper takes the terminal boarding gates, parking lots, and remote stands as the road network nodes to build a complete airport ferry road network. Then, the nodes are divided into different regions, and the travel time between regional connecting nodes is identified by data fusion through the temporal and spatial relationship between flight schedule and ferry vehicle GPS travel trajectory. Finally, the Floyd shortest path algorithm in graph theory is used to obtain the shortest path and travel time of all OD points. The research results of this paper can save the manpower, material resources, and time cost of on-site investigation and provide a decision-making basis for the optimal scheduling model of ferry vehicles.The rest of this paper is organized as follows. In Section2, the literature on the optimal scheduling of airport ground support vehicles and GPS trajectory mining is reviewed. Section 3 takes Kunming Changshui International Airport in China as the research object and introduces the method of constructing the airport ferry network. In Section 4, the calculation method of OD point travel time in the road network is designed. The example verification and results are given in Section 5. Finally, conclusions and future research directions are proposed in Section 6.


## 2. Literature Review

With the rapid development of civil aviation, the disadvantages of airport management and operation relying only on manual experience are becoming more and more prominent. In order to ensure the normal operation of flights, how to improve the service level of airport ground support services through scientific means has attracted more and more attention of scholars. From the optimal operation of special vehicles providing various ground services to the overall optimization of joint scheduling of multiple vehicles, many achievements have been made. This paper summarizes the research literature of different ground service vehicles as a reference. Although there are differences in service content with ferry vehicles, there are many similarities in the optimization objectives and constraints in their scheduling.Norin et al. [3] constructed an airport deicing vehicle optimal scheduling model aiming at minimizing the delay time and the minimum number of deicing vehicles and designed the corresponding solution algorithm based on a greedy randomized adaptive search algorithm. Du et al. [4] studied the trailer scheduling problem in flight transit service, described the problem as VRPTW, and constructed an integer programming model with minimizing the trailer operation cost as the optimization objective and the vehicle operation restriction as the constraint. Starting from the flexibility of vehicle service, Wang et al. [5] proposed a scheduling algorithm based on a greedy strategy to deal with the dynamic scheduling problem of airport refueling vehicles. With the diversification of airport ground service and considering the interaction between various vehicle services, many studies begin to pay attention to the joint scheduling of airport ground service vehicles. Padron et al. [6] constructed a double objective optimization model to minimize waiting time and turnaround time for the joint scheduling of airport service equipment. Xu and Shao [7] evaluated the fluctuation of service equipment operation time by analyzing the airport historical data and proposed an optimization model of ground service support equipment with uncertain operation time. Fei and Shu’an [8] studied the optimization problem of airport service vehicle scheduling in peak hours and constructed a joint scheduling model of ground service vehicles to minimize the purchase cost and operation cost of service equipment. In terms of ferry vehicles, Zhao et al. [9] established an integer programming model with the goal of minimizing the number of ferry vehicles required in peak hours or a certain period and constructed a ferry vehicle sharing network, which transformed the model into the problem of maximum network flow. Han et al. [10] also proposed a ferry capacity network model, in which the directed edge indicates that the two associated nodes may be continuously served by the same ferry. The model aims to minimize the number of ferry vehicles required and is solved by the method of the graph. However, their research only roughly estimated the travel time between the terminal and the far apron area in the process of building the ferry network. For large airports, the terminal covers a wide area and is far away from different boarding gates. The unified estimation method will cause great errors in practical application.With the development of positioning technology, many vehicles are equipped with GPS receivers. During the moving process, the vehicle continuously collects real-time information, including position, motion parameters, and positioning time, and transmits it to the data center. This type of data is called floating car data [11, 12]. The emergence of these data makes it possible to mine rich knowledge from GPS trajectory data by using big data analysis technology [13]. Palma et al. and Bhattacharya et al. [14, 15] proposed the method of analyzing motion characteristics (velocity, azimuth, acceleration, etc.) to mine important places related to people and objects. Zheng and Xie [16] proposed a trajectory mining algorithm to analyze the user’s GPS trajectory data, so as to recommend personalized tourist attractions. In addition, Li et al. [17] analyzed the typical characteristics of the data of floating vehicles in the parking lot and used the DBSCAN algorithm to extract the parking lot location. Wang et al. [18] proposed the identification of key nodes and sections of urban road networks based on GPS trajectory data. In terms of path extraction, Schoredl et al. and Li et al. [19, 20] proposed two methods to extract a high-precision roadmap from GPS trajectory, which are applicable to high sampling frequency and low sampling frequency of positioning data respectively. Unlike them, Cao and Krumm [21] proposed a new gravity model to transform the original GPS track into a road network that can guide path selection. Tang et al. [22] proposed a lane-level road network information mining method based on lane number and turning rules. In addition to the region of interest and path recognition, scholars have also done a lot of research on spatiotemporal pattern extraction based on trajectory data, for example, the method of automatically extracting passenger train operation information from historical track data [23]. Dong et al. [24] proposed a study on the temporal and spatial change of traffic accessibility under public health emergencies based on GPS trajectory. Lei et al. and Zhao et al. [25, 26] proposed a spatiotemporal analysis model to capture the motion mode of the object. Different from those, Lu et al. [27] proposed a visual analysis method to study the behavior of vehicles on a certain route. Some scholars have also studied periodic pattern recognition, such as the probabilistic periodic detection method of moving objects [28]. In general, most of the GPS data mining and analysis research by scholars is based on the road traffic network, and few studies use the GPS track of airport ferry vehicles to extract the road network structure and travel time of the flight area. Therefore, the research content of this paper is innovative.


## 3. Construction of Airport Ferry Network

This paper takes the real data of Kunming Changshui International Airport in China as the research object. The airport terminal covers an area of 548300 square meters, with 78 boarding gates, 104 remote stands, 2 entry ports, and 3 parking lots. Figure1 shows the spatial layout of the airport flight area. The boarding gates and entry ports are distributed around the terminal, while the parking lots and remote stands are distributed at the far apron.Figure 1
Spatial layout of the airport flight area.When a flight is assigned to an apron, the ferry vehicle needs to arrive at the corresponding stand in advance for the arriving flight. After the plane arrives, the ferry vehicle will drive along the planned route to deliver the passengers to the entrance port of the terminal. For departure flights, according to the flight schedule, the ferry vehicle needs to arrive at the boarding gate before ticket check-in. After the gate is opened, passengers will be sent to the designated parking stand. There is also a necessary transfer time between two consecutive services of the ferry vehicle, that is, the travel time required for the ferry vehicle from the end of the last service to the start of the next service. According to the arrival and departure attributes of two adjacent service flights, the transfer between two services can be divided into four categories, as shown in Table1. After a ferry task, when the buffer time is sufficient, the ferry vehicle can go to the parking lot first and then go to the starting place of the next service when the next task is approaching. When the buffer time is insufficient, in order to avoid flight delays, the ferry vehicle can go directly to the starting point of the next service. The security efficiency of ferry vehicles is mainly affected by the transfer time. Flights with a remote stand at the airport usually change the boarding gate flexibly according to the situation. For large airports, the terminal covers a wide area and different boarding gates are far away from each other. Therefore, calculating the transfer path and time between all OD points in the whole airport is the prerequisite for the optimal scheduling of ferry vehicles.Table 1
OD point conversion of continuous flights.
Flight 1Flight 2OriginDestinationArrive flightArrive flightArrive gateRemote standArrive flightDeparture flightArrive gateDeparture gateDeparture flightDeparture flightRemote standRemote standDeparture flightArrive flightRemote standDeparture gateRegarding the boarding gates and remote stands as road network nodes, directly calculating the travel time of any two points in the road network according to the coordinate information and the travel track of ferry vehicles will cause a large workload. In order to simplify the airport road network structure, firstly, the airport terminal boarding gate and apron are divided into several relatively independent areas according to the adjacent relationship, and the spatial transfer of ferry vehicles between service points is regarded as the transfer between regions. According to the number of remote stands, apron 3 is divided into 1 to 4 parts, apron 5 is divided into 1 to 4 parts, and apron 7 is divided into 1 to 2 parts. The boarding gate area of the terminal is divided into 1 to 4 parts for the convenience of the road network structure. Figure2 shows the historical track of ferry vehicles. Combined with the actual road network distribution of the airport, the connection relationship between regions can be obtained, as shown in Figure 3. The arrangement structure of service points in one region is relatively simple, including series and parallel. As shown in Figure 4, there are two rows of remote stands in area 5-2, which are distributed in parallel. Area 3-4 has only a single row of stands, which are distributed in series. Therefore, combined with the road network structure between regions, a complete road network structure of airport service points can be obtained, as shown in Figure 5. After obtaining the spatial connection relationship between all service points from the road network diagram of service points, any service point can communicate with other service points through the road network, and when combined with the distance information on the edge, the travel time between any two points can be calculated. Therefore, the next section will explore the travel time of each edge of the road network.Figure 2
Historical GPS track of ferry vehicles.Figure 3
Road network connection between the regions.Figure 4
Nodes connection relationship in a region.Figure 5
A complete structure diagram of airport ferry network.


## 4. Calculation Method of Travel Time

According to the ferry road network established in the previous section, this section uses the historical GPS track data of ferry vehicles to obtain the weight of each edge. For the convenience of description, the following definitions are made in this paper: all nodes in the ferry network are represented byV=D1,D2,…,Di,…,Dn, where Di represents different regions. The nodes in one region are divided into internal nodes and connection nodes, Di=Pi1,Pi2,…Pim,Qi1,Qi2,…Qik, the internal node Pim is only connected with the nodes in the region, and the connection node Qik can be connected with the nodes in other regions. The GPS tracks of all ferry vehicles are represented by R=G1,G2,…,Gi,…,Gn, where Gi represents the track set of ferry vehicle i, including the longitude and latitude coordinates lngi,lati,t of the vehicle at each time. The flight set is represented as F=f1,f2,…,fi,…,fn, where the arrival and departure attributes, time, and OD point of the ferry task of flight fi are known.


### 4.1. Travel Time between Terminal and Far Apron

During the flight support task, the ferry vehicle will travel between the boarding gate area and the far stand area. Therefore, the path and time of the connecting edge between the gate area and the far stand area can be mined according to the temporal and spatial correlation between the flight schedule and the GPS track of the ferry vehicle. For arrival flights, the service flow of ferry vehicles is shown in Figure6. tiETA indicates the estimated arrival time of the flight. The ferry service starts from the time of arriving at the remote stand in advance, and the service start time TSiA can be calculated according to equation (1). After the flight arrives at the remote stand, it takes time Twait to wait for passengers to board. The ferry service ends after the passengers get off at the port, and the service end time TEiA can be calculated according to equation (2).(1)TSiA=tiETA−TadvA,(2)TEiA=tiETA+2∗Twait+Tiferry.Figure 6
Ferry vehicle service process of arrival flight.Similarly, for departure flights, according to the flight schedule, the ferry vehicle arrives at the boarding gate before ticket check-in. After passengers get off at the parking stand, the service of the ferry vehicle ends. Figure7 shows the ferry vehicle service process of departure flights. Assuming that the opening time of the boarding gate is 40 minutes (according to the service standards of China’s civil transport airport) before the departure time tiETD of the flight, the start time of the ferry vehicle for the departure flight is calculated by equation (3) and the end time of the service is calculated by equation (4).(3)TSiD=tiETD−40min−TadvD,(4)TEiD=tiETD−40min+2∗Twait+Tiferry.Figure 7
Ferry vehicle service process of departure flight.According to the ferry service process, the algorithm steps of mining the travel timeTiferry between the boarding gate area and the apron by integrating GPS track data and flight data are as follows.Step 1.
According to the road network structure, find out the connecting nodes between the boarding gate area and the far apron area to form OD pairsQik,Qjl. Search the flight set F and find the flight i whose starting and ending point of the ferry task is Qik,Qjl.Step 2.
If flighti found is a departure flight, obtain the departure time tiETD from the flight information, take time t and distance m as the search range parameters, form a set Ferrystart of all ferry vehicles that appear at the boarding gate Qik in the period tiETD−40min−t,tiETD−40min+t, and record the time Tstart when each ferry car leaves the search range. Similarly, find out all the ferry vehicles that appear at the remote stand Qjl in the period tiETD−40min+t,tiETD, form a set Ferryend, and record the time Tend when each ferry car enters the search range. If flight i found is an arrival flight, obtain the arrival time tiETA from the flight information, and change the starting point to the remote stand Qjl, the time range is tiETA−t,tiETA+t, the end point is the port Qik, and the time range is tiETA,tiETA+tmax where tmax represents the maximum ferry time range.Step 3.
Take the ferry carGi existing in both Ferrystart and Ferryend as the ferry car i serving the flight, and calculate the travel time Tendi−Tstarti of the ferry car as the travel time from the boarding gate to the stand.
When judging whether the ferry car enters the search range, take the boarding gate or stand as the center of the circle, first calculate the longitude and latitude distance between the ferry car and the center of the circle, and then compare this distance with the reference distancem. If the calculated distance is less than the reference distance, judge whether the ferry car enters the search range.


### 4.2. Travel Time between Different Far Aprons

The starting and ending point of flight service is from the boarding gate to the stand, so it is impossible to obtain the time when OD points are both stands through flight information. There are two situations for the travel time of the ferry car between two target stands. The first situation is that the ferry car directly travels from the starting stand to the ending stand. At this time, the travel time represents the distance between the two stands. Another situation is that the ferry car drives from the starting stand to other places and then to the target stand. At this time, the travel time is obviously greater than the distance between the two stands. Therefore, without the mining time range, we can only intercept the GPS track of the ferry vehicle through the coordinate values of the connecting nodes in two far aprons, then count a large number of travel time values, and select the smaller value as the travel time between the aprons. In this way, the distance from the parking lot to other service points can also be obtained.


### 4.3. Travel Time between Any Two Nodes

After mining the travel time information of edges in the road network through the above method, the nodes, edges, and the weight of edges of the road network have been obtained. The travel time between any two nodes can be calculated by using the shortest path algorithm. Calculating the shortest path is a classical problem in graph theory. At present, there has been a very mature research. The commonly used shortest path algorithms include Floyd [29], Dijkstra [30], and SPFA [31]. It is necessary to select the appropriate algorithm according to different use scenarios. From the characteristics of the algorithm, the Floyd algorithm is suitable for finding the shortest path from multiple sources, but the high time complexity makes the algorithm not suitable for road network maps with many nodes; the Dijkstra algorithm is the basis of all basic shortest path algorithms. It is the most stable algorithm, but it is suitable for finding the shortest path of a single source. It needs repeated operation to obtain the shortest path of all points; the SPFA algorithm is a queue optimization of the Bellman Ford algorithm. It is the shortest path algorithm based on BFS. It solves the problem of changing weight to negative value that the Dijkstra algorithm cannot solve. At the same time, the implementation of the algorithm is the most troublesome. The road network constructed in this paper has a total of 187 service points. Considering the scale of the road network, the positive right of way, and the need to obtain the path information between all points, the Floyd algorithm is selected to solve the shortest path.Floyd algorithm is an algorithm that uses the idea of dynamic programming to find the shortest path between multiple source points in a given weighted graph. The algorithm has the characteristics of clear structure and fast implementation. Its core idea is as follows: for each pair of shortest verticesu and v, if there is a vertex w that makes the path from u to w and then to v shorter than the known path, update it. Considering that the nodes have been divided into different regions, this paper first uses the Floyd algorithm to calculate the shortest circuit between different regions and then calculates the shortest circuit between the nodes in the region and the connecting nodes. The algorithm flow of finding the shortest path of OD points of ferry task is as follows (Algorithm 1):Algorithm 1: Calculating the shortest path between ferry OD points by the Floyd algorithm.
(i)
Input: region ferry network G=Q,E, Q is the set of connection nodes representing each region, and E is the travel time between regions obtained by data mining as the weight of edges.(1)
Initialization matrixM, mij represents the travel time between vertices i and j. If i and j are not directly connected, the weight is set to ∞. If i and j come from the same region, the weight is set to 0.(2)
Starting from the first nodeq1, calculate that mij1=minmij0,mi10+m1j0 is the shortest path from i to j that only allows the middle to pass through q1, and update the matrix M.(3)
Similarly, calculate thatmijk=minmijk−1,mikk−1+mkjk−1 is the shortest path from i to j that only allows the middle to pass through q1,q2,…qk, and update the matrix M.(4)
Whenk=n, mij in matrix M is the shortest path from node i to j(ii)
Output: matrix M.After the shortest path between regions is obtained by the above algorithm, combined with the distance from the internal node to the connecting node in the region, the shortest travel time between any two points can be obtained. The edge inside the area mainly represents the distance between two gates, and the fixed valueCgate can be adopted. If n stands are separated between the internal node and the connecting node, the distance is n∗Cgate.


## 4.1. Travel Time between Terminal and Far Apron

During the flight support task, the ferry vehicle will travel between the boarding gate area and the far stand area. Therefore, the path and time of the connecting edge between the gate area and the far stand area can be mined according to the temporal and spatial correlation between the flight schedule and the GPS track of the ferry vehicle. For arrival flights, the service flow of ferry vehicles is shown in Figure6. tiETA indicates the estimated arrival time of the flight. The ferry service starts from the time of arriving at the remote stand in advance, and the service start time TSiA can be calculated according to equation (1). After the flight arrives at the remote stand, it takes time Twait to wait for passengers to board. The ferry service ends after the passengers get off at the port, and the service end time TEiA can be calculated according to equation (2).(1)TSiA=tiETA−TadvA,(2)TEiA=tiETA+2∗Twait+Tiferry.Figure 6
Ferry vehicle service process of arrival flight.Similarly, for departure flights, according to the flight schedule, the ferry vehicle arrives at the boarding gate before ticket check-in. After passengers get off at the parking stand, the service of the ferry vehicle ends. Figure7 shows the ferry vehicle service process of departure flights. Assuming that the opening time of the boarding gate is 40 minutes (according to the service standards of China’s civil transport airport) before the departure time tiETD of the flight, the start time of the ferry vehicle for the departure flight is calculated by equation (3) and the end time of the service is calculated by equation (4).(3)TSiD=tiETD−40min−TadvD,(4)TEiD=tiETD−40min+2∗Twait+Tiferry.Figure 7
Ferry vehicle service process of departure flight.According to the ferry service process, the algorithm steps of mining the travel timeTiferry between the boarding gate area and the apron by integrating GPS track data and flight data are as follows.Step 1.
According to the road network structure, find out the connecting nodes between the boarding gate area and the far apron area to form OD pairsQik,Qjl. Search the flight set F and find the flight i whose starting and ending point of the ferry task is Qik,Qjl.Step 2.
If flighti found is a departure flight, obtain the departure time tiETD from the flight information, take time t and distance m as the search range parameters, form a set Ferrystart of all ferry vehicles that appear at the boarding gate Qik in the period tiETD−40min−t,tiETD−40min+t, and record the time Tstart when each ferry car leaves the search range. Similarly, find out all the ferry vehicles that appear at the remote stand Qjl in the period tiETD−40min+t,tiETD, form a set Ferryend, and record the time Tend when each ferry car enters the search range. If flight i found is an arrival flight, obtain the arrival time tiETA from the flight information, and change the starting point to the remote stand Qjl, the time range is tiETA−t,tiETA+t, the end point is the port Qik, and the time range is tiETA,tiETA+tmax where tmax represents the maximum ferry time range.Step 3.
Take the ferry carGi existing in both Ferrystart and Ferryend as the ferry car i serving the flight, and calculate the travel time Tendi−Tstarti of the ferry car as the travel time from the boarding gate to the stand.
When judging whether the ferry car enters the search range, take the boarding gate or stand as the center of the circle, first calculate the longitude and latitude distance between the ferry car and the center of the circle, and then compare this distance with the reference distancem. If the calculated distance is less than the reference distance, judge whether the ferry car enters the search range.


## 4.2. Travel Time between Different Far Aprons

The starting and ending point of flight service is from the boarding gate to the stand, so it is impossible to obtain the time when OD points are both stands through flight information. There are two situations for the travel time of the ferry car between two target stands. The first situation is that the ferry car directly travels from the starting stand to the ending stand. At this time, the travel time represents the distance between the two stands. Another situation is that the ferry car drives from the starting stand to other places and then to the target stand. At this time, the travel time is obviously greater than the distance between the two stands. Therefore, without the mining time range, we can only intercept the GPS track of the ferry vehicle through the coordinate values of the connecting nodes in two far aprons, then count a large number of travel time values, and select the smaller value as the travel time between the aprons. In this way, the distance from the parking lot to other service points can also be obtained.


## 4.3. Travel Time between Any Two Nodes

After mining the travel time information of edges in the road network through the above method, the nodes, edges, and the weight of edges of the road network have been obtained. The travel time between any two nodes can be calculated by using the shortest path algorithm. Calculating the shortest path is a classical problem in graph theory. At present, there has been a very mature research. The commonly used shortest path algorithms include Floyd [29], Dijkstra [30], and SPFA [31]. It is necessary to select the appropriate algorithm according to different use scenarios. From the characteristics of the algorithm, the Floyd algorithm is suitable for finding the shortest path from multiple sources, but the high time complexity makes the algorithm not suitable for road network maps with many nodes; the Dijkstra algorithm is the basis of all basic shortest path algorithms. It is the most stable algorithm, but it is suitable for finding the shortest path of a single source. It needs repeated operation to obtain the shortest path of all points; the SPFA algorithm is a queue optimization of the Bellman Ford algorithm. It is the shortest path algorithm based on BFS. It solves the problem of changing weight to negative value that the Dijkstra algorithm cannot solve. At the same time, the implementation of the algorithm is the most troublesome. The road network constructed in this paper has a total of 187 service points. Considering the scale of the road network, the positive right of way, and the need to obtain the path information between all points, the Floyd algorithm is selected to solve the shortest path.Floyd algorithm is an algorithm that uses the idea of dynamic programming to find the shortest path between multiple source points in a given weighted graph. The algorithm has the characteristics of clear structure and fast implementation. Its core idea is as follows: for each pair of shortest verticesu and v, if there is a vertex w that makes the path from u to w and then to v shorter than the known path, update it. Considering that the nodes have been divided into different regions, this paper first uses the Floyd algorithm to calculate the shortest circuit between different regions and then calculates the shortest circuit between the nodes in the region and the connecting nodes. The algorithm flow of finding the shortest path of OD points of ferry task is as follows (Algorithm 1):Algorithm 1: Calculating the shortest path between ferry OD points by the Floyd algorithm.
(i)
Input: region ferry network G=Q,E, Q is the set of connection nodes representing each region, and E is the travel time between regions obtained by data mining as the weight of edges.(1)
Initialization matrixM, mij represents the travel time between vertices i and j. If i and j are not directly connected, the weight is set to ∞. If i and j come from the same region, the weight is set to 0.(2)
Starting from the first nodeq1, calculate that mij1=minmij0,mi10+m1j0 is the shortest path from i to j that only allows the middle to pass through q1, and update the matrix M.(3)
Similarly, calculate thatmijk=minmijk−1,mikk−1+mkjk−1 is the shortest path from i to j that only allows the middle to pass through q1,q2,…qk, and update the matrix M.(4)
Whenk=n, mij in matrix M is the shortest path from node i to j(ii)
Output: matrix M.After the shortest path between regions is obtained by the above algorithm, combined with the distance from the internal node to the connecting node in the region, the shortest travel time between any two points can be obtained. The edge inside the area mainly represents the distance between two gates, and the fixed valueCgate can be adopted. If n stands are separated between the internal node and the connecting node, the distance is n∗Cgate.


## 5. Experimental Results and Analysis

In order to verify the proposed travel time mining method of the ferry network, this paper uses the actual data of Changshui International Airport to verify the effectiveness and practicability of the method. Flight data from January to June 2019, historical GPS track data of ferry vehicles, and coordinate information of each parking stand and boarding gate of the airport are collected. The data samples are shown in Tables2 to 4.Table 2
Flight information (partial departure flight).
Flight numberStandBoarding gateCheck-in timeClose timeDeparture timeTV6031153272019/1/1 0 : 012019/1/1 0 : 132019/1/1 0 : 373U8837155172019/1/1 0 : 032019/1/1 0 : 242019/1/1 0 : 513U810732642019/1/1 0 : 122019/1/1 0 : 362019/1/1 1 : 03KY8335521L552019/1/1 0 : 152019/1/1 0 : 492019/1/1 0 : 59CA5785521L552019/1/1 0 : 152019/1/1 0 : 492019/1/1 0 : 59ZH5335521L552019/1/1 0 : 152019/1/1 0 : 492019/1/1 0 : 59MU2569109702019/1/1 0 : 182019/1/1 0 : 322019/1/1 0 : 50ZH3181145592019/1/1 0 : 232019/1/1 0 : 452019/1/1 0 : 56KY8281145592019/1/1 0 : 232019/1/1 0 : 452019/1/1 0 : 56CZ3416141602019/1/1 0 : 232019/1/1 0 : 342019/1/1 0 : 50Table 3
GPS trajectory information of the ferry car (partial).
Car IDGPS timeLongitudeLatitude12019/1/1 12 : 01 : 03102.93298325.11126612019/1/1 12 : 02 : 01102.93625.10851612019/1/1 12 : 03 : 01102.93826625.1095512019/1/1 12 : 04 : 01102.93903325.10943312019/1/1 12 : 05 : 31102.93906625.10943312019/1/1 12 : 06 : 29102.93906625.10941612019/1/1 12 : 06 : 59102.93906625.10941612019/1/1 12 : 08 : 59102.93908325.109412019/1/1 12 : 09 : 29102.93906625.109412019/1/1 12 : 10 : 59102.9390525.1094Table 4
Latitude and longitude information of service point (partial).
Boarding gatesRemote standsNumberLongitudeLatitudeNumberLongitudeLatitudeb1102.927453125.1011307311102.929061125.0955317b2102.926511725.1012863312102.929547125.0951637b3102.927130125.1010857313102.930027125.0946687b4102.926803725.1012533314102.935960125.1012577b5102.925716725.1015113315102.936239125.1016377b6102.925245725.1018223316102.936499125.1019157b7102.924831725.1021203317102.936759725.1021916b8102.924396225.1024135318102.937051725.1025726b9102.923660225.1022575321102.922254725.1004473b10102.923893225.1027735322102.921670725.1006893Since the airport does not record the daily scheduling historical data of ferry vehicles, we do not know which vehicle performs each task. Therefore, we need to identify them according to the data fusion method proposed in Section4 to obtain the specific ferry vehicles corresponding to the task and the time nodes of their entry and departure starting and ending points. According to the method in Section 4, we first excavate the distance between the boarding gate area and the far apron area. Ferry vehicles will not stop too far away from the aircraft and stop at the task site for too long, so we set the time scaling parameter t=10min and the space distance scaling parameter m=20m. Take boarding gate area B-1 and far apron 5-2 as examples, according to the identification results, the corresponding starting waiting time, travel time, and terminal waiting time can be calculated, and the GPS track of the vehicle can be checked back according to the identification time of the starting and ending points to obtain the support path, as shown in Figure 8. The yellow circle indicates the search range, and the time difference of these seven GPS data can be calculated as the travel time of connection nodes gate B48 and stand 521L. According to this, the results of each calculation are collected, and the mean value of all results is taken as the transfer time between the two. For the distance between different far apron areas, we count a lot of travel time between two connection nodes. Figure 9 shows the distance distribution characteristics from gate 48 to P-1 parking lot connection point p5|p6 and from stand 526L to stand 531. The corresponding distance is represented by selecting a smaller value, which can be taken as 0.5 and 1.0 minutes. Through the above two methods, the transfer time between regional connection nodes in the outlet network can be calculated, as shown in Table 5.Figure 8
Example of ferry car path calculation.Figure 9
Histogram of OD distance distribution from b48 top5|p6 (a) and 526L to 531 (b).
(a)(b)Table 5
Distances between areas in the road network.
Region 1Region 2Travel time (min)NumberConnection nodeNumberConnection nodeB-1b93-13211.6B-1b563-33281.7B-2b723-23111.5B-2b403-43182.3B-3b48P-1p5|p60.5B-4b32P-1p5|p60.5P-1p5|p67-13303.1P-1p5|p65-2521L6.5P-1p5|p65-35208.5P-1p5|p65-35169.5P-2p1B-1b132.2P-2p13-33241.4P-3p3B-2b782.1P-3p3B-2b402.8P-3p33-43141.33-33287-1722a1.83-33285-15313.65-2526L5-15311.05-3519R5-45161.45-45017-27101.3With the travel time between connection nodes, the shortest travel time between any regions can be calculated according to the Floyd shortest path algorithm. The distance between aircraft stands in the area isCgate=40m according to the actual situation of Changshui airport. When the maximum allowable speed of the ferry vehicle in the flight area is 25 km/h, the travel time between the inner edges of the area can be calculated as about 0.1 minutes. Therefore, the distance between any two nodes in the airport ferry network is equal to the distance between regions plus the distance between these two points and the connecting nodes in the region. The calculation results are shown in Table 6.Table 6
OD distances calculated by the Floyd algorithm (partial).
328329330521521L521R522522L522R5233280.02.32.44.84.94.74.54.64.45.03292.30.00.17.17.27.06.86.96.77.33302.40.10.07.27.37.16.97.06.87.45214.87.17.20.00.10.10.30.20.40.2521L4.97.27.30.10.00.20.40.30.50.1521R4.77.07.10.10.20.00.20.10.30.35224.56.86.90.30.40.20.00.10.10.5522L4.66.97.00.20.30.10.10.00.20.4522R4.46.76.80.40.50.30.10.20.00.65235.07.37.40.20.10.30.50.40.60.0In order to check the accuracy of the distance information mined in this paper, we directly calculate the distance between the internal nodes of the two randomly selected areas as the real value through the above distance calculation method and compare it with the corresponding distance in the distance matrix obtained by Floyd algorithm. In order to better measure this difference, this paper introduces absolute error (Error), mean absolute error (MAE), and root mean square error (RMSE) as evaluation indexes to test the accuracy of the distance matrix, as shown in equations (5) to (7).(5)Error=Y−Y^,(6)MAE=1n∑i=1nYi−Yi^,(7)RMSE=1n∑i=1nYi−Yi^2.The error is shown in Figure10, and the MAE and RMSE calculation results are shown in Table 7. The results show that the mean value of the distance error between the distance calculated by the road network and the GPS track is kept at about zero, and the deviation is kept at about 1 minute. Considering that there are many random factors in the actual driving of the ferry car, the current results can better reflect the actual driving situation and meet the needs of data accuracy for modeling.Figure 10
Error distribution of OD distance.Table 7
Error index of OD distance.
GateMAERSMEb48b50b52b54b48b50b52b545210.66110.84890.72780.87661.04471.11181.18221.2811524R0.57610.7070.75070.37670.79190.85160.92280.84095260.79360.62120.81630.95940.84620.84491.10060.8715526L0.76360.71841.07030.82910.99390.84870.94941.10015341.01321.01171.06791.21021.18821.33631.26911.3307


## 6. Conclusion

This paper studies the ferry vehicles in the airport flight area. Based on the analysis and mining of ferry vehicle trajectory data, the ferry road network map is established, and a new method is proposed to extract the travel time between OD points in the ferry network. The experimental results show that the shape of the ferry road network constructed in this paper and the calculation results of travel time can reflect the real operation to a great extent. The purpose of this research paper is exactly to solve the problem of ferry vehicles’ dynamic scheduling. With the travel time between OD points of the ferry network obtained in this paper, combined with the real-time GPS data of ferry vehicles, we can study how to predict the task state of vehicles and schedule vehicles dynamically and reasonably in the future.



---

*Source: 9231451-2021-10-31.xml*