Flight connection construction method and device, electronic equipment and storage medium

Abstract

The invention provides a flight connection construction method and device, electronic equipment and a storage medium. The method comprises the following steps: acquiring flights of a specified aircraft type in a given period of time, wherein information of all flights comprises information such as takeoff airports, takeoff time, landing airports and landing time of the flights, aircraft types and the like; in all airports, according to the first-in first-out (FIFO) principle or the second-in first-out (LIFO) principle, the arrival flights sorted according to the ascending order of the flight landing time and the subsequent departure flights sorted according to the ascending order of the departure time form compliance flight connection pairs one by one; all flight connection pairs of the aircraft model are traversed, chained flight strings capable of being connected of all flights are found out, and the number of all the flight strings is the number of aircrafts needing the aircraft model.

Description

Technical Field

[0001] The present application relates to the field of civil aviation route network planning, and in particular to a method, device, electronic device and storage medium for constructing flight connections using computer queue or stack technology. Background Art

[0002] In the field of civil aviation transportation, when formulating flight schedules, airlines will assign a suitable aircraft model to each flight based on transportation economic data and fleet size in order to meet market demand. When making medium- and short-term flight plans, airlines will estimate whether there are enough aircraft of this model when making capacity arrangements for each aircraft model, and will estimate how many crew members and flight attendants are needed, and then reasonably dispatch and optimize resources. Airlines will first make flight connections, taking into account aircraft maintenance plans and crew plans. Capacity coordinators will make appropriate adjustments at any time to arrange as many flights as possible for each aircraft while meeting airworthiness compliance. This can increase the airline's daily aircraft utilization rate and thus reduce airline costs. This application uses the queue "first in, first out" or stack "last in, first out" method to quickly formulate a flight connection plan. Compared with the operations research optimization plan, the calculation results of the method in this application are fast, stable, intuitive and explainable, which is convenient for airline capacity coordinators to adjust flights at any time according to other soft constraints. Summary of the invention

[0003] The embodiments of the present application provide a method, device, electronic device and storage medium for constructing a flight connection to solve the problems existing in the flight planning and operation stages in the related art.

[0004] In the first aspect, an embodiment of the present application provides a flight connection construction method, which includes: obtaining flights of a specified aircraft model within a given period of time, and the information of all flights includes the flight's departure airport, departure time, landing airport and landing time, and aircraft model; for all airports, the incoming flights are sorted in ascending order by flight landing time, and one by one according to the "first in, first out" (FIFO) or "last in, first out" (LIFO) principle with the subsequent outbound flights sorted in ascending order by departure time to construct a compliant "flight connection pair"; traverse all "flight connection pairs" of the aircraft model to find out the chained flight strings that can be connected for all flights, and the number of all flight strings is the number of aircraft of this model required.

[0005] In the second aspect, an embodiment of the present application provides a flight connection construction device, which includes the following units: a flight acquisition unit, configured to obtain flights of a specified aircraft model within a given period of time, and the information of all flights includes the flight's departure airport, departure time, landing airport and landing time, as well as aircraft model information; a connection construction unit, configured to arrange inbound flights sorted in ascending order by flight landing time at all airports, and to construct compliant "flight connection pairs" one by one according to the "first in, first out" (FIFO) or "last in, first out" (LIFO) principle with subsequent outbound flights sorted in ascending order by departure time; a connection determination unit, configured to traverse all "flight connection pairs" of the aircraft model and find out the chained flight strings that can be connected for all flights, and the number of all flight strings is the number of aircraft of this model required.

[0006] In a third aspect, an embodiment of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory, wherein the processor implements any of the above methods when executing the computer program.

[0007] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described in any one of the above is implemented.

[0008] Compared with the prior art, this application has the following advantages:

[0009] According to the embodiment of the present application, the large-scale flight network of the airline is divided into small-scale flights according to the airport. At each airport, the first-arriving aircraft is given priority to the first-outing aircraft. In implementation, the "first-in, first-out" (FIFO) characteristic of the queue is used to connect the flights; or at the maintenance base, the last-arriving aircraft is given priority to the first-outing aircraft. In implementation, the "last-in, first-out" (LIFO) characteristic of the stack is used to connect the flights, so that some flights have more time on the scene to arrange aircraft maintenance and scheduled inspections. The method of the present application is fast in calculation, intuitive in connection, reasonable and stable, which is convenient for flight coordinators to understand and thus facilitate flight readjustment.

[0010] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In the accompanying drawings, unless otherwise specified, the same reference numerals throughout the multiple drawings represent the same or similar parts or elements. These drawings are not necessarily drawn to scale. It should be understood that these drawings only depict some embodiments according to the present application and should not be regarded as limiting the scope of the present application.

[0012] Figure 1 is a flow chart showing a flight connection construction method according to an embodiment of the present application;

[0013] Figure 2 is a structural block diagram showing a flight connection construction device according to an embodiment of the present application; and

[0014] Figure 3 is a block diagram showing an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0015] In the following, only some exemplary embodiments are briefly described. As those skilled in the art will appreciate, the described embodiments may be modified in various ways without departing from the concept or scope of the present application. Therefore, the drawings and descriptions are considered to be exemplary in nature and not restrictive.

[0016] To facilitate understanding of the technical solutions of the embodiments of the present application, the following describes the related technologies of the embodiments of the present application. The following related technologies can be combined with the technical solutions of the embodiments of the present application as optional solutions, and they all belong to the protection scope of the embodiments of the present application.

[0017] Aircraft are the most valuable resources and assets of airlines. Wide-body aircraft generally fly longer routes, flying for more than 12 hours a day; narrow-body aircraft generally fly domestic routes, flying less than 10 hours a day. Currently, large airlines have nearly a thousand aircraft, and the rational use of the most valuable aircraft resources is the most challenging task, especially in the actual operation of flights. Various hard and soft constraints such as airworthiness regulations, airport restrictions, route restrictions, aircraft characteristics, aircraft maintenance and inspection, crew rest and vacation, etc. greatly limit the airline's pursuit of economic indicators and greatly increase the workload of flight managers. In order to reduce the complexity of the algorithm and increase the speed of the algorithm, the large-scale flight optimization problem is decomposed into optimizations by aircraft type and airport respectively. The embodiment of the patent application uses a specified aircraft type to illustrate the method and working principle of constructing a one-day flight connection.

[0018] An embodiment of the present application provides a flight connection construction method 100. In the embodiment of the present application, a flight string represents all flights in a day operated by an aircraft (aircraft model). The flight string requires that the departure airport of the first flight and the arrival airport of the last flight are both a series of connecting flights at the airline's headquarters and base airports, and the departure airport of the subsequent flight in the flight string is the same as the arrival airport of the previous flight, and the departure time of the subsequent flight must be after the landing of the previous flight. The flight connection construction method 100 can be executed on a computer device, especially on a computer device of an airline, and of course it can also be executed in the cloud through cloud computing. Regardless of which computer entity is executed, it can be shared among all airlines through uploading and sharing, or the flight connection construction method can be shared among authorized airlines, so as to better construct flight connections and improve aircraft utilization. The following will refer to Figure 1 The flight connection construction method 100 of the present application is described as follows: Figure 1 As shown, the flight connection construction method 100 may include the following steps S101 to S103. Steps S101 to S103 will be described below in conjunction with a specific embodiment.

[0019] First, enter step S101. In step S101, obtain 66 flight information of 32W model on June 5, 2023, and the flight information includes the departure airport, departure time, landing airport and landing time of all flights, as well as the model and other information.

[0020] In one embodiment, as shown in Table 1, the flight information table may include information of multiple flights such as execution date, flight number, aircraft type, departure airport, departure time, arrival airport, arrival time, flight number, etc.

[0021] Table 1

[0022]

[0023]

[0024] In one embodiment, the time period is based on one day, such as a flight on Monday, or it can be based on one week or one month. Each row in the flight information table for the same aircraft type is specific basic information of a flight.

[0025] An airline has a variety of aircraft models of different sizes and widths, such as Boeing B747, B777, B787, B737, Airbus A350, A330, A321, A320 and COMAC C919. Each aircraft model is divided into several sub-models according to the airline's definition. Table 1 is a flight information table of sub-model 32W of an airline on Monday. The airline's headquarters is in WUH, with 15 aircraft stationed, one base in PEK, and 1 aircraft staying overnight or for maintenance.

[0026] Next, the process proceeds to step S102. In step S102, the inbound flights at all airports sorted in ascending order of flight landing time are connected one by one according to the "first in, first out" (FIFO) or "last in, first out" (LIFO) principle with the subsequent outbound flights sorted in ascending order of take-off time to form a compliant "flight connection pair".

[0027] In one embodiment, at all airports, the inbound flights of the airport are sorted in ascending order of landing time to form an inbound flight queue (Queue), and the subsequent outbound flights are sorted in ascending order of departure time to form an outbound flight queue (Queue), and the "first in, first out" (FIFO) feature of the queue data structure is utilized to connect with the subsequent outbound flights in sequence using the queue characteristics, and ensure that the connection time between the two flights is not less than the minimum stopover time specified by the Civil Aviation Administration, and define the flight connection relationship as [predecessor flight-subsequent flight, connection time (mm)], and a "flight connection pair" is defined as the preceding flight-the succeeding flight.

[0028] The following will refer to Table 1 to explain the "first in, first out" principle for flights on a designated Monday. All flights are sorted from early to late in order of departure time and numbered by natural numbers. Flight number 1, CA8289, takes off from PEK and lands at SWA. All flights in Table 1 fly to airports (SWA, XNN, LFQ, HET, CTU, LHW, YNT, TSN, SHE, PEK, ZHA, SZX, TFU, CGQ, DQA, WUH, KRL, BAV, CAN, TAO, NGB, KWE, XMN, ZUH, XIY) for a total of 25 airports, of which WUH is the headquarters with 15 overnight aircraft, PEK is the HUB airport with 1 overnight aircraft, and CTU is also the HUB airport with 0 overnight aircraft. The SWA airport is used as an example to illustrate the construction of the connection relationship. At SWA airport, there are only two flights, one in and one out, namely, incoming flight 1 and outgoing flight 24. According to the FIFO principle, the flight connection relationship (1-24,160) is obtained. Similarly, the connection relationship of all airports with only one in and one out flight is obtained as shown in Table 2 below.

[0029] Table 2

[0030] Landing airport Connection Landing airport Connection Landing airport Connection SWA (1-24,160) XNN (2-19,50) HET (4-22,105) ZHA (11-30,130) SZX (12-23,65) TFU (13-26,75) CGQ (16-29,50) DQA (17-31,45) KRL (20-34,50) BAV (28-38,45) CAN (33-41,65) TAO (44-58,60) NGB (50-60,65) KWE (51-63,60) XMN (52-64,60) ZU (53-65,50) XIY (54-66,65)

[0031] In Table 1, for the six airports with no overnight aircraft and multiple inbound and outbound flights: LFQ, LHW, YNT, CTU, TSN, and SHE, flights are connected according to the FIFO principle. For example, the arrival queue of LFQ airport is [3,46], and the departure queue is [14,59]. According to the "first in, first out" principle, the flight connections are (3-14,45) and (46-59,45). Similarly, for airports with multiple inbound and outbound flights, the flight connection relationship is shown in Table 3.

[0032] Table 3

[0033]

[0034]

[0035] Refer to Table 1. For the airport PEK with one overnight aircraft and multiple inbound and outbound flights, the arrival queue is [ 10,14,15,19,36,40,48, 56], the outbound queue is [2, 25,27,32,37,46,57,61 ], and the underlined elements in the queue are mapped one by one to form “flight connection pairs” according to the “first in, first out” principle. The flight connection relationship is shown in Table 4.

[0036] Table 4

[0037]

[0038] For the branch headquarters WUH with 15 overnight aircraft, the arrival queue is [ 18，22，23，24，21，26， 27，30，32，38，39，37，41 , 43, 47, 45, 55, 59, 58, 57, 60, 62, 61, 63, 64, 65, 66], and the outbound queue is [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 28, 33，35，40，42，44，48，49，50，51，52，53，54，56] Since there are 15 planes staying overnight at WUH, there are no more than 15 planes that can depart in the morning. The earliest arriving flight 18 has a connection time of only 10 minutes with the departing flight 28, which does not meet the minimum stopover time standard. Only flight 33 has a connection time of 70 minutes, which meets the airline's requirements. At the same time, there are 14 departing flights before this, and the number of aircraft required is 14, which is less than the number of aircraft staying overnight. According to the "first in, first out" principle, the underlined elements in the queue correspond to each other to form flight connections. The flight connection relationship is shown in Table 5

[0039] Table 5

[0040]

[0041] In one embodiment, the connection time is the time length between the departure time of the subsequent connecting flight and the arrival time of the previous flight.

[0042] According to the embodiment of the present application, by determining the flights with connection time greater than the minimum stopover time as subsequent connecting flights, not only can the compliance of aircraft flight be met, but also the utilization rate of aircraft can be improved. For example, the subsequent connecting flights of flight 18 are flights 28 and 33, but the connection time of flight 28 is 10 minutes, which is not enough for the minimum stopover time. Only flight 33 is a feasible subsequent connecting flight, with a connection time of 70 minutes, which meets the civil aviation statutory requirement of 60 minutes for the minimum stopover time of WUH terminal.

[0043] In one embodiment, the “flight connection pair” means that the landing airport of the current flight is the same as the departure airport of the next connecting flight, and the connection time is not less than the minimum turnaround time (MCT) of the aircraft type specified by the Civil Aviation Administration, see Table 6.

[0044] In one embodiment, the minimum turnaround time (MCT) is the minimum guaranteed time required for an aircraft to turn around at airports of different levels for different aircraft types as stipulated by the Civil Aviation Administration.

[0045] In one embodiment, the actual average flight connection time calculated from historical statistics can be set as the minimum stopover time. Sometimes, busy airports often cause flight delays due to insufficient ground support. In order to reduce predictable flight delays, the actual average flight connection time can be set as the minimum stopover time. The actual average flight connection time can be calculated based on historical data.

[0046] According to an embodiment of the present application, by setting the actual average flight connection time to the minimum stopover time specified by the airline, the minimum stopover time can be dynamically set according to the busyness of the airport or the Monte Carlo Markov chain method, thereby reducing predictable flight delays.

[0047] Table 6

[0048]

[0049] Next, enter step S103. In step S103, traverse all "flight connection pairs" of the aircraft type to find chained flight strings that can be connected to all flights. The number of all flight strings is the number of aircraft of the aircraft type required.

[0050] Preferably, the chained flight string is a string in which the last flight in the first "flight connection pair" and the first flight in the second "flight connection pair" are the same flight, and the "flight connection pairs" are chained head to tail to form a complete set of connectable flights.

[0051] In one embodiment, the steps of generating a chained flight string are illustrated by way of example. In the flight connection relationships shown in Tables 2 to 5, the connection relationships starting from flight 1 are (1-24, 160), and the "flight connection pair" is 1-24. The connection relationships of flight 24 are (24-42, 170), and the "flight connection pair" is 24-42. The "flight connection pair" 1-24 and the "flight connection pair" 24-42 can be connected end to end to form a chained flight string of 1-24-42. The connection relationships of flight 42 are (42-55, 65), and the "flight connection pair" is 42-55. Flight 55 has no flights that can be connected. In this way, the complete flight string composed of connectable flights is 1-24-42-55, and an A320 aircraft can be arranged to fly. In the same way, chained flight strings operated by other aircraft can also be obtained.

[0052] In one embodiment, all flights in Table 1 are subjected to the flight connection construction method to obtain the result in Table 7.

[0053] Table 7

[0054]

[0055]

[0056] After all flight connections are confirmed, airlines can make adjustments to aircraft maintenance plans, crew plans and other soft constraints at any time according to the situation.

[0057] Corresponding to the application scenario and method of the method provided in the embodiment of the present application, an embodiment of the present application also provides a flight connection construction device, which is deployed on a computer device. Figure 2 The flight connection structure device of this application is described. Figure 2 1 is a structural block diagram showing a flight connection construction device according to an embodiment of the present application. Figure 2 As shown, the flight connection construction device 200 may include: a flight acquisition unit 201, a connection construction unit 202, and a connection determination unit 203.

[0058] The flight acquisition unit 201 is configured to acquire flights of a specified aircraft type within a given period of time, and the information of all flights includes the flight's departure airport, departure time, landing airport and landing time, and aircraft type.

[0059] The flight acquisition unit 201 may be a component in a computer device, through which the computer device acquires all flight information from the flight schedule prepared by the airline.

[0060] The connection construction unit 202 is configured to construct a compliant "flight connection pair" with the subsequent outbound flights sorted in ascending order of take-off time one by one according to the "first in, first out" (FIFO) or "last in, first out" (LIFO) principle for the inbound flights sorted in ascending order of flight landing time at all airports.

[0061] The connection construction unit 202 may be a component in a computer device, through which the computer device constructs all the connecting flights of the flight, uses queue characteristics or stack characteristics to establish a one-to-one corresponding connection relationship, and the connection time is not less than the minimum stopover time of this aircraft model.

[0062] The connection determination unit 203 is configured to traverse all "flight connection pairs" of the aircraft type and find out the chained flight strings that can be connected to all flights. The number of all flight strings is the number of aircraft of the aircraft type required.

[0063] The connection determination unit 203 may be a component in a computer device, and the computer device determines to find the flight connections of all aircraft through this component.

[0064] The functions of each module in each device in the embodiments of the present application can be found in the corresponding description in the above method, and have corresponding beneficial effects, which will not be repeated here.

[0065] Figure 3 FIG. 3 is a block diagram of an electronic device 300 for implementing an embodiment of the present application. Figure 3 As shown, the electronic device includes: a memory 301 and a processor 302. The memory 301 stores a flight connection construction computer program that can be run on the processor 302. When the processor 302 executes the computer program, the method in the above embodiment is implemented. The number of the memory 301 and the processor 302 can be one or more.

[0066] The electronic device also includes:

[0067] The communication interface 303 is used to communicate with external devices and perform data exchange transmission.

[0068] If the memory 301, the processor 302 and the communication interface 303 are implemented independently, the memory 301, the processor 302 and the communication interface 303 can be connected to each other through a bus and communicate with each other. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0069] Optionally, in a specific implementation, if the memory 301, the processor 302 and the communication interface 303 are integrated on a chip, the memory 301, the processor 302 and the communication interface 303 can communicate with each other through an internal interface.

[0070] An embodiment of the present application provides a computer-readable storage medium storing a computer program, which implements the method provided in the embodiment of the present application when the program is executed by a processor.

[0071] An embodiment of the present application also provides a chip, which includes a processor for calling and executing instructions stored in the memory from the memory, so that a communication device equipped with the chip executes the method provided by the embodiment of the present application.

[0072] An embodiment of the present application also provides a chip, including: an input interface, an output interface, a processor and a memory, wherein the input interface, the output interface, the processor and the memory are connected via an internal connection path, and the processor is used to execute the code in the memory. When the code is executed, the processor is used to execute the method provided in the embodiment of the application.

[0073] It should be understood that the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. It is worth noting that the processor may be a processor supporting the Advanced RISC Machines (ARM) architecture.

[0074] Further, optionally, the above-mentioned memory may include a read-only memory and a random access memory. The memory may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may include a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may include a random access memory (RAM), which is used as an external cache. By way of exemplary but not limiting description, many forms of RAM are available. For example, static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct memory bus random access memory (DR RAM).

[0075] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.

[0076] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification and the features of different embodiments or examples, unless they are contradictory.

[0077] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0078] Any process or method described in the flow chart or otherwise described herein can be understood as a module, fragment or portion of a code representing one or more executable instructions for implementing the steps of a specific logical function or process. And the scope of the preferred embodiment of the present application includes other implementations, in which the functions may not be performed in the order shown or discussed, including in a substantially simultaneous manner or in a reverse order according to the functions involved.

[0079] The logic and / or steps described in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, which can be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or used in combination with these instruction execution systems, devices or apparatuses.

[0080] It should be understood that the various parts of the present application can be implemented with hardware, software, firmware or a combination thereof. In the above embodiments, multiple steps or methods can be implemented with software or firmware stored in a memory and executed by a suitable instruction execution system. All or part of the steps of the above embodiment method can be completed by instructing the relevant hardware through a program, which can be stored in a computer-readable storage medium, and when the program is executed, it includes one of the steps of the method embodiment or a combination thereof.

[0081] In addition, each functional unit in each embodiment of the present application can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into one module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of a software functional module. If the above-mentioned integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. The storage medium can be a read-only memory, a disk or an optical disk, etc.

[0082] The above is only an exemplary embodiment of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of various changes or substitutions within the technical scope recorded in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A flight connection construction method, characterized in that: The following steps are involved: Get the flights of a specified aircraft type within a given period of time. The information of all flights includes the departure airport, departure time, landing airport and landing time, and aircraft type. At all airports, incoming flights sorted in ascending order of flight landing time are connected one by one according to the "First In First Out" (FIFO) or "Last In First Out" (LIFO) principle with subsequent outgoing flights sorted in ascending order of departure time to form a compliant "flight connection pair"; Traverse all the "flight connection pairs" of this model and find the chained flight strings that can be connected to all flights. The number of all flight strings is the number of aircraft of this model required.

2. The method according to claim 1, wherein: The period of time may be in units of one day, one week or one month.

3. The method according to claim 1, wherein: The "first in, first out" (FIFO) means that the aircraft that lands at the airport first will execute the flight that departs from the airport first, and it is preferably operated by a queue.

4. The method according to claim 1, wherein: The "last in, first out" (LIFO) means that the aircraft that lands at the airport later executes the flight that departs from the airport earlier, and it is preferably operated by stacking.

5. The method according to claim 1, wherein: The chained flight string is a string in which the last flight in the first "flight connection pair" and the first flight in the second "flight connection pair" are the same flight, and the "flight connection pairs" are chained together to form a complete set of connectable flights.

6. The method according to claims 1-5, wherein: The compliant "flight connection pair" refers to two flights whose connection time is not less than the minimum stopover time for the aircraft type specified by the Civil Aviation Administration of China, and the "flight connection pair" refers to two flights whose landing airport of the first flight is the same as the departure airport of the next connecting flight.

7. A flight connection structure device, characterized in that: include: A flight acquisition unit is configured to acquire flights of a specified aircraft type within a given period of time. The information of all flights includes the flight's departure airport, departure time, landing airport, landing time, and aircraft type; The connection construction unit is configured to connect all the inbound flights sorted in ascending order of flight landing time at all airports, and to form a compliant "flight connection pair" with the subsequent outbound flights sorted in ascending order of departure time one by one according to the "first in, first out" (FIFO) or "last in, first out" (LIFO) principle; The connection determination unit is configured to traverse all "flight connection pairs" of the aircraft model and find out the chained flight strings that can be connected to all flights. The number of all flight strings is the number of aircraft of the aircraft model required.

8. An electronic device comprising a memory, a processor and a computer program stored in the memory, wherein the processor implements the method according to any one of claims 1 to 6 when executing the computer program.

9. A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images