A method, system and storage medium for calculating aviation accessibility

Abstract

The present invention provides an aviation accessibility calculation method, system and storage medium, and the aviation accessibility calculation method includes accessibility time calculation, waypoint coverage calculation, flight density calculation and flight balance calculation. This application mainly realizes the accessibility measurement needs through four indicators: accessibility time, waypoint coverage, flight density and flight balance. Based on dynamic programming, greedy algorithm, forward and reverse Dijkstra algorithm, a path algorithm suitable for aviation path calculation and accessibility measurement needs is developed, which effectively makes up for the shortcomings of the traditional route calculation method that cannot calculate the vacancies of one-time transfer or two-time transfer flight routes and the time-consuming manual calculation. Through the server, the best accessibility path and accessibility time of one flight season>all waypoints in the country to all waypoints in the country>normal commuting time points in a week can be calculated within one and a half hours, ensuring the accuracy and effectiveness of the results while being far higher than the efficiency of human calculation.

Description

Technical Field

[0001] The present invention relates to the field of aviation technology, and in particular to an aviation accessibility calculation method, system and storage medium. Background Art

[0002] Due to the timeliness of air routes (they can only be used as effective access paths during the scheduled time period), traditional route calculation methods cannot accurately calculate access paths by connecting transfer flights. In addition to flight connections, accessibility measurement also has algorithm requirements for waiting time, access time, transfer time, and path selection. In order to meet the needs of accessibility measurement, how to innovatively develop a path algorithm that is suitable for air path calculation and accessibility measurement needs, in order to make up for the shortcomings of traditional route calculation methods that cannot calculate the vacancies of single-transfer or double-transfer flight routes and that manual calculations take too long, has become a technical problem that urgently needs to be solved. Summary of the invention

[0003] In view of the technical problems that the existing route calculation method cannot calculate the vacancies of the routes of single-transfer or double-transfer flights and the manual calculation takes too long, the present invention provides an aviation accessibility calculation method.

[0004] In order to solve the above technical problems, the present invention adopts the following technical solutions:

[0005] A method for calculating aviation accessibility includes calculation of access time, waypoint coverage, flight density and flight balance; wherein:

[0006] The access time refers to the arithmetic mean of the time (including waiting time on the way) required for passengers to arrive at the destination city airport by civil aviation transportation modes such as direct flight, stopover and transfer between 6:00 (inclusive) and 24:00 (exclusive) every day within 7 days of a week; the calculation of the access time includes: confirming the flight status within 24 hours of the departure time, if

[0007] If there is a direct flight (including stopover) within 24 hours of the departure time, a set of direct solutions and a set of one-transfer solutions are generated respectively, and the direct solution with the shortest access time in the direct solution set is taken as the optimal direct solution P. 直优 , the access time in the transfer solution set is between [the shortest transfer access time, the shortest transfer access time + T 绕 The optimal one-time transfer plan P is the one with a detour rate lower than the shortest access time and the smallest detour rate. 一转优 , compare the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优)≤T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 直优 , the optimal access time is T(P 直优 ), where T 浮 is the floating waiting time; if T(P 直优 )>T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 一转优 , the optimal access time is T(P 一转优 ); If there is only a direct flight within 24 hours of the departure time, the direct flight with the shortest access time is directly selected as the optimal direct flight plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time;

[0008] If there is only one connecting flight within 24 hours of the departure time, refer to the calculation method of the above one-transfer plan to output the one-transfer plan set and the optimal one-transfer plan P 一转优 And the optimal access time T(P 一转优 );

[0009] If there is no direct flight or one-stop flight within 24 hours of departure, then find a two-stop flight plan. If there is no two-stop flight, the output access time is 72 hours. If there is a two-stop flight plan, first decompose the two-stop flight plan into a direct flight (including stopover) + one-stop plan, then calculate the access time of all direct plans, then form all one-stop plans and their corresponding access time, and then summarize and generate a set of two-stop plans. Finally, the plan with the shortest access time in the set of two-stop plans is taken as the optimal two-stop plan P 二转优 The access time of this scheme is taken as the optimal access time T(P 二转优 );as well as

[0010] Get the destination city c, the day of the week j, that is, from Monday to Sunday, the departure time point i at the hour (6:00-23:00), and the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the j-th day of the week ij That is, the optimal access time obtained by the above different travel flight plans is Calculate access time;

[0011] The waypoint coverage refers to the number of waypoint cities that can be reached and are not repeated within a week from the departure city airport through direct flights and stopover civil aviation transportation modes, that is, the number of connected destination cities. The calculation of the number of waypoint cities includes: obtaining the number of waypoint cities C covered by direct flights respectively直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities;

[0012] The flight density refers to the average daily number of flights that passengers can reach the city airport by direct flights or stopovers from the departure city airport between 6:00 (inclusive) and 24:00 (exclusive) every day within 7 days of a week. The flight density calculation includes: obtaining the destination city c, the day of the week j, i.e., from Monday to Sunday, the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1), according to the formula Calculate flight density;

[0013] The flight balance refers to the uniformity of flights that passengers can reach the city airport by direct flights and stopover civil aviation transportation modes when they depart from the departure city airport at the hour between 6:00 (inclusive) and 24:00 (exclusive) every day within 7 days of a week. The flight balance calculation includes: obtaining the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i at the hour, the time period evaluation coefficient μ, and the flight distribution, i.e., the probability λ of the number of access times of flights on a route distributed in each time slice, according to the formula Calculate flight balance.

[0014] Furthermore, the flight status within 24 hours of the departure time is confirmed, if there is a direct flight (including stopover) within 24 hours of the departure time, including:

[0015] According to the formula T 直 = S-t+f calculates the access time of all direct options within 24 hours from the departure time, and summarizes the flight information and access time of these options to generate a set of direct options; where S is the flight departure time, t is the passenger departure time, and f is the flight time;

[0016] Under the condition that the transfer connection time at the transfer point is not less than the shortest connection time MCT specified by the airport, all transfer plans within 24 hours from the departure time are screened out, and the access time and detour rate of each transfer plan are calculated. The calculation formula for access time is T 一转=S-t+f1+t1+f2, where f1 is the flight time of the first flight, t1 is the transfer connection time between the two flights, and f2 is the flight time of the second flight; the formula for calculating the detour rate is r=(R1+R2) / R, where R1 is the spherical distance between the two places calculated based on the latitude and longitude of the starting point and the transfer point, R2 is the spherical distance between the transfer point and the destination, and R is the spherical distance between the starting point and the destination; the flight information, access time, and detour rate of a transfer plan are summarized to generate a transfer plan set;

[0017] From the set of direct solutions, find the solution with the shortest access time as the optimal direct solution, denoted as P 直优 ;

[0018] From the set of one-way transfer solutions, first find the one-way transfer solution with the shortest access time and determine the shortest one-way transfer access time; secondly, from the set of one-way transfer solutions, find the one-way transfer solution with the access time between [shortest one-way transfer access time, shortest one-way transfer access time + T 绕 ], and finally compare the detour rates of these transit plans, and take the transit plan with the smallest detour rate as the optimal transit plan, denoted by P 一转优 .

[0019] Furthermore, the T 绕 and T 浮 It is set to 60 minutes.

[0020] Furthermore, the flight situation within 24 hours of the departure time is confirmed. If there is no direct flight or one connecting flight within 24 hours of the departure time, if there is a two connecting flight plan, it includes:

[0021] According to the direct routes in the flight information, find out the direct flight points C1, C2, ... C from city A. n , and then go directly from city A to point C n Start from A, find a single transfer plan to city B, combine the direct route between AC and the single transfer plan between CB, and you will get the secondary transfer plan from city A to city B.

[0022] According to the formula Calculate AC n The access time between An From city A to city C n Flight departure time between A is the departure time from city A, From city A to city C n Similarly, calculate the flight time from city A to all direct flight points;

[0023] C1, C2...Cn is the starting point, city B is the destination, and flight number AC n The landing time plus the shortest connection time MCT at point C is the departure time t Cn , find C n A transfer plan to city B, according to the formula Calculate C n The access time between B, where S Cn C n The departure time of the first flight of a transfer plan between B and C, f1 is the flight time of the first flight, t 转 is the connecting time between the two flights, f2 is the flight time of the second flight; n The flight information and access time of all the one-stop transfer plans between C1, C2, ..., C n All the one-stop transfer options to City B and the corresponding access time;

[0024] Based on AC n Direct solution between n A transfer plan between C n B's first flight takes off at a time far from AC n The time interval between direct flights and landing is not less than the shortest connecting time MCT at point C. All secondary transfer plans are combined and calculated according to the formula T 二转 =T ACn +T CnB +T Cn转 Calculate the access time of each option, summarize the flight information and access time of all secondary transfer options, and generate the time between AB at t A A collection of secondary transfer options starting at a certain time;

[0025] For the set of secondary transfer solutions, find the solution with the shortest access time as the optimal access solution from A to B, denoted as P 二转优 , and the access time T(P 二转优 ) as the optimal access time; if T(P 二转优 )≥72 hours, it is considered that the conditions for air travel are not feasible, the output optimal access plan is empty, and the optimal access time is 72 hours.

[0026] Furthermore, in the calculation of the flight balance, the time period evaluation coefficient μ=1 / 3, 2 / 3, 1, and the probability λ=1 / 36, 2 / 36, ..., m / 36, ..., 1.

[0027] The present invention also provides an aviation accessibility calculation system, including an accessibility time calculation module, a waypoint coverage calculation module, a flight density calculation module and a flight balance calculation module; wherein,

[0028] The access time calculation module is configured to: confirm the flight status within 24 hours of the departure time, if

[0029] If there is a direct flight (including stopover) within 24 hours of the departure time, a set of direct solutions and a set of one-transfer solutions are generated respectively, and the direct solution with the shortest access time in the direct solution set is taken as the optimal direct solution P. 直优 , the access time in the transfer solution set is between [the shortest transfer access time, the shortest transfer access time + T 绕 The optimal one-time transfer plan P is the one with a detour rate lower than the shortest access time and the smallest detour rate. 一转优 , compare the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优 )≤T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 直优 , the optimal access time is T(P 直优 ), where T 浮 is the floating waiting time; if T(P 直优 )>T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 一转优 , the optimal access time is T(P 一转优 ); If there is only a direct flight within 24 hours of the departure time, the direct flight with the shortest access time is directly selected as the optimal direct flight plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time;

[0030] If there is only one connecting flight within 24 hours of the departure time, refer to the calculation method of the above one-transfer plan to output the one-transfer plan set and the optimal one-transfer plan P 一转优 And the optimal access time T(P 一转优 );

[0031] If there is no direct flight or one-stop flight within 24 hours of the departure time, then find a two-stop flight plan. If there is no two-stop flight, the output access time is 72 hours. If there is a two-stop flight plan, first decompose the two-stop flight plan into a direct flight (including stopover) + one-stop plan, then calculate the access time of all direct plans, then form all one-stop plans and the corresponding passing time, and then summarize and generate a set of two-stop plans. Finally, the plan with the shortest access time in the set of two-stop plans is taken as the optimal two-stop plan P二转优 The access time of this scheme is taken as the optimal access time T(P 二转优 );as well as

[0032] Get the destination city c, the day of the week j, that is, from Monday to Sunday, the departure time point i at the hour (6:00-23:00), and the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the j-th day of the week ij That is, the optimal access time obtained by the above different travel flight plans is Calculate access time;

[0033] The waypoint coverage calculation module is configured to respectively obtain the number of waypoint cities C covered by the direct flight route 直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities to get the waypoint coverage;

[0034] The flight density calculation module is configured to: obtain the destination city c, the number of days of the week j (i.e., from Monday to Sunday), the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1), according to the formula Calculate flight density;

[0035] The flight balance calculation module is configured to obtain the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i, the time period evaluation coefficient μ, and the flight distribution degree, i.e., the probability λ of the number of flights on a route being distributed in each time slice, respectively. According to the formula Calculate flight balance.

[0036] The present invention further provides a computer-readable storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the aforementioned aviation accessibility calculation method is implemented.

[0037] Compared with the prior art, the aviation accessibility calculation method, system and storage medium provided by the present invention mainly realize the accessibility calculation needs through four indicators: accessibility time, waypoint coverage, flight density and flight balance. A path algorithm suitable for aviation path calculation and accessibility calculation needs is developed based on dynamic programming, greedy algorithm, forward and reverse Dijkstra algorithm, etc., which effectively makes up for the shortcomings of traditional route calculation methods that cannot calculate the vacancies of single-transfer or double-transfer flight routes and manual calculation is too time-consuming. The server can calculate the optimal accessibility path and accessibility time for a flight season>all waypoints in the country to all waypoints in the country>normal commuting time in a week (6 o'clock to 24 o'clock) within one and a half hours. The amount of calculation result data is close to 7 million. While ensuring the accuracy and effectiveness of the results, the speed is increased by 336 times compared with the exhaustive method (one week), which is much higher than the efficiency of human calculation. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 It is a schematic diagram of the calculation composition of various indicators in the aviation accessibility measurement method according to an embodiment of the present invention.

[0039] Figure 2 It is a schematic diagram comparing the accessibility time of branches, branches and trunks, and trunks from 2017 to 2020 in an embodiment of the present invention.

[0040] Figure 3 It is a schematic diagram of the number and proportion of cities that can be reached on the same day by branch and trunk cities from 2017 to 2020 in an embodiment of the present invention.

[0041] Figure 4 This is a schematic diagram of the distribution and proportion of the top 100 cities in terms of aviation accessibility in each provincial-level administrative region in 2020 in an embodiment of the present invention.

[0042] Figure 5 It is a schematic diagram comparing branch-trunk and branch-branch direct connection waypoints from 2017 to 2020 in an embodiment of the present invention.

[0043] Figure 6 It is a schematic diagram comparing the flight densities of trunk and branch routes from 2017 to 2020 in an embodiment of the present invention. DETAILED DESCRIPTION

[0044] In order to make the technical means, creative features, objectives and effects achieved by the present invention easy to understand, the present invention is further explained below with reference to specific diagrams.

[0045] Please refer to Figure 1 As shown, the present invention provides an aviation accessibility calculation method, including access time calculation, waypoint coverage calculation, flight density calculation and flight balance calculation; wherein,

[0046] The access time refers to the arithmetic mean of the time (including waiting time on the way) required for passengers to arrive at the destination city airport by civil aviation transportation modes such as direct flight, stopover and transfer, departing from the departure city airport at 6:00 (inclusive) to 24:00 (exclusive) every day within 7 days of a week. Generally speaking, the shorter the access time, the better the connectivity of the transportation network and the higher the travel efficiency of passengers. The calculation of the access time includes: confirming the flight status within 24 hours of the departure time, if

[0047] 1) When there is a direct flight (including stopovers) within 24 hours of departure

[0048] From city A to city B, if there is a direct flight between the two places within 24 hours from the departure time, there is usually also a one-stop plan. In this case, it is necessary to filter out all direct plans and one-stop plans between A and B, and perform the calculation according to the following steps:

[0049] 11) Generate a set of direct solutions and a set of one-stop solutions respectively

[0050] According to the formula T 直 = S-t+f Calculate the access time of all direct options within 24 hours from the departure time, and summarize the flight information and access time of these options to generate a direct option set {P 直i}, i = 1, 2, ..., represents the direct plan number; where S is the flight departure time, t is the passenger departure time, and f is the flight time.

[0051] Under the condition that the transfer connection time at the transfer point is not less than the shortest connection time MCT specified by the airport, all transfer plans within 24 hours from the departure time are screened out, and the access time and detour rate of each transfer plan are calculated. The calculation formula for access time is T 一转 =S-t+f1+t1+f2, where f1 is the flight time of the first flight, t1 is the transfer connection time of the two flights (i.e., the take-off time of the second flight minus the landing time of the first flight, which must not be less than the MCT time specified by the transfer airport), and f2 is the flight time of the second flight; the calculation formula for the detour rate is r=(R1+R2) / R, where R1 is the spherical distance between the two places calculated based on the latitude and longitude of the starting point and the transfer point, R2 is the spherical distance between the transfer point and the destination, and R is the spherical distance between the starting point and the destination; the flight information, access time, and detour rate of a transfer plan are summarized to generate a transfer plan set {P 一转j}, j = 1, 2, ..., represents the serial number of a transfer plan.

[0052] 12) Select the best direct route and the best one-stop transfer route respectively

[0053] For direct solutions, it is usually believed that the solution with the shortest arrival time is the best solution. Therefore, for the set of direct solutions {P 直i}, find the solution with the shortest access time as the optimal direct solution, denoted as P 直优 .

[0054] For a transfer plan, if the fastest plan has a high detour rate, it often means longer flight time and higher ticket prices. Therefore, the detour floating time T is introduced. 绕 To indicate that if there is a access time longer than the shortest access time T 绕 If there are one or more transfer plans within , and the detour rate of this or these plans is lower than the detour rate of the plan with the shortest access time, then the transfer plan with the smallest detour rate is identified as the optimal transfer plan. 绕 60 minutes. In terms of steps, first, we start from a set of transfer solutions {P 一转j} to find the shortest transit time and determine the shortest transit time; then select the transit solution from the set of {P 一转j} to find the access time between [the shortest transit access time, the shortest transit access time + T 绕 ], and finally compare the detour rates of these transit plans, and take the transit plan with the smallest detour rate as the optimal transit plan, denoted by P 一转优 , that is, the transfer plan with the smallest detour rate in the transfer plan set is taken as the optimal transfer plan P 一转优 .

[0055] 13) Calculate the optimal access plan and access time

[0056] Considering that under normal circumstances, even if the optimal one-transfer solution has a shorter access time than the optimal direct solution, when the difference between the two is not large, passengers still prefer the direct solution, so the floating waiting time T is set. 浮 To represent the maximum time that passengers are willing to wait for the direct option, and based on a large amount of data analysis, in this embodiment, T 浮 Set to 60 minutes.

[0057] On this basis, the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优 )≤T(P 一转优 )+T 浮 , then the optimal access plan from city A to city B starting at time t is P 直优 , the optimal access time is T(P 直优 ); if T(P直优 )>T(P 一转优 )+T 浮 , then the optimal access plan from city A to city B starting at time t is P 一转优 , the optimal access time is T(P 一转优 ), where T 浮 The floating waiting time is set to 60 minutes; if there is only a direct flight within 24 hours of the departure time, there is no need to output a transfer plan, time, and detour rate. The direct plan with the shortest access time is directly taken as the optimal direct plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time.

[0058] 2) There is only one connecting flight within 24 hours of departure

[0059] If there is no direct flight from city A to city B within 24 hours starting from departure time t, but there is a connecting flight, then refer to the calculation method of the above one-transfer plan and output the one-transfer plan set {P 一转j}、Optimal one-time transfer solution P 一转优 And the optimal access time T(P 一转优 ).

[0060] 3) There is no direct flight or connecting flight within 24 hours of departure

[0061] If there is no direct flight or a connecting flight from city A to city B within 24 hours from the departure time t, then find a secondary connecting flight plan. If there is no secondary connecting flight, the output access time is 72 hours. If there is a secondary connecting flight plan, calculate it according to the following steps:

[0062] 31) Split the two-transfer flight plan into a direct flight (including stopover) + one-transfer plan

[0063] Starting from city A, find out the direct flight routes from city A to points C1, C2, ... C n , and then go directly from city A to point C n Departure (the departure time cannot be earlier than the landing time of the direct flight between AC plus the MCT time of C), find a single transfer plan to city B, and combine the direct flight between AC with the single transfer plan between CB, which is the secondary transfer plan from city A to city B.

[0064] 32) Calculate the access time of all direct solutions between ACs

[0065] According to the formula Calculate AC n The access time betweenAn From city A to city C n Flight departure time between A is the departure time from city A, From city A to city C n Similarly, calculate the flight time from city A to all direct flight points.

[0066] 33) Screen the one-time transfer schemes between CBs to form all the one-time transfer schemes and the corresponding access time

[0067] Using the calculation logic of the above transfer plan, we can use C1, C2, ... n is the starting point, city B is the destination, and flight number AC n The landing time plus the shortest connection time MCT at point C is the departure time t Cn , find C n A transfer plan to city B, according to the formula Calculate C n The access time between B, where S Cn C n The departure time of the first flight of a transfer plan between B and C, f1 is the flight time of the first flight, t 转 is the connecting time between the two flights (i.e. the departure time of the second flight minus the landing time of the first flight, which must not be less than the MCT time specified by the transfer airport), f2 is the flight time of the second flight; C n The flight information and access time of all the one-stop transfer plans between C1, C2, ..., C n All transfer options to city B and the corresponding arrival time.

[0068] 34) Summarize and generate a set of secondary transfer solutions

[0069] Based on AC n Direct solution between n A transfer plan between C n B's first flight takes off at a time far from AC n The time interval between direct flights and landing is not less than the shortest connecting time MCT at point C. All secondary transfer plans are combined and calculated according to the formula T 二转 =T ACn +T CnB +T Cn转 Calculate the access time of each option, summarize the flight information and access time of all secondary transfer options, and generate the time between AB at t A The set of secondary transfer solutions starting at time {P 二转k}, k = 1, 2, ..., represents the sequence number of the secondary transfer plan.

[0070] 35) Calculate the optimal access plan and access time

[0071] It is generally believed that the secondary transfer solution that reaches the destination the fastest is more in line with passenger needs. Therefore, for the secondary transfer solution set {P 二转k}, find the solution with the shortest access time, which is the optimal access solution from A to B and is recorded as P 二转优 , that is, the solution with the shortest access time in the set of secondary transfer solutions is taken as the optimal secondary transfer solution P 二转优 , and the access time T(P 二转优 ) as the optimal access time; if T(P 二转优 )≥72 hours, it is considered that the conditions for air travel are not feasible, the output optimal access plan is empty, and the optimal access time is 72 hours.

[0072] Based on the optimal access time of different travel flight plans calculated through the above steps, the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the jth day of the week at the departure time i at the hour (6:00-23:00) for the destination city c and the day of the week j is obtained. ij That is, the optimal access time obtained by the above different travel flight plans is Calculate the access time; as can be seen from the formula, the key to the access time is to measure the access time from a certain starting point to a destination at a certain point in time, and then repeat the calculation logic according to different time points and destinations to calculate the arithmetic average.

[0073] The waypoint coverage refers to the number of waypoint cities that can be reached and not repeated within a week from the departure city airport through direct flights and stopover civil aviation transportation, that is, the number of connected destination cities, in units. Generally speaking, the more cities are connected, the better the connectivity of the transportation network. The calculation of the number of waypoint cities includes: obtaining the number of waypoint cities C covered by direct flights respectively 直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities.

[0074] The flight density refers to the average daily number of flights that passengers can reach from the city airport of origin by direct flights or stopovers during the 7 days of the week between 6:00 (inclusive) and 24:00 (exclusive) every day. The unit is flights. Generally speaking, the greater the flight density, the more convenient the aviation network is. The flight density calculation includes: obtaining the destination city c, the day of the week j, i.e., from Monday to Sunday, the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1), according to the formula Calculate flight density.

[0075] The flight balance refers to the uniformity of flights that passengers can take off from the departure city airport at the hour between 6:00 (inclusive) and 24:00 (exclusive) every day within 7 days of the week and reach the city airport through direct flights and stopover civil aviation transportation. Generally speaking, the greater the flight balance, the more convenient the passengers' travel. The flight balance calculation includes: obtaining the destination city c, the number of days of the week j, i.e. from Monday to Sunday, the departure time i at the hour, the time period evaluation coefficient μ, and the flight distribution, i.e. the probability λ of the number of flights on a route being distributed in each time slice, according to the formula Calculate the flight balance. Specifically, the flight balance calculation process is divided into the following steps:

[0076] ① Determine the time period evaluation coefficient μ

[0077] Taking 6 hours as the standard, 6:00 to 24:00 in a day is divided into three time periods: 06:00-11:59, 12:00-17:59, and 18:00-23:59, representing morning, noon, and evening respectively; in order to distinguish the distribution of different flights in the morning, noon, and evening, μ is used to represent the flight balance difference, which specifically includes three situations: when the flights of a route are only distributed in 1 time period, μ=1 / 3; when the flights of a route are only distributed in 2 time periods, μ=2 / 3; when the flights of a route are only distributed in 3 time periods, μ=1.

[0078] ② Calculate flight distribution λ

[0079] Taking 30 minutes as the standard, each time period is divided into 12 time slices, and the whole day is divided into 36 time slices. If there are direct flights, stopover flights, etc. in each time slice, it is counted as 1 accessible flight (regardless of how many flights there are in the interval, as long as there are flights, it is counted as 1 accessible flight). When the flights of a route are distributed in only 1 time slice, then λ = 1 / 36; when the flights of a route are distributed in m time slices, then λ = m / 36 (0<m≤36).

[0080] ③Calculate flight balance B

[0081] According to the distribution of flights in 36 time slices within 3 time periods, it is calculated as follows: when the flights between a city pair on a certain day are distributed in only 1 time slice within 1 time period, the flight balance is B = μ×λ = 1 / 3×1 / 36 = 1 / 108; when the flights between a city pair on a certain day are distributed in m time slices within 2 time periods, the flight balance is B = μ×λ = 2 / 3×m / 36 = 2m / 108; ….

[0082] ④Calculate the balance of flights at the origin

[0083] Through the above method, the flight balance of the city pair for 7 days a week is calculated, and the arithmetic average is taken as the flight balance of the city pair; then the above steps are repeated to obtain the flight balance from the starting point to other trunk cities respectively; finally, the arithmetic average is taken to obtain the flight balance from the starting point to all trunk cities.

[0084] As a specific embodiment, Figures 2 to 6 The accessibility comparison data between 197 cities where 194 transport airports are located in my country are displayed, mainly including the comparison of four indicators: access time, route coverage, flight density, and flight balance. The data in the chart are all realized through the calculation rules, logic and technical algorithms of the present invention, and the data of multiple cities, different flight seasons, different routes, different indicators, etc. are quickly calculated to obtain the final comparison results.

[0085] The present invention also provides an aviation accessibility calculation system, including an accessibility time calculation module, a waypoint coverage calculation module, a flight density calculation module and a flight balance calculation module; wherein,

[0086] The access time calculation module is configured to: confirm the flight status within 24 hours of the departure time, if

[0087] If there is a direct flight (including stopover) within 24 hours of the departure time, a set of direct solutions and a set of one-transfer solutions are generated respectively, and the direct solution with the shortest access time in the direct solution set is taken as the optimal direct solution P. 直优 , the access time in the transfer solution set is between [the shortest transfer access time, the shortest transfer access time + T 绕 The optimal one-time transfer plan P is the one with a detour rate lower than the shortest access time and the smallest detour rate. 一转优 , compare the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优 )≤T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 直优, the optimal access time is T(P 直优 ), where T 浮 is the floating waiting time; if T(P 直优 )>T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 一转优 , the optimal access time is T(P 一转优 ); If there is only a direct flight within 24 hours of the departure time, the direct flight with the shortest access time is directly selected as the optimal direct flight plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time;

[0088] If there is only one connecting flight within 24 hours of the departure time, refer to the calculation method of the above one-transfer plan to output the one-transfer plan set and the optimal one-transfer plan P 一转优 And the optimal access time T(P 一转优 );

[0089] If there is no direct flight or one-stop flight within 24 hours of the departure time, then find a two-stop flight plan. If there is no two-stop flight, the output access time is 72 hours. If there is a two-stop flight plan, first decompose the two-stop flight plan into a direct flight (including stopover) + one-stop plan, then calculate the access time of all direct plans, then form all one-stop plans and the corresponding passing time, and then summarize and generate a set of two-stop plans. Finally, the plan with the shortest access time in the set of two-stop plans is taken as the optimal two-stop plan P 二转优 The access time of this scheme is taken as the optimal access time T(P 二转优 );as well as

[0090] Get the destination city c, the day of the week j, that is, from Monday to Sunday, the departure time point i at the hour (6:00-23:00), and the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the j-th day of the week ij That is, the optimal access time obtained by the above different travel flight plans is Calculate access time;

[0091] The waypoint coverage calculation module is configured to respectively obtain the number of waypoint cities C covered by the direct flight route 直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities to get the waypoint coverage;

[0092] The flight density calculation module is configured to: obtain the destination city c, the number of days of the week j (i.e., from Monday to Sunday), the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1), according to the formula Calculate flight density;

[0093] The flight balance calculation module is configured to obtain the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i, the time period evaluation coefficient μ, and the flight distribution degree, i.e., the probability λ of the number of flights on a route being distributed in each time slice, respectively. According to the formula Calculate flight balance.

[0094] The present invention further provides a computer-readable storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the aforementioned aviation accessibility calculation method is implemented.

[0095] Compared with the prior art, the aviation accessibility calculation method, system and storage medium provided by the present invention mainly realize the accessibility calculation needs through four indicators: accessibility time, waypoint coverage, flight density and flight balance. A path algorithm suitable for aviation path calculation and accessibility calculation needs is developed based on dynamic programming, greedy algorithm, forward and reverse Dijkstra algorithm, etc., which effectively makes up for the shortcomings of traditional route calculation methods that cannot calculate the vacancies of single-transfer or double-transfer flight routes and manual calculation is too time-consuming. The server can calculate the optimal accessibility path and accessibility time for a flight season>all waypoints in the country to all waypoints in the country>normal commuting time in a week (6 o'clock to 24 o'clock) within one and a half hours. The amount of calculation result data is close to 7 million. While ensuring the accuracy and effectiveness of the results, the speed is increased by 336 times compared with the exhaustive method (one week), which is much higher than the efficiency of human calculation.

[0096] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solution of the present invention, which should be included in the scope of the claims of the present invention.

Claims

1. A method for calculating aviation accessibility, characterized in that: Including calculation of access time, waypoint coverage, flight density and flight balance; among them, The calculation of the access time includes: confirming the flight situation within 24 hours of the departure time, If there are direct or stopover flights within 24 hours of the departure time, a set of direct solutions and a set of one-stop solutions are generated respectively, and the direct solution with the shortest access time in the direct solution set is taken as the optimal direct solution P 直优 , the access time in the transfer solution set is in the time interval [the shortest transfer access time, the shortest transfer access time + T 绕 The optimal transfer plan P is the one with the smallest detour rate and lower detour rate than the shortest transit time. 一转优 , compare the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优 )≤T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 直优 , the optimal access time is T(P 直优 ), where T 浮 is the floating waiting time; if T(P 直优 )>T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 一转优 , the optimal access time is T(P 一转优 ); If there is only a direct flight within 24 hours of the departure time, the direct flight with the shortest access time is directly selected as the optimal direct flight plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time; If there is only one connecting flight within 24 hours of the departure time, refer to the calculation method of the above one-transfer plan to output the one-transfer plan set and the optimal one-transfer plan P 一转优 And the optimal access time T(P 一转优 ); If there is no direct flight or one-stop flight within 24 hours of the departure time, then find a two-stop flight plan. If there is no two-stop flight, the output access time is 72 hours. If there is a two-stop flight plan, first decompose the two-stop flight plan into a direct or stopover + one-stop plan, then calculate the access time of all direct plans, then form all one-stop plans and their corresponding access times, and then summarize them to generate a set of two-stop plans. Finally, the plan with the shortest access time in the set of two-stop plans is taken as the optimal two-stop plan P 二转优 The access time of this scheme is taken as the optimal access time T(P 二转优 ) and respectively obtain the destination city c, the day of the week j represents any day from Monday to Sunday, the departure time point i at the hour, and the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the j-th day of the week ij That is, the optimal access time obtained by the above different travel flight plans is Calculate access time; The waypoint coverage refers to the number of waypoint cities that can be reached and are not repeated within a week from the departure city airport through direct flights and stopover civil aviation transportation modes, that is, the number of connected destination cities. The calculation of the number of waypoint cities includes: obtaining the number of waypoint cities C covered by direct flights respectively 直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities; The flight density calculation includes: obtaining the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1) respectively. h , according to the formula Calculate flight density; The flight balance calculation includes: obtaining the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i, and the time period evaluation coefficient μ respectively. c The flight distribution refers to the probability λ of the number of flights on a route being distributed in each time slice. c , according to the formula Calculate flight balance; Specifically, the flight conditions within 24 hours of the confirmed departure time, if there are direct or stopover flights within 24 hours of the departure time, include: According to the formula T 直 = S-t+f calculates the access time of all direct options within 24 hours from the departure time, and summarizes the flight information and access time of these options to generate a set of direct options; where S is the flight departure time, t is the passenger departure time, and f is the flight time; Under the condition that the transfer connection time at the transfer point is not less than the shortest connection time MCT specified by the airport, all transfer plans within 24 hours from the departure time are screened out, and the access time and detour rate of each transfer plan are calculated. The calculation formula for access time is T 一转 =S-t+f1+t1+f2, where f1 is the flight time of the first flight, t1 is the transfer connection time between the two flights, and f2 is the flight time of the second flight; the formula for calculating the detour rate is r=(R1+R2) / R, where R1 is the spherical distance between the two places calculated based on the latitude and longitude of the starting point and the transfer point, R2 is the spherical distance between the transfer point and the destination, and R is the spherical distance between the starting point and the destination; the flight information, access time, and detour rate of a transfer plan are summarized to generate a transfer plan set; From the set of direct solutions, find the solution with the shortest access time as the optimal direct solution, denoted as P 直优 ; From the set of one-time transfer solutions, first find the one-time transfer solution with the shortest access time and determine the shortest one-time transfer access time; secondly, from the set of one-time transfer solutions, find the one-time transfer solution with the access time in the time interval [shortest one-time transfer access time, shortest one-time transfer access time + T 绕 ], and finally compare the detour rates of these transit plans, and take the transit plan with the smallest detour rate as the optimal transit plan, denoted by P 一转优 .

2. The aviation accessibility calculation method according to claim 1, characterized in that: The T 绕 and T 浮 It is set to 60 minutes.

3. The aviation accessibility calculation method according to claim 1, characterized in that: The confirmed flight situation within 24 hours of departure time, if there is no direct flight or one connecting flight within 24 hours of departure time, if there is a two connecting flight plan, it includes: According to the direct routes in the flight information, find out the direct flight points C1, C2, ... C from city A. n , and then go directly from city A to point C n Start from A, find a single transfer plan to city B, combine the direct route between AC and the single transfer plan between CB, and you will get the double transfer plan from city A to city B. According to the formula Calculate AC n The access time between An From city A to city C n Flight departure time between A is the departure time from city A, From city A to city C n Similarly, calculate the flight time from city A to all direct flight points; C1, C2...C n is the starting point, city B is the destination, and flight number AC n The landing time plus the shortest connection time MCT at point C is the departure time t Cn , find C n A transfer plan to city B, according to the formula Calculate C n The access time between B, where S Cn C n The departure time of the first flight of a transfer plan between B and C, f1 is the flight time of the first flight, t 转 is the connecting time between the two flights, f2 is the flight time of the second flight; n The flight information and access time of all the one-stop transfer plans between C1, C2, ..., C n All the one-stop transfer options to City B and the corresponding access time; Based on AC n Direct solution between n A transfer plan between C n B's first flight takes off at a time far from AC n The time interval between direct flights and landing is not less than the shortest connecting time MCT at point C. All secondary transfer plans are combined and calculated according to the formula T 二转 =T ACn +T CnB +T Cn转 Calculate the access time of each option, summarize the flight information and access time of all secondary transfer options, and generate the time between AB at t A A collection of secondary transfer options starting at a certain time; For the set of secondary transfer solutions, find the solution with the shortest access time as the optimal access solution from A to B, denoted as P 二转优 , and the access time T(P 二转优 ) as the optimal access time; if T(P 二转优 )≥72 hours, it is considered that the conditions for air travel are not feasible, the output optimal access plan is empty, and the optimal access time is 72 hours.

4. An aviation accessibility calculation system, characterized in that: It includes the access time calculation module, the waypoint coverage calculation module, the flight density calculation module and the flight balance calculation module; among them, The access time calculation module is configured to: confirm the flight status within 24 hours of the departure time, If there are direct or stopover flights within 24 hours of the departure time, a set of direct solutions and a set of one-stop solutions are generated respectively, and the direct solution with the shortest access time in the direct solution set is taken as the optimal direct solution P 直优 , the access time in the transfer solution set is in the time interval [the shortest transfer access time, the shortest transfer access time + T 绕 The optimal one-time transfer plan P is the one with a detour rate lower than the shortest access time and the smallest detour rate. 一转优 , compare the access time T(P 直优 ) and the access time T(P 一转优 ), if T(P 直优 )≤T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 直优 , the optimal access time is T(P 直优 ), where T 浮 is the floating waiting time; if T(P 直优 )>T(P 一转优 )+T 浮 , then the optimal access plan generated at this time point is P 一转优 , the optimal access time is T(P 一转优 ); If there is only a direct flight within 24 hours of the departure time, the direct flight with the shortest access time is directly selected as the optimal direct flight plan P at that time. 直优 and calculate the access time T(P 直优 ) as the optimal access time; If there is only one connecting flight within 24 hours of the departure time, refer to the calculation method of the above one-transfer plan to output the one-transfer plan set and the optimal one-transfer plan P 一转优 And the optimal access time T(P 一转优 ); If there is no direct flight or one-stop flight within 24 hours of the departure time, then find a two-stop flight plan. If there is no two-stop flight, the output access time is 72 hours. If there is a two-stop flight plan, first decompose the two-stop flight plan into a direct or stopover + one-stop plan, then calculate the access time of all direct plans, then form all one-stop plans and the corresponding passing time, and then summarize to generate a set of two-stop plans, and finally take the plan with the shortest access time in the set of two-stop plans as the optimal two-stop plan P 二转优 The access time of this scheme is taken as the optimal access time T(P 二转优 ) and respectively obtain the destination city c, the day of the week j represents any day from Monday to Sunday, the departure time point i at the hour, and the optimal time t required to reach the destination city by direct, stopover, or transfer from the i-th point on the j-th day of the week ij That is, the optimal access time obtained by the above different travel flight plans is Calculate access time; The waypoint coverage calculation module is configured to respectively obtain the number of waypoint cities C covered by the direct flight route. 直飞 , the number of cities covered by the stopover route C 经停 According to the formula C = ∑(C 直飞 +C 经停 ) Calculate the number of waypoint cities to get the waypoint coverage; The flight density calculation module is configured to obtain the destination city c, the day of the week j, i.e., from Monday to Sunday, the departure time i, the starting point h of the time interval, and the number of flights f in the time interval [h, h+1). h , according to the formula Calculate flight density; The flight balance calculation module is configured to obtain the destination city c, the number of days of the week j, i.e., from Monday to Sunday, the departure time i, and the time period evaluation coefficient μ respectively. c The flight distribution refers to the probability λ of the number of flights on a route being distributed in each time slice. c , according to the formula Calculate flight balance; Specifically, the flight conditions within 24 hours of the confirmed departure time, if there are direct or stopover flights within 24 hours of the departure time, include: According to the formula T 直 = S-t+f calculates the access time of all direct options within 24 hours from the departure time, and summarizes the flight information and access time of these options to generate a set of direct options; where S is the flight departure time, t is the passenger departure time, and f is the flight time; Under the condition that the transfer connection time at the transfer point is not less than the shortest connection time MCT specified by the airport, all transfer plans within 24 hours from the departure time are screened out, and the access time and detour rate of each transfer plan are calculated. The calculation formula for access time is T 一转 =S-t+f1+t1+f2, where f1 is the flight time of the first flight, t1 is the transfer connection time between the two flights, and f2 is the flight time of the second flight; the formula for calculating the detour rate is r=(R1+R2) / R, where R1 is the spherical distance between the two places calculated based on the latitude and longitude of the starting point and the transfer point, R2 is the spherical distance between the transfer point and the destination, and R is the spherical distance between the starting point and the destination; the flight information, access time, and detour rate of a transfer plan are summarized to generate a transfer plan set; From the set of direct solutions, find the solution with the shortest access time as the optimal direct solution, denoted as P 直优 ; From the set of one-time transfer solutions, first find the one-time transfer solution with the shortest access time and determine the shortest one-time transfer access time; secondly, from the set of one-time transfer solutions, find the one-time transfer solution with the access time in the time interval [shortest one-time transfer access time, shortest one-time transfer access time + T 绕 ], and finally compare the detour rates of these transit plans, and take the transit plan with the smallest detour rate as the optimal transit plan, denoted by P 一转优 .

5. A computer-readable storage medium, wherein a computer program is stored in the storage medium, characterized in that: When the computer program is executed by a processor, the aviation accessibility calculation method according to any one of claims 1 to 4 is implemented.

Images