Airline network cascade failure processing method and device, equipment and medium

Abstract

The invention relates to an airline network cascade failure processing method, device, equipment and medium, and the method comprises the steps: selecting an alternative airport for a failed airport, then updating the flight time of each connected flight based on the alternative airport, and if it is determined that the alternative airport is in a failure state at the updated flight time, executing the next step; and adding the alternative airport into the current invalid airport information set. Besides, the airport load of the airport corresponding to the downstream flight is updated according to the flight time in the connection flight, and the airport in the failure state and the corresponding failure time are added into the current failure airport information set based on the updated airport load. The airport load in the airline network is adjusted in real time at each calculation moment, and then adjustment of a subsequent algorithm strategy is triggered, so that it can be ensured that optimal flight arrangement can be achieved at each moment, stable operation of the airline network in different time periods is ensured, and survivability of the whole airline network is improved.

Description

Technical Field

[0001] The present invention relates to the field of route network cascading failure processing, and in particular to a route network cascading failure processing method, device, equipment and medium. Background Art

[0002] With the rapid development of the global civil aviation industry, the number of airports and flights is increasing, and the route network structure is becoming increasingly complex. When faced with deliberate sabotage, key equipment failure, natural disasters, extreme weather, etc., an airport may be unavailable for a period of time, which is called airport failure. As time goes by, the airports connected to it in the route network will also be affected, resulting in a series of airport congestion or even failure, which will eventually affect the normal transportation function of the entire route network. This phenomenon is called route network cascading failure. In order to effectively alleviate the negative impact of route network cascading failure, it is particularly important to conduct resilience assessment of the route network and explore ways to enhance its resilience.

[0003] For flights already in the air, if their destination airport fails, the first task is to choose an alternate airport. The cost of flight diversion is very high. In order to ensure safety, multiple factors need to be considered, including the distance of the alternate airport from the original destination airport, the remaining fuel, weather conditions, ground support, and the remaining capacity of the alternate airport. In most cases, airports that are closer will be the first choice. For example, on the evening of September 11, 2024, Tianjin Binhai International Airport was suspected of being interfered by drones, resulting in a large number of inbound and outbound flights being unable to take off and land. Beijing Daxing Airport became the preferred alternate airport. However, this approach will cause two problems: The first problem is that Tianjin Binhai Airport and Beijing Daxing Airport are too close to each other and there is no route connection, that is, there is no connecting edge in the route network. However, passengers arriving at Beijing Daxing will eventually return to Tianjin. If the routes in the existing route network are used again for passenger evacuation, they will inevitably fly a long way, greatly increasing unnecessary transportation costs. This is obviously not a reasonable solution. In other words, the existing route network can only represent the flight route when the flight is operating normally, ignoring the relationship between the alternate airport and the destination airport in an emergency. The second problem is that although Beijing Daxing Airport has a large capacity, it cannot carry foreign flights without restrictions, otherwise it will inevitably affect the normal takeoff and landing of flights in its schedule, thereby aggravating the scope of the cascading failure. Therefore, after a flight decides to make an alternate landing, it is necessary to pay close attention to the load changes of its target alternate airport in order to make the best choice.

[0004] Regarding the first question mentioned above, in today's era of mass transportation, although there are no air routes between adjacent airports, passengers can be evacuated through various means such as high-speed rail, subway, bus, taxi, etc., forming a group of adjacent airports interconnected by ground transportation. By adding these connecting edges to the existing route network, an extended route network that integrates the ground transportation of adjacent airport groups can be formed. This approach helps to quickly redistribute the load of failed airports nearby, effectively alleviate the cascading failure of the route network, and enhance the resilience of the route network. For example, in the above problem, when a flight to Tianjin Binhai Airport chooses Beijing Daxing Airport as an alternate landing, passengers can be assigned to Tianjin through various ground transportation methods, which not only minimizes transportation costs, but also takes into account the passengers' travel intentions, and better solves the problem of stranded passengers.

[0005] For the second question, after the diversion occurs, the original route of the aircraft changes, and the flight's take-off time, arrival time, and airport load information may change over time, thereby affecting the load of downstream flights and airports. Therefore, the airport load of the route network is time-varying. To effectively deal with the cascading failure of the route network, the time-varying nature of the airport load and the load distribution strategy must be considered to improve the anti-destruction capability of the route network. Figure 1 As shown, A, B, C, D are airports, f1, f2, f3 are consecutive flights from airport A to airport D, tof1, tof2, tof3 are the flight times of consecutive flights f1, f2, f3 respectively. Figure 1 The flight times of the flights to work are 143 minutes, 151 minutes, and 90 minutes respectively, and the stopover time is 45 minutes. Figure 1 The flight times for the second half of the flights were 188min, 157min, and 95min. Figure 1 The upper part is the original flight operation plan, and the lower part is the adjusted flight operation plan after Airport B was closed due to deteriorating weather conditions. In order to ensure the safety of passengers and the smooth progress of flights, the airline decided to reschedule the landing airport of flight f1 and the departure airport of flight f2 related to Airport B to Airport E adjacent to Airport B. This move caused the passengers who were originally waiting for the subsequent flight f2 at Airport B to extend their waiting time and transfer to Airport E. This change will cause the adjustment of the flight schedule, thereby affecting the load and operation of downstream flights and airports. Therefore, the time-varying nature of airport load is an important factor that needs to be considered in the problem of cascading failure of route networks. Summary of the invention

[0006] In view of the above technical problems, the technical solution adopted by the present invention is:

[0007] According to a first aspect of the present invention, a method for handling cascading failures in a route network is provided, the method comprising the following steps:

[0008] S100, at the current calculation time, if the current invalid airport information set IS is not empty, obtain the invalid airport information that needs to be processed based on IS, and obtain the invalid airport A corresponding to the invalid airport information that needs to be processed c In the route set M after the corresponding expiration time; set the route count variable j = 1; where IS = {S i} i＝1，……，n , S i is the i-th invalid airport information in IS, S i =(U i , T.I. i ), U i is the i-th invalid airport A i ID,TI i A i The failure time, n is the number of failed airports in IS, M = {m j} j＝1，……，g , m j is the jth route of the current invalid airport after the corresponding invalid time, g is the number of routes in M, A c Belong to {A i} i＝1，……，n .

[0009] S200, if j≤g, execute S300, otherwise, execute S100.

[0010] S300, for m j , get m j With A c Associated connecting flightsf j =(f j P , f j n ), where f j P =(o j P , d j P , t1 j P , t2 j P ), o j P For flight f j P Departure airport, d j P For flight f j P Arrival airport, t1 j P For flight f j PTake-off time, t2 j P For flight f j P The arrival time, f j n =(o j n , d j n , t1 j n , t2 j n ), o j n For flight f j n Departure airport, d j n For flight f j n Arrival airport, t1 j n For flight f j n Take-off time, t2 j n For flight f j n The arrival time, d j P =o j n =A c .

[0011] S400, from A c AAS c Get A c Alternative airports for AA c target , AA c target As flight j P Arrival airport and AA c target As flight j n The departure airport and obtain f j P Arrive at AA c target Arrival time t2 Ph j and f j n From AA c target Take-off time t1 j nh .

[0012] S500, confirm AA c target At t2 Ph j Is it in an invalid state? If so, c target and t2 Ph j Join IS and confirm AA c target At t1 j nh Is it in an invalid state? If so, c target and t1 j nh Join IS.

[0013] S600, based on t2 Ph j and t1 j nh , for connecting flights j The take-off time and arrival time of the downstream flight are updated, and based on the updated take-off time and arrival time of the downstream flight, the airport load of the corresponding airport of the downstream flight is updated, and based on the updated airport load, it is determined whether the airport corresponding to the downstream flight is in an invalid state, and if so, the corresponding airport and the corresponding invalid time are added to IS; set j=j+1, and execute S200.

[0014] According to a second aspect of the present invention, there is provided a route network cascading failure processing device, comprising:

[0015] The first processing module is used to obtain the invalid airport information that needs to be processed at the current calculation moment, if the current invalid airport information set is not empty, and obtain the route set of the invalid airport corresponding to the invalid airport information that needs to be processed after the corresponding expiration time.

[0016] The first acquisition module is used to acquire the connecting flights associated with the invalid airport currently to be processed in each route in the route set.

[0017] The second acquisition module is used to obtain alternative airports of the invalid airport that currently needs to be processed from the set of neighboring airports of the invalid airport that currently needs to be processed, and use them as the arrival airports of the upstream flights and the departure airports of the downstream flights in the connecting flights of each route, and obtain the arrival time of the upstream flights in the connecting flights at the target neighboring airport and the departure time of the downstream flights from the target neighboring airport.

[0018] The second processing module is used to determine whether the target adjacent airport is in an invalid state when the upstream flight in the connecting flight arrives and when the downstream flight in the connecting flight takes off. If yes, the target adjacent airport is added to the current invalid airport information set.

[0019] The third processing module is used to update the take-off time and arrival time of the downstream flight of the connecting flight according to the arrival time of the upstream flight in the connecting flight at the target adjacent airport and the take-off time of the downstream flight from the target adjacent airport, and update the airport load of the corresponding airport of the downstream flight based on the updated take-off time and arrival time of the downstream flight, and determine whether the airport corresponding to the downstream flight is in an invalid state based on the updated airport load, and if so, add the corresponding airport and the corresponding expiration time to the current invalid airport information set.

[0020] According to a third aspect of the present invention, there is provided an electronic device comprising a processor and a memory; the processor is used to execute the steps of the method described in the first aspect of the present invention by calling a program or instruction stored in the memory.

[0021] According to a fourth aspect of the present invention, there is provided a non-transitory computer-readable storage medium storing a program or instructions, wherein the program or instructions enable a computer to execute the steps of the method described in the first aspect of the present invention.

[0022] The present invention has at least the following beneficial effects:

[0023] A method for processing cascading failure of a route network provided by an embodiment of the present invention, for a currently failed airport to be processed, firstly, a target airport is selected for the failed airport as an alternative airport for a connecting flight that uses the failed airport as a transit airport, then, based on the selected alternative airport, the flight time of each connecting flight is updated, and it is determined whether the alternative airport is in a failed state when the upstream flight in the connecting flight arrives and when the downstream flight in the connecting flight takes off, if so, the alternative airport is added to the current failed airport information set. In addition, the flight time of the downstream flight of the connecting flight is updated according to the flight time in the connecting flight, and the airport load of the corresponding airport of the downstream flight is updated based on the updated flight time of the downstream flight, and it is determined whether the airport corresponding to the downstream flight is in a failed state based on the updated airport load, if so, the corresponding airport and the corresponding failure time are added to the current failed airport information set. Since the airport load in the route network is adjusted in real time at each calculation moment, the subsequent algorithm strategy adjustment will be triggered, so that the optimal flight arrangement can be achieved at each moment, the stable operation of the route network in different time periods can be ensured, and the anti-destruction performance of the overall route network can be improved.

[0024] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0026] Figure 1 A schematic diagram of route network operation adjustment provided by an embodiment of the present invention;

[0027] Figure 2 A flowchart of a method for handling cascading failures of a route network provided by an embodiment of the present invention;

[0028] Figure 3a A schematic diagram of a group of adjacent airports provided by an embodiment of the present invention;

[0029] Figure 3b A schematic diagram of a virtual flight provided by an embodiment of the present invention;

[0030] Figure 4 A schematic diagram of different passengers and corresponding travel times provided by an embodiment of the present invention;

[0031] Figure 5 A schematic diagram of airport failure provided by an embodiment of the present invention;

[0032] Figure 6 A schematic diagram of selecting an alternative airport provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0033] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0034] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more related listed items.

[0035] It should be noted that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but it can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0036] The embodiment of the present invention provides a method for processing cascading failure of a route network. Figure 2 As shown, the method may include the following steps:

[0037] S100, at the current calculation time, if the current invalid airport information set IS is not empty, obtain the invalid airport information that needs to be processed based on IS, and obtain the invalid airport A corresponding to the invalid airport information that needs to be processed c In the route set M after the corresponding expiration time; set the route count variable j = 1; where IS = {S i} i＝1，……，n , S i is the i-th invalid airport information in IS, S i =(U i , T.I. i ), U i is the i-th invalid airport A i ID,TI i A i The failure time, n is the number of failed airports in IS, M = {m j} j＝1，……，g , m j is the jth route of the current invalid airport after the corresponding invalid time, g is the number of routes in M, A c Belong to {A i} i＝1，……，n .

[0038] In the embodiment of the present invention, the interval between two adjacent calculation moments can be set based on actual needs, for example, can be set to a few seconds. In the embodiment of the present invention, the calculation process can be performed in a set time period every day, for example, from 6:00 am to 12:00 pm every day.

[0039] In the embodiment of the present invention, the invalid airport may be an airport that is unavailable in a set route network for a period of time. In the embodiment of the present invention, the set route network may be a route network consisting of several airports specified by the user. The route may be formed by a series of connected flights performed by the same aircraft.

[0040] In the embodiment of the present invention, the failed airports in the current failed airport information set are the failed airports in the current corresponding set time period, such as the failed airports in the morning from 6:00 to the evening of the corresponding date, which may include failed airports that are unavailable due to sudden reasons and failed airports generated by allocating airport loads to the processed failed airports at each calculation moment. The first failed airport in the current failed airport set is the failed airport that is unavailable due to sudden reasons.

[0041] S200, if j≤g, execute S300, otherwise, execute S100.

[0042] S300, for m j , get m j With A c Associated connecting flightsf j =(f j P , f j n ), where f j P =(o j P , d j P , t1 j P , t2 j P ), o j P For flight f j P Departure airport, d j P For flight f j P Arrival airport, t1 j P For flight f j P Take-off time, t2 j P For flight f j P The arrival time, f j n =(o j n , d j n , t1 j n , t2 j n ), o j n For flight f j n Departure airport, d j nFor flight f j n Arrival airport, t1 j n For flight f j n Take-off time, t2 j n For flight f j n The arrival time, d j P =o j n =A c .

[0043] S400, from A c AAS c Get A c Alternative airports for AA c target , AA c target As flight j P Arrival airport and AA c target As flight j n The departure airport and obtain f j P Arrive at AA c target Arrival time t2 Ph j and f j n From AA c target Take-off time t1 j nh .

[0044] In the embodiment of the present invention, AAS c Meet the following conditions: AA c It includes first-category airports and second-category airports, among which first-category airports are those related to A c Airports with direct flights between c Airports that can be reached by flight between the two countries. The second category airports are those with A c Airports that do not have direct flights but where ground transportation time is less than the set time.

[0045] In the embodiment of the present invention, for the second type of airport, a virtual flight can be created for the invalid airport and the second type of airport. In the embodiment of the present invention, a virtual flight FV is defined as: uv} v＝1，……，W , F uv For airportu To nearby airports uv The set of all possible flights, w is the airport a u The number of neighboring airports. uv ={(a u , a uv , t1 uvq , t2 uvq )} q＝1，……，Y , t1 uvq F uv The departure time of the qth flight in t2 uvq F uv The arrival time of the qth flight in F uv The number of flights. t2 uvq =t1 uvq +tof uv ,tof uv For airport u and nearby airports uv Ground transportation time between t1 and t2. uvq Belongs to the time set T.

[0046] In the embodiment of the present invention, the transportation process of the virtual flight is discretized to simulate the flight transportation process starting from 6 am, taking off every half an hour until 12 pm. The arrival time of the flight is obtained by adding the take-off time and the estimated driving time, and a virtual flight is created between adjacent airports. Therefore, t1 uvq It is taken from the time set T = {06:00, 06:30, 07:00, ..., 23:30}, indicating that every 30 minutes is a time point.

[0047] Figure 3a Shows a route from airport a1 to a 11 The dotted lines represent adjacent airport pairs, indicating the potential for virtual flight connections between them. In this network:

[0048] The set of neighboring airports of a1 includes a2 to a6, which means that virtual flight connections can be established between a1 and these airports. For example, the set of virtual flights between a1 and a3 is represented as F 13 .like Figure 3b As shown, it represents F 13 The same principle applies to the virtual flight sets between a1 and other neighboring airports.

[0049] The adjacent airports of a7 include a3, and a8 to a 11 , indicating that virtual flight connections can be created between a7 and these airports. For example, the set of virtual flights between a7 and a8 is represented as F 78, the set of virtual flights between a7 and other adjacent airports is similar.

[0050] In the embodiment of the present invention, the set time can be set based on actual needs. In an exemplary embodiment, the set time can be set to 2 hours. In the embodiment of the present invention, ground transportation can include ground transportation modes such as subway, high-speed rail, and self-driving.

[0051] In the embodiment of the present invention, the second-category airport aims to expand the selection of neighboring airports in failure scenarios, thereby increasing the selection space of neighboring airports, and improving the anti-destruction capability of the route network in response to cascading failures. At the same time, the second-category airport can transport passengers to the original destination through ground transportation, fully considering the passengers' travel intentions while solving the problem of passengers being stranded at non-destination airports to the greatest extent. In the embodiment of the present invention, the selection of alternative airports follows the following principles:

[0052] (1) Principle of limited selection of surplus airports: Flights are allocated to alternative airports with surplus capacity first to ensure smooth scheduling and operation of flights. The surplus is the airport capacity minus the airport load, i.e. the airport's surplus capacity.

[0053] (2) Minimum time cost path principle: select alternative airports based on flight path cost. The path cost usually includes the flight time from the departure airport to the alternative airport, the flight time from the alternative airport to the destination airport, and the sum of twice the flight time from the alternative airport to the failed airport. The alternative airport with the smallest path cost is selected as the best choice to deal with flight scheduling and operation efficiency.

[0054] In order to find a reasonable alternative itinerary for passengers in the event of an airport failure, the present invention defines the travel time as the total travel time for passengers to take a pair of connecting flights via a new airport after the original stopover airport fails, that is, the sum of the flight time from the departure airport to the alternative airport, the flight time from the alternative airport to the destination airport, and the flight time from the alternative airport to the failed airport. Figure 4As shown in the figure, a1 to a4 are airports, f1 and f2 are connecting flights. When airport a2 fails, the alternative airport is a4. It is assumed that the flight time between a1 and a4 is tof1, the flight time between a4 and a3 is tof2, and the ground transportation time between a4 and a2 is tof3. Considering that in the connecting flights, passengers have different destinations, there are three cases at this time. If the passenger's starting and destination airports are a1 to a2, which is a first-class passenger, his travel time is tof1+tof3, and he is sent to the original destination; if the passenger's starting and destination airports are a2 to a3, which is a second-class passenger, his travel time is tof3+tof2; if the passenger's starting and destination airports are a1 to a3, which is a third-class passenger, his travel time is tof1+tof2+2tof3. In particular, if 2tof is less than the transfer time at a4, the travel time is tof1+tof2+transfer time.

[0055] (3) Default allocation principle: If there is no available airport with spare capacity, the flight will be allocated to the alternative airport with the shortest flight time to minimize flight delays and flight costs.

[0056] Furthermore, AA c target Obtained through the following steps:

[0057] S401, set the neighboring airport counter k=1.

[0058] S402, if k≤Q, execute S403, otherwise, execute S404; Q is AAS c The number of neighboring airports in

[0059] S403, for AAS c The kth neighboring airport AA c k , judge AA c k Is there any remaining capacity at the airport in the unit time period corresponding to the current calculation time? If yes, AA c k Add it to the current set of intermediate candidate airports, set k=k+1, and execute S402; if it does not exist, set k=k+1, and execute S402; the initial value of the current set of intermediate candidate airports is empty.

[0060] In the embodiment of the present invention, the duration of the unit time period can be set based on actual needs. In an exemplary embodiment, the duration of the unit time period can be 1 hour. If the current calculation time is 11:05, the corresponding unit time period is 11:00 to 12:00.

[0061] In the embodiment of the present invention, the airport residual capacity of the airport in a certain unit time period d is equal to the difference between the airport capacity and the airport load in the unit time period.

[0062] In the embodiment of the present invention, the airport load of a unit time period d is the difference between the number of inbound flights and the number of outbound flights of the airport in the time period. The airport capacity in each unit time period may be the number of flight slots that the airport can actually accommodate, which may be determined based on the actual situation of the airport.

[0063] S404: If the current intermediate candidate airport set is not empty, execute S405; if it is empty, execute S407.

[0064] S405, traverse the current set of intermediate candidate airports and obtain the hth intermediate airport AAM in the current set of intermediate candidate airports c h Corresponding travel time TM c h , and obtain the travel time set TM corresponding to the current set of intermediate candidate airports = {TM c h} h＝1，……，X ,TM c h =tof1 c h +tof2 c h +max(2tof3 c h , t c h ), where tof1 c h for o j P To AAM c h Travel time, tof2 c h For AAM c h to d j n Travel time, tof3 c h A c and AAM c h The travel time between them, X is the number of intermediate airports in the current set of intermediate alternative airports; max() means taking the maximum value, t c h is the transit time of the hth intermediate airport, which can be determined based on actual conditions; execute S406. S406, obtain the airport corresponding to min(TM) as AA ctarget ; min() means taking the minimum value.

[0065] S407, traversal of AAS c , get AA c k The corresponding travel time T c k , get AAS c The corresponding travel time set T c ={T c k} k＝1，……，Q , T c k =tof1 c k +tof2 c k +max(2tof3 c k , t c h ), where tof1 c k for o j P To AA c k Travel time, tof2 c k AA c k to d j n Travel time, tof3 c k A c and AA c k Execute S408.

[0066] S408, obtain min(T c ) corresponds to the airport as AA c target .

[0067] like Figure 5 As shown, a1 to a6 are airports, f1 and f2 are connecting flights, L i t is the load of airport i at time t, C i tis the capacity of airport i at time t. When airport a2 fails, first find the airports that have direct flights to the failed airport, which are a5, a6 and a4, and then determine whether there is a surplus at these three airports. After satisfying the requirements, find an airport with a short total passenger travel time. Assume that the flight time between a1 and the alternative airport is tof1, the flight time between the alternative airport and a3 is tof2, and the travel time between the alternative airport and the failed airport a2 is tof3. Select airport a6 that satisfies min(tof1+tof2+2tof3) as the alternative airport. After allocating the flight to the alternative airport a6, the passengers of flight f1 can be sent to the city where the original destination airport (i.e. the failed airport) is located by ground transportation, and the passengers of flight f2 can be sent to airport a6 by ground transportation for take-off. This takes into account the wishes of customers to a great extent, which is also the reason why tof3 is considered in the selection of alternative airports.

[0068] In the embodiment of the present invention, since AA c target As f j P Arrival airport, AA c target As f j n The departure airport, f j P Will be updated to: (o j P , A.A. c target , t1 j P , t1 j P +tof1 c target ), tof1 c target for o j P and AA c target The flight time between j n Will be updated to: (AA c target , d j n , t1 j P +tof1 c target +max(2tof3 c target , t c target ), t1 j P +tof1 ctarget +max(2tof3 c target , t c target )+tof2 c target ), tof2 c target AA c target and d j n The flight time between c target A c and AA c target The travel time between c target AA c target The transit time.

[0069] S500, confirm AA c target At t2 Ph j Is it in an invalid state? If so, c target and t2 Ph j Join IS and confirm AA c target At t1 j nh Is it in an invalid state? If so, c target and t1 j nh Join IS.

[0070] In the embodiment of the present invention, the failure state refers to a state where the airport capacity is less than the airport load. If the airport capacity of an airport is less than the airport load, it means that the airport is in a failure state.

[0071] In the embodiment of the present invention, AA c target At t2 Ph j The airport load is currently recorded at t2 Ph j The load at the time is increased by 1. For example, assuming t2 Ph j 14:30, AA c target In the absence of j P The airport load before the arrival airport is 3, as fj P After arriving at the airport, the airport load at 14:30 will become 3+1=4.

[0072] In the embodiment of the present invention, AA c target At t1 j nh The airport load is determined as follows:

[0073] If t1 j nh and time (t1 j P +tof1 c target ) are not in the same unit time period, AA c target At t1 j nh The airport load is currently recorded at t1 j nh The airborne load at that time is increased by 1. If in the same unit time period, AA c target At t1 j nh The airport load is currently recorded at t1 j nh Airport load at that time.

[0074] like Figure 6 As shown, Figure 6 The airports in the table are a1 to a8, and the flights are f1 to f6. f1 and f2, f3 and f4, f5 and f6 are connecting flights. At time t, the airport capacity of a4 is 2 and the airport load is 2. When it is closed due to weather reasons, flights f1 and f2 that originally stopped at a2 and flights f3 and f4 find the neighboring airport a4, and f5 and f6 are the original flights that stopped at a4. At this time, the load of a4 is 3, which is greater than its capacity 2, which leads to the failure of a4. It is necessary to add a4 to the IS and further distribute its load to the remaining airports.

[0075] S600, based on t2 Ph j and t1 j nh , for connecting flights j The take-off time and arrival time of the downstream flight are updated, and based on the updated take-off time and arrival time of the downstream flight, the airport load of the corresponding airport of the downstream flight is updated, and based on the updated airport load, it is determined whether the airport corresponding to the downstream flight is in an invalid state, and if so, the corresponding airport and the corresponding invalid time are added to IS; set j=j+1, and execute S200.

[0076] Due to connecting flights j The flight schedule of the connecting flight is adjusted, and the departure and arrival times of the downstream flights of the connecting flight will also change accordingly. The departure and arrival times of the downstream flights can be based on the connecting flight f j The flight time is determined by the existing technology. The airport load of the corresponding airport of the downstream flight at each time will also change accordingly.

[0077] Furthermore, S600 may specifically include:

[0078] S601, if connecting flight f j The number of downstream flights P = 1, the current airport status information of the corresponding airport of the downstream flight is j n The airport load at time t2 is reduced by 1, j n Update airport load at time t, and move the corresponding airport of the downstream flight to the next flight at t j d The airport load at time t is increased by 1, and the j d The updated airport load at t is obtained to obtain the updated airport status information of the corresponding airport of the downstream flight. If the updated airport status information of the corresponding airport of the downstream flight is j d The updated airport load at time is greater than the airport load at t j d The airport capacity at that time is determined to be in an invalid state, and the airport and t j d Add to IS; if P>1, set the downstream flight counter r=1, and execute S602; where t j d f j n From AA c target Take off and arrive j n The arrival time, t j d =t1 j P +tof1 c target +max(2tof3 c target , t c target )+tof2 c target .

[0079] In the embodiment of the present invention, the airport status information may include Lt , C t and t

[0080] S602, if r≤P-1, then f j The rth downstream flight is an intermediate flight, and S603 is executed. If r=P, it means that f j The rth downstream flight is the ending flight, and S604 is executed;

[0081] S603, the current airport status information of the airport corresponding to the rth downstream flight at t2 j r-old The airport load at time t2 is reduced by 1, j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1, j r-new Update airport load at time, and if t2 j r-new and time (t2 j r-new +t j r ) are not in the same unit time period, the current airport status information of the corresponding airport of the rth downstream flight is in (t2 j r-new +t j r ) plus 1, as the airport load at (t2 j r -new +t j r ) at the time of update airport load, obtain the updated airport status information of the corresponding airport of the r-th downstream flight, if the airport load at a certain time in the updated airport status information of the corresponding airport of the r-th downstream flight is greater than the airport capacity, determine that the corresponding airport of the r-th downstream flight is in an invalid state at that time, and add the updated airport and the corresponding invalid time of the corresponding airport of the r-th downstream flight to IS; r ranges from 1 to P, and the initial value of r is 1, t2 j r-old is the original arrival time of the rth downstream flight at the corresponding airport, t2 j r-new is the new arrival time of the rth downstream flight at the corresponding airport, determined based on the departure time and flight time of the upstream flight of the rth downstream flight. j r is the transfer time of the corresponding airport of the rth downstream flight.

[0082] S604, the current airport status information of the airport corresponding to the rth downstream flight at t2 j r-old The airport load at time t2 is reduced by 1, j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1, j r-new The updated airport load at the time is obtained, and the updated airport status information of the corresponding airport of the r-th downstream flight is obtained. If the updated airport status information of the corresponding airport of the r-th downstream flight shows that the airport load at a certain moment is greater than the airport capacity, it is determined that the corresponding airport of the r-th downstream flight is in an invalid state at that moment, and the updated airport and the corresponding invalidation time of the corresponding airport of the r-th downstream flight are added to the IS.

[0083] In summary, the route network cascading failure processing method provided by the embodiment of the present invention has at least the following technical effects:

[0084] (1) Expanding the range of alternative airports: By combining ground transportation modes such as high-speed rail, subway and self-driving, the alternative airports are no longer limited to airports directly connected to the original route network. After introducing the concept of adjacent airport clusters, the system can flexibly select airports suitable for receiving spillover flights from more alternative airports, effectively alleviating the problem of overload at a single airport.

[0085] (2) Handle load distribution and improve network survivability: In the process of load distribution, priority is given to alternative airports with sufficient margins and shorter travel time, and airport capacity and total passenger travel time are comprehensively considered to ensure the rationality of load distribution. By dynamically adjusting the load distribution strategy, the time-varying nature of the load is addressed, ensuring the stable operation of the route network in different time periods and improving the survivability of the overall network.

[0086] (3) Reduce passengers’ total travel time: Prioritize routes with the shortest total flight time and ground transportation time to reduce passengers’ total travel time and improve passenger satisfaction. Through efficient load distribution strategies, passengers can avoid being stranded at alternate airports for long periods of time and reduce the inconvenience caused by flight adjustments.

[0087] (4) Reduce the cost and operational difficulty of flight adjustments: Select alternative airports with shorter flight times to reduce the economic cost and operational difficulty of flight adjustments. Through reasonable load distribution, the cascading effect caused by airport failure can be reduced, thus ensuring the economic benefits and operational stability of airlines.

[0088] (5) Improve the ability to respond to emergencies: In the face of emergencies such as extreme weather and technical failures, the new load distribution strategy can quickly and flexibly adjust flights to ensure the normal operation of the route network. By adjusting the take-off and landing times of flights and coordinating the time of connecting flights during the load distribution process, the risk of flight delays and passenger delays can be reduced.

[0089] (6) Improve passenger travel experience: Fully consider passengers’ travel intentions during load distribution and improve passengers’ travel experience by handling travel time and ground transportation plans. Ensure that passengers can reach their destination quickly, safely and comfortably, and enhance passengers’ trust and satisfaction with the airline.

[0090] Based on the same inventive concept, an embodiment of the present invention provides a route network cascading failure processing device, comprising:

[0091] The first processing module is used to obtain the invalid airport information that needs to be processed at the current calculation moment, if the current invalid airport information set is not empty, and obtain the route set of the invalid airport corresponding to the invalid airport information that needs to be processed after the corresponding expiration time.

[0092] The first acquisition module is used to acquire the connecting flights associated with the invalid airport currently to be processed in each route in the route set.

[0093] The second acquisition module is used to obtain the target adjacent airport of the invalid airport that needs to be processed from the adjacent airport set of the invalid airport that needs to be processed, and use them as the arrival airport of the upstream flight and the departure airport of the downstream flight in the connecting flights of each route, and obtain the arrival time of the upstream flight in the connecting flights at the target adjacent airport and the departure time of the downstream flight from the target adjacent airport;

[0094] The second processing module is used to determine whether the target adjacent airport is in an invalid state when the upstream flight in the connecting flight arrives and when the downstream flight in the connecting flight takes off. If yes, the target adjacent airport is added to the current invalid airport information set.

[0095] The third processing module is used to update the take-off time and arrival time of the downstream flight of the connecting flight according to the arrival time of the upstream flight in the connecting flight at the target adjacent airport and the take-off time of the downstream flight from the target adjacent airport, and update the airport load of the corresponding airport of the downstream flight based on the updated take-off time and arrival time of the downstream flight, and determine whether the airport corresponding to the downstream flight is in an invalid state based on the updated airport load, and if so, add the corresponding airport and the corresponding expiration time to the current invalid airport information set.

[0096] Furthermore, the set of neighboring airports of the invalid airport that currently needs to be processed includes first-category airports and second-category airports, wherein the first-category airports are airports that have direct flights to the invalid airport that currently needs to be processed, and the second-category airports are airports that have no direct flights to the invalid airport that currently needs to be processed but the ground transportation time is less than the set time.

[0097] Furthermore, the second acquisition module is specifically configured to perform the following operations:

[0098] S1, set the neighboring airport counter k=1;

[0099] S2, if k≤Q, execute S3, otherwise, execute S4; Q is AAS c The number of neighboring airports in

[0100] S3, for AAS c The kth neighboring airport AA c k , judge AA c k Is there any remaining capacity at the airport in the unit time period corresponding to the current calculation time? If yes, AA c k Add it to the current set of intermediate candidate airports, set k=k+1, and execute S2; if it does not exist, set k=k+1, and execute S2; the initial value of the current set of intermediate candidate airports is empty;

[0101] S4, if the current intermediate candidate airport set is not empty, execute S5; if it is empty, execute S7;

[0102] S5, traverse the current set of intermediate candidate airports and obtain the AAM of the hth intermediate airport in the current set of intermediate candidate airports c h Corresponding travel time TM c h , and obtain the travel time set TM corresponding to the current set of intermediate candidate airports = {TM c h} h＝1，……，X ,TM c h =tof1 c h +tof2 c h +max(2tof3 c h , t0), where tof1 c h for o j P To AAM ch Travel time, tof2 c h For AAM c h to d j n Travel time, tof3 c h A c and AAM c h The travel time between the two airports is X, which is the number of intermediate airports in the current set of intermediate candidate airports; max() indicates taking the maximum value, and t0 is the preset transfer time; execute S6;

[0103] S6, obtain the airport corresponding to min(TM) as AA c target ; min() means taking the minimum value;

[0104] S7, traversing AAS c , get AA c k The corresponding travel time T c k , get AAS c The corresponding travel time set T c ={T c k} k＝1，……，Q , T c k =tof1 c k +tof2 c k +max(2tof3 c k , t0), where tof1 c k for o j P To AA c k Travel time, tof2 c k AA c k to d j n Travel time, tof3 c k A c and AA c k The travel time between them; execute S8;

[0105] S8, get min(T c ) corresponding airport as AAc target .

[0106] Furthermore, the third processing module may be specifically configured to perform the following operations:

[0107] S61, if connecting flight f j The number of downstream flights P = 1, the current airport status information of the corresponding airport of the downstream flight is j n The airport load at time t2 is reduced by 1, j n Update airport load at time t, and move the corresponding airport of the downstream flight to the next flight at t j d The airport load at time t is increased by 1, and the j d The updated airport load at t is obtained to obtain the updated airport status information of the corresponding airport of the downstream flight. If the updated airport status information of the corresponding airport of the downstream flight is j d The updated airport load at time is greater than the airport load at t j d The airport capacity at that time is determined to be in an invalid state, and the airport and t j d Add to IS; if P>1, set the downstream flight counter r=1, and execute S62; where t j d f j n From AA c target Take off and arrive j n The arrival time, t j d =t1 j P +tof1 c target +max(2tof3 c target , t c target )+tof2 c target .

[0108] In the embodiment of the present invention, the airport status information may include L t , C t and t.

[0109] S62, if r≤P-1, then f j The rth downstream flight is an intermediate flight, and S603 is executed. If r=P, it means that f jThe rth downstream flight is the ending flight, and S604 is executed;

[0110] S63, the current airport status information of the corresponding airport of the rth downstream flight is recorded at t2 j r-old The airport load at time t2 is reduced by 1, j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1, j r-new Update airport load at time, and if t2 j r-new and time (t2 j r-new +t j r ) are not in the same unit time period, the current airport status information of the corresponding airport of the rth downstream flight is in (t2 j r-new +t j r ) plus 1, as the airport load at (t2 j r-new +t j r ) at the time of update airport load, obtain the updated airport status information of the corresponding airport of the r-th downstream flight, if the airport load at a certain time in the updated airport status information of the corresponding airport of the r-th downstream flight is greater than the airport capacity, determine that the corresponding airport of the r-th downstream flight is in an invalid state at that time, and add the updated airport and the corresponding invalid time of the corresponding airport of the r-th downstream flight to IS; r ranges from 1 to P, and the initial value of r is 1, t2 j r-old is the original arrival time of the rth downstream flight at the corresponding airport, t2 j r-new is the new arrival time of the rth downstream flight at the corresponding airport, determined based on the departure time and flight time of the upstream flight of the rth downstream flight. j r is the transfer time of the corresponding airport of the rth downstream flight.

[0111] S64, the current airport status information of the corresponding airport of the rth downstream flight is recorded at t2 j r-old The airport load at time t2 is reduced by 1, which is j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1,j r-new The updated airport load at the time is obtained, and the updated airport status information of the corresponding airport of the r-th downstream flight is obtained. If the updated airport status information of the corresponding airport of the r-th downstream flight shows that the airport load at a certain moment is greater than the airport capacity, it is determined that the corresponding airport of the r-th downstream flight is in an invalid state at that moment, and the updated airport and the corresponding invalidation time of the corresponding airport of the r-th downstream flight are added to the IS.

[0112] The device can be used to perform Figure 2 Therefore, for the functions that can be realized by each functional module of the device, please refer to Figure 2 The description of the illustrated embodiment is not repeated in detail.

[0113] An embodiment of the present invention also provides an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are configured to execute the method described in the embodiment of the present invention.

[0114] The embodiment of the present invention further provides a non-transitory computer-readable storage medium storing computer-executable instructions, wherein the computer instructions are used to execute the method described in the embodiment of the present invention.

[0115] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution disclosed in the present invention can be achieved, and this document does not limit this.

[0116] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for handling cascading failures in a route network, characterized in that: The method comprises the following steps: S100, at the current calculation time, if the current invalid airport information set IS is not empty, obtain the invalid airport information that needs to be processed based on IS, and obtain the invalid airport A corresponding to the invalid airport information that needs to be processed c In the route set M after the corresponding expiration time; set the route count variable j = 1; where IS = {S i } i＝1，……，n , S i is the i-th invalid airport information in IS, S i =(U i , T.I. i ), U i is the i-th invalid airport A i ID,TI i A i The failure time, n is the number of failed airports in IS, M = {m j } j＝1，……，g , m j is the jth route of the current invalid airport after the corresponding invalid time, g is the number of routes in M, A c Belong to {A i } i＝1，……，n ; S200, if j≤g, execute S300, otherwise, execute S100; S300, for m j , get m j With A c Associated connecting flightsf j =(f j P , f j n ), where f j P =(o j P , d j P , t1 j P , t2 j P ), o j P For flight f j P Departure airport, d j P For flight f j P Arrival airport, t1 j P For flight f j P Take-off time, t2 j P For flight f j P The arrival time, f j n =(o j n , d j n , t1 j n , t2 j n ), o j n For flight f j n Departure airport, d j n For flight f j n Arrival airport, t1 j n For flight f j n Take-off time, t2 j n For flight f j n The arrival time, d j P =o j n =A c ； S400, from A c AAS c Get A c Alternative airports for AA c target , AA c target As flight j P Arrival airport and AA c target As flight j n The departure airport and obtain f j P Arrive at AA c target Arrival time t2 Ph j and f j n From AA c target Take-off time t1 j nh ; S500, confirm AA c target At t2 Ph j Is it in an invalid state? If so, c target and t2 Ph j Join IS and confirm AA c target At t1 j nh Is it in an invalid state? If so, c target and t1 j nh Join IS; S600, based on t2 Ph j and t1 j nh , for connecting flights j The take-off time and arrival time of the downstream flight are updated, and based on the updated take-off time and arrival time of the downstream flight, the airport load of the corresponding airport of the downstream flight is updated, and based on the updated airport load, it is determined whether the airport corresponding to the downstream flight is in an invalid state, and if so, the corresponding airport and the corresponding invalid time are added to IS; set j=j+1, and execute S200.

2. The method according to claim 1, characterized in that in, AAS c Meet the following conditions: AA c It includes first-category airports and second-category airports, among which first-category airports are those related to A c There are direct flights between the airports, the second category airport is the airport with A c Airports that do not have direct flights but where ground transportation time is less than the set time.

3. The method according to claim 1 or 2, characterized in that: AA c target Obtained through the following steps: S401, setting the neighboring airport counter k=1; S402, if k≤Q, execute S403, otherwise, execute S404; Q is AAS c The number of neighboring airports in S403, for AAS c The kth neighboring airport AA c k , judge AA c k Is there any remaining capacity at the airport in the unit time period corresponding to the current calculation time? If yes, AA c k Add it to the current set of intermediate candidate airports, set k=k+1, and execute S402; if it does not exist, set k=k+1, and execute S402; the initial value of the current set of intermediate candidate airports is empty; S404, if the current intermediate candidate airport set is not empty, execute S405, if it is empty, execute S407; S405, traverse the current set of intermediate candidate airports and obtain the hth intermediate airport AAM in the current set of intermediate candidate airports c h Corresponding travel time TM c h , and obtain the travel time set TM corresponding to the current set of intermediate candidate airports = {TM c h } h＝1，……，X ,TM c h =tof1 c h +tof2 c h +max(2tof3 c h , t c h ), where tof1 c h for o j P To AAM c h Travel time, tof2 c h For AAM c h to d j n Travel time, tof3 c h A c and AAM c h The travel time between them, X is the number of intermediate airports in the current set of intermediate alternative airports; max() means taking the maximum value, t c h is the transit time of the hth intermediate airport; execute S406; S406, obtain the airport corresponding to min(TM) as AA c target ; min() means taking the minimum value; S407, traversal of AAS c , get AA c k The corresponding travel time T c k , get AAS c The corresponding travel time set T c ={T c k } k＝1，……，Q , T c k =tof1 c k +tof2 c k +max(2tof3 c k , t c h ), where tof1 c k for o j P To AA c k Travel time, tof2 c k AA c k to d j n Travel time, tof3 c k A c and AA c k The travel time between the two; execute S408; S408, obtain min(T c ) corresponds to the airport as AA c target .

4. The method according to claim 1, characterized in that: S600 specifically includes: S601, if connecting flight f j The number of downstream flights P = 1, the current airport status information of the corresponding airport of the downstream flight is j n The airport load at time t2 is reduced by 1, which is j n Update airport load at time t, and move the corresponding airport of the downstream flight to the next flight at t j d The airport load at time t is increased by 1, and the j d The updated airport load at t is obtained to obtain the updated airport status information of the corresponding airport of the downstream flight. If the updated airport status information of the corresponding airport of the downstream flight is j d The updated airport load at time is greater than the airport load at t j d The airport capacity at that time is determined to be in an invalid state, and the airport and t j d Add to IS; if P>1, set the downstream flight counter r=1, and execute S602; where t j d f j n From AA c target Take off and arrive j n The arrival time, t j d =t1 j P +tof1 c target +max(2tof3 c target , t c target )+tof2 c target ; S603, if r≤P-1, execute S603, if r=P, execute S604; S602, f j The current airport status information of the corresponding airport of the rth downstream flight at t2 j r-old The airport load at time t2 is reduced by 1, which is j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1, j r-new Update airport load at time, and if t2 j r-new and time (t2 j r-new +t j r ) are not in the same unit time period, the current airport status information of the corresponding airport of the rth downstream flight is in (t2 j r-new +t j r ) plus 1, as the airport load at (t2 j r-new +t j r ) at the time of update airport load, obtain the updated airport status information of the corresponding airport of the r-th downstream flight, if the airport load at a certain time in the updated airport status information of the corresponding airport of the r-th downstream flight is greater than the airport capacity, determine that the corresponding airport of the r-th downstream flight is in an invalid state at that time, and add the updated airport and the corresponding invalid time of the corresponding airport of the r-th downstream flight to IS; r ranges from 1 to P, and the initial value of r is 1, t2 j r-old is the original arrival time of the rth downstream flight at the corresponding airport, t2 j r-new is the new arrival time of the rth downstream flight at the corresponding airport, t j r is the transfer time of the corresponding airport of the rth downstream flight; S604, the current airport status information of the airport corresponding to the rth downstream flight at t2 j r-old The airport load at time t2 is reduced by 1, which is j r-old Updated airport load at t2 j r-new The airport load at time t2 is increased by 1, j r-new The updated airport load at the time is obtained, and the updated airport status information of the corresponding airport of the r-th downstream flight is obtained. If the updated airport status information of the corresponding airport of the r-th downstream flight shows that the airport load at a certain moment is greater than the airport capacity, it is determined that the corresponding airport of the r-th downstream flight is in an invalid state at that moment, and the updated airport and the corresponding invalidation time of the corresponding airport of the r-th downstream flight are added to the IS.

5. The method according to claim 2, characterized in that: The set time is 2h.

6. A route network cascading failure processing device, characterized in that: include: The first processing module is used for, at the current calculation moment, if the current invalid airport information set is not empty, obtaining the invalid airport information that needs to be processed currently, and obtaining the route set of the invalid airport corresponding to the invalid airport information that needs to be processed currently after the corresponding invalid time; The first acquisition module is used to acquire the connecting flights associated with the invalid airport currently to be processed in each route in the route set; The second acquisition module is used to obtain the candidate airports of the invalid airport that needs to be processed currently from the neighboring airport set of the invalid airport that needs to be processed currently, and use them as the arrival airport of the upstream flight and the departure airport of the downstream flight in the connecting flights of each route, and obtain the arrival time of the upstream flight in the connecting flights at the target neighboring airport and the departure time of the downstream flight from the target neighboring airport; The second processing module is used to determine whether the target adjacent airport is in an invalid state when the upstream flight in the connecting flight arrives and when the downstream flight in the connecting flight takes off, and if so, add the target adjacent airport to the current invalid airport information set; The third processing module is used to update the take-off time and arrival time of the downstream flight of the connecting flight according to the arrival time of the upstream flight in the connecting flight at the target adjacent airport and the take-off time of the downstream flight from the target adjacent airport, and update the airport load of the corresponding airport of the downstream flight based on the updated take-off time and arrival time of the downstream flight, and determine whether the airport corresponding to the downstream flight is in an invalid state based on the updated airport load, and if so, add the corresponding airport and the corresponding expiration time to the current invalid airport information set.

7. The device according to claim 6, characterized in that in, The neighboring airport set of the invalid airport that needs to be processed currently includes the first-category airports and the second-category airports. The first-category airports are airports with direct flights to the invalid airport that needs to be processed currently, and the second-category airports are airports with direct flights to A c Airports that do not have direct flights but where ground transportation time is less than the set time.

8. The device according to claim 6, characterized in that The second acquisition module is specifically used to perform the following operations: S1, set the neighboring airport counter k=1; S2, if k≤Q, execute S3, otherwise, execute S4; Q is AAS c The number of neighboring airports in S3, for AAS c The kth neighboring airport AA c k , judge AA c k Is there any remaining capacity at the airport in the unit time period corresponding to the current calculation time? If yes, AA c k Add it to the current set of intermediate candidate airports, set k=k+1, and execute S2; if it does not exist, set k=k+1, and execute S2; the initial value of the current set of intermediate candidate airports is empty; S4, if the current intermediate candidate airport set is not empty, execute S5; if it is empty, execute S7; S5, traverse the current set of intermediate candidate airports and obtain the AAM of the hth intermediate airport in the current set of intermediate candidate airports c h Corresponding travel time TM c h , and obtain the travel time set TM corresponding to the current set of intermediate candidate airports = {TM c h } h＝1，……，X ,TM c h =tof1 c h +tof2 c h +max(2tof3 c h , t c h ), where tof1 c h for o j P To AAM c h Travel time, tof2 c h For AAM c h to d j n Travel time, tof3 c h A c and AAM c h The travel time between them, X is the number of intermediate airports in the current set of intermediate alternative airports; max() means taking the maximum value, t c h is the transit time of the hth intermediate airport; execute S6; S6, obtain the airport corresponding to min(TM) as AA c target ; min() means taking the minimum value; S7, traversing AAS c , get AA c k The corresponding travel time T c k , get AAS c The corresponding travel time set T c ={T c k } k＝1，……，Q , T c k =tof1 c k +tof2 c k +max(2tof3 c k , t c h ), where tof1 c k for o j P To AA c k Travel time, tof2 c k AA c k to d j n Travel time, tof3 c k A c and AA c k The travel time between them; execute S8; S8, get min(T c ) corresponds to the airport as AA c target .

9. An electronic device, characterized in that: including a processor and a memory; The processor is used to execute the steps of the method according to any one of claims 1 to 5 by calling the program or instruction stored in the memory.

10. A non-transitory computer-readable storage medium, characterized in that: The non-transitory computer-readable storage medium is used to store a program or instruction, and the program or instruction enables a computer to execute the steps of the method according to any one of claims 1 to 5.

Images