Runway allocation method, terminal, and storage device for multi-runway airport
By optimizing the runway allocation strategy based on the estimated flight arrival time and penalty value, the problem of unintelligent runway allocation method in the existing technology is solved, which reduces flight delay time and improves airport resource utilization efficiency and operation safety.
Patent Information
- Application Number
- CN202011072324.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-10-09
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2040-10-09
AI Technical Summary
The lack of intelligence in runway allocation methods in existing multi-running airports has led to large flight delays, increasing controller workload, reducing operational safety, and not fully considering the impact of flight sorting on other flights.
Select the runway allocation strategy based on the expected arrival time of the flight, determine the runway and penalty values of the flight, flexibly allocate the runway, and optimize the flight's position in different runway queues through total delay time, consider the impact of flight sorting on other flights, and reduce delay time , improve airport resource utilization efficiency and operational safety.
By optimizing the runway allocation strategy and penalty values, flight delay time is reduced, airport resource utilization efficiency is improved, controller workload is reduced, and operational safety is improved.
Smart Images

Figure CN112447068B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of aviation control, and in particular to a runway allocation method, a terminal and a storage device for a multi-runway airport. Background Art
[0002] Flight delays are an important problem in my country's current air traffic. Delays not only bring huge economic losses and waste of resources, but also seriously restrict the development of my country's civil aviation industry. Especially in recent years, many large airports in my country have begun to build multiple runways to meet the needs of air traffic. The rationality of runway selection and sorting allocation will directly affect the economic benefits of each unit and the rational use of airport resources. Therefore, how to correctly select runways and sorting on the basis of safety, economy and efficiency is the key to the current research problem.
[0003] However, in the prior art, runways are still allocated on a first-come, first-served basis, without considering the possible impact on other flights. Moreover, the runway allocation method is rigid, often allocating the runway closest to the direction from which the flight comes in, which lacks intelligence in terms of practicality. Or the runway is allocated by directly defining which parking position is closest to which runway, which can easily lead to large air delays, increase the workload of controllers, and reduce operational safety. Summary of the invention
[0004] In order to overcome the shortcomings of the prior art, the present invention proposes a runway allocation method, a terminal, and a storage device for a multi-runway airport. The runway allocation strategy of the flight is selected according to the estimated arrival time of the flight, and then the runway of the flight and the corresponding penalty value are determined according to the allocation strategy. The runway allocation method is flexible, and the position of the flight in different runway queues and the total delay time of different queues are determined according to the estimated arrival time and the penalty value. The impact of the flight sorting on other flights is taken into account. The runway and sorting method of the flight are determined by using the total delay time to reduce the delay time, improve the utilization efficiency of airport resources, reduce the workload of controllers, and improve the safety of operation.
[0005] To solve the above problem, a technical solution adopted by the present invention is: a runway allocation method for a multi-runway airport, the runway allocation method for a multi-runway airport comprising: S101: obtaining flight information, calculating the flight's approach path and estimated arrival time according to the flight information, and obtaining the runway allocation strategy of the flight through the estimated arrival time, the runway allocation strategy including a default allocation strategy and a nearest allocation strategy; S102: obtaining the runway of the flight and the penalty value corresponding to the runway according to the runway allocation strategy, and obtaining the initial position of the flight in the runway queue corresponding to each runway through the estimated arrival time; S103: traversing the insertion position of the flight in the runway queue according to the initial position, generating a queue according to the insertion position, calculating the recommended landing time and delay time of all flights in each queue, and obtaining the total delay time of each queue according to the delay time and penalty value; S104: determining the queue with the smallest total delay time as the optimal queue, and arranging the landing of the flight according to the order of flights in the optimal queue, the runway and the recommended landing time.
[0006] Furthermore, before the step of obtaining flight information, the step also includes: obtaining allocation rules for the nearest runway and the default runway, the allocation rules including: determining the nearest runway corresponding to the parking stand according to the area where the parking stand is located; the default runway of the flight is determined by the parking stand and the approach direction of the flight.
[0007] Furthermore, before the step of calculating the flight's arrival path and estimated arrival time based on the flight information, the step also includes: determining whether the flight's distance to landing time is within a preset range or whether the flight's actual location is within a preset area; if so, calculating the flight's arrival path based on the flight information; if not, not calculating the flight's arrival path based on the flight information.
[0008] Furthermore, the step of acquiring the runway allocation strategy of the flight through the estimated arrival time specifically includes: acquiring the time range of the runway allocation strategy, and determining the runway allocation strategy of the flight according to the time range of the estimated arrival time.
[0009] Furthermore, the step of obtaining the runway of the flight and the penalty value corresponding to the runway according to the runway allocation strategy specifically includes: obtaining the runway allocation strategy and the allocation rule to obtain the runway to which the flight is assigned; determining whether the assigned runway is a nearest runway and the number is at least two; if so, determining that the penalty value corresponding to the default nearest runway among the runways is a first penalty value, and the penalty value corresponding to the nearest runway of the non-default runway is a second penalty value; if not, the penalty value corresponding to the runway is the second penalty value, and the second penalty value is 0s.
[0010] Furthermore, the step of traversing the insertion position of the flight in the runway queue according to the initial position specifically includes: taking all positions from the initial position to the end of the runway queue as the insertion position of the flight, and traversing the insertion positions in sequence.
[0011] Furthermore, the step of calculating the recommended landing time and delay time of all flights in each queue specifically includes: calculating the recommended landing time of all flights according to constraints, and obtaining the delay time according to the difference between the recommended landing time and the estimated arrival time of the flight, and the constraints include: at least one of runway allocation aircraft type constraints, minimum landing runway interval constraints, runway resource allocation constraints, and time slot resource constraints.
[0012] Furthermore, the step of obtaining the total delay time of each queue based on the delay time and the penalty value specifically includes: obtaining the delay time and the corresponding penalty value of each flight in the queue, and taking the sum of the delay time and the penalty value of all flights as the total delay time.
[0013] Based on the same inventive concept, the present invention also proposes a runway allocation terminal for a multi-runway airport, the runway allocation terminal for a multi-runway airport comprising: a processor and a memory, the processor is connected to the memory, the memory stores a computer program, and the processor executes the runway allocation method for the multi-runway airport as described above according to the computer program.
[0014] Based on the same inventive concept, the present invention further proposes a storage device, wherein the storage device stores program data, and the program data is used to implement the runway allocation method for a multi-runway airport as described above.
[0015] Compared with the prior art, the beneficial effects of the present invention are: selecting a runway allocation strategy for a flight according to the estimated arrival time of the flight, and then determining the runway of the flight and the corresponding penalty value according to the allocation strategy; the runway allocation method is flexible, and the position of the flight in different runway queues and the total delay time of different queues are determined according to the estimated arrival time and the penalty value, taking into account the impact of the flight sorting on other flights, and reducing the delay time by using the total delay time to determine the runway and sorting method of the flight, thereby improving the utilization efficiency of airport resources, reducing the workload of controllers, and improving the safety of operation. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Figure 1 A flow chart of an embodiment of a method for allocating runways for a multi-runway airport according to the present invention;
[0017] Figure 2 It is a schematic diagram of an embodiment of the airport parking space division in the runway allocation method of a multi-runway airport of the present invention;
[0018] Figure 3 A flow chart of another embodiment of the method for allocating runways for a multi-runway airport of the present invention;
[0019] Figure 4 A flow chart of an embodiment of inserting a flight into a runway queue in a runway allocation method for a multi-runway airport of the present invention;
[0020] Figure 5 It is a schematic diagram of an embodiment of inserting a flight into a runway queue in a runway allocation method for a multi-runway airport of the present invention;
[0021] Figure 6 It is a structural diagram of an embodiment of a runway allocation terminal for a multi-runway airport of the present invention;
[0022] Figure 7 FIG. 4 is a structural diagram of a storage device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0023] The present invention is further described below in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form a new embodiment.
[0024] See also Figure 1-5 ,in, Figure 1 A flow chart of an embodiment of a method for allocating runways for a multi-runway airport according to the present invention; Figure 2 It is a schematic diagram of an embodiment of the airport parking space division in the runway allocation method of a multi-runway airport of the present invention; Figure 3 A flow chart of another embodiment of the method for allocating runways for a multi-runway airport of the present invention; Figure 4 A flow chart of an embodiment of inserting a flight into a runway queue in a runway allocation method for a multi-runway airport of the present invention;
[0025] Figure 5 FIG. 1 is a schematic diagram of an embodiment of the runway allocation method for a multi-runway airport according to the present invention for inserting a flight into a runway queue. Figure 1-5 The runway allocation method for a multi-runway airport of the present invention is described in detail.
[0026] In this embodiment, the runway allocation method for a multi-runway airport includes:
[0027] S101: Obtain flight information, calculate the flight's approach path and estimated arrival time based on the flight information, and obtain the flight's runway allocation strategy through the estimated arrival time. The runway allocation strategy includes a default allocation strategy and a nearest allocation strategy.
[0028] In this embodiment, the device for executing the runway allocation method for a multi-runway airport of the present invention may be a mobile phone, a computer, a server, a cloud platform, and other physical or virtual intelligent terminals.
[0029] In this embodiment, before the step of obtaining flight information, the step further includes: obtaining the allocation rules of the nearest runway and the default runway, and the allocation rules include: determining the nearest runway corresponding to the parking stand according to the area where the parking stand is located; the default runway of the flight is determined by the parking stand and the arrival direction of the flight. Among them, the nearest runway of the parking stand is determined by the runway close to the area where the parking stand is located, and whether the area where the parking stand is located is close to the runway is determined according to the direction of the runway. The default runway of the flight is determined according to the arrival direction and / or parking stand of the flight.
[0030] In this embodiment, the flight information includes the flight's approach route data, flight plan data, flight location information, and parking space data.
[0031] In this embodiment, before the step of calculating the flight's approach path and estimated arrival time according to the flight information, the step further includes: determining whether the flight's landing time is within a preset range or whether the flight's actual location is within a preset area, if so, calculating the flight's approach path according to the flight information, if not, not calculating the flight's approach path according to the flight information. The actual location of the flight is obtained according to the flight location information in the flight information, and the flight's distance to landing time is obtained through the flight's approach route data and flight plan data.
[0032] In a specific embodiment, the preset range is 1 hour, and the preset area is an area with an airport as the center and a radius of 500 km.
[0033] In this embodiment, the step of acquiring the runway allocation strategy of the flight through the estimated arrival time specifically includes: acquiring the time range of the runway allocation strategy, and determining the runway allocation strategy of the flight according to the time range of the estimated arrival time.
[0034] In this embodiment, different runway allocation strategies have different start times and time ranges, and the flight's approach path and corresponding estimated arrival time at different runways are obtained according to the flight information. The runway allocation strategy corresponding to the time range where the estimated arrival time is located is used as the runway allocation strategy for the flight.
[0035] S102: The runway of the flight and the penalty value corresponding to the runway are obtained according to the runway allocation strategy, and the initial position of the flight in the runway queue corresponding to each runway is obtained according to the estimated arrival time.
[0036] In this embodiment, the step of obtaining the runway of the flight and the penalty value corresponding to the runway according to the runway allocation strategy specifically includes: obtaining the runway allocation strategy and allocation rules to obtain the runway to which the flight is assigned; determining whether the assigned runway is a nearest runway and the number is at least two; if so, determining that the penalty value corresponding to the default nearest runway in the runway is a first penalty value, and the penalty value corresponding to the nearest runway of the non-default runway is a second penalty value; if not, the penalty value corresponding to the runway is a second penalty value, and the second penalty value is 0s. Among them, the nearest runway strategy assigns flights to land through their corresponding nearest runway, and the default runway strategy assigns flights to land through their corresponding default runway. Determine the nearest runway and default runway of the flight through flight information.
[0037] In this embodiment, the specific size of the first penalty value can be set according to the actual environment and user needs, and is not limited here.
[0038] In a specific embodiment, the first penalty value is 150 seconds.
[0039] In this embodiment, flights to be landed corresponding to different runways are obtained, the flights are sorted according to the estimated landing time of the flights to be landed to generate a runway queue of the runway, and the sorting position of the flight in the runway queue corresponding to the assigned runway is determined according to the estimated landing time of the flight, and the sorting position is used as the initial position of the flight.
[0040] S103: traverse the insertion position of the flight in the runway queue according to the initial position, generate a queue according to the insertion position, calculate the recommended landing time and delay time of all flights in each queue, and obtain the total delay time of each queue according to the delay time and penalty value.
[0041] In this embodiment, the step of traversing the insertion position of the flight in the runway queue according to the initial position specifically includes: taking all positions from the initial position to the end of the runway queue as the insertion position of the flight, and traversing the insertion positions in sequence.
[0042] In this embodiment, the step of calculating the recommended landing time and delay time of all flights in each queue specifically includes: calculating the recommended landing time of all flights according to the constraint conditions, and obtaining the delay time according to the difference between the recommended landing time and the estimated arrival time of the flight, and the constraint conditions include: at least one of the runway allocation aircraft type constraint, the minimum landing runway interval constraint, the runway resource allocation constraint, and the time slot resource constraint.
[0043] The step of obtaining the total delay time of each queue according to the delay time and the penalty value specifically includes: obtaining the delay time and the corresponding penalty value of each flight in the queue, and taking the sum of the delay time and the penalty value of all flights as the total delay time.
[0044] S104: Determine the queue with the smallest total delay time as the optimal queue, and arrange flight landing according to the order, runway and recommended landing time of flights in the optimal queue.
[0045] The following is a workflow of the runway allocation method for a multi-runway airport and the accompanying drawings of the specification. Figure 2 For further explanation.
[0046] 1. Define the nearest runway corresponding to the parking position;
[0047] 1.1 The parking spaces in the terminal are divided into several areas, among which the parking spaces are divided into 6 areas, namely A, B, C, D, E, and F;
[0048] 1.2 The parking stand close to the runway is defined as the nearest runway to the parking stand. Figure 2 The distance that a Chinese flight taxis to B via runway R2 is slightly different from the distance to A. The nearest runway for the parking stands in the four areas of A, B, D, and F is defined as R2, which is called the "L-type nearest runway". Similarly, when runway R2 runs southward, it is the nearest runway for B, D, F, and E; when runway R1 runs northward, R1 is the nearest runway for B, A, C, and E; when running southward, R1 is the nearest runway for A, C, E, and F.
[0049] 1.3 Based on the definition in 1.2, the nearest runways of the area formed by parking stands A and B are R1 and R2.
[0050] 1.4 Define the default runway and default nearest runway for incoming flights. In actual operation, flights will enter the airport from different directions and land. Figure 2 For example, for flights entering the airport from the west, the default runway for the flight is R1; for flights entering the airport from the east, the default runway for the flight is R2. If the default runway for the flight is R1 and the parking position is in any of the four areas A / B / C / E, then R1 is called the default nearest runway for the flight; if the parking position for the flight is in the two areas D / F, then its default runway R1 is not the nearest runway, and the nearest runway is R2.
[0051] 2. Obtain flight information; obtain flight approach route data, flight plan data, flight location information, and flight parking space data;
[0052] 3. Set the flight approach range; define all flights whose flight time to landing is within the preset range or whose actual location is within the preset area as flights G that need to be processed, and execute runway allocation for flight G.
[0053] 4. Calculate the approach paths S1 and S2 for different runways and the corresponding estimated arrival times ETA1 and ETA2 for flight G based on the flight information;
[0054] 5. Match the runway allocation strategy: match the runway allocation strategy of the flight at the estimated arrival time ETA1 or ETA2. There are two types of runway allocation strategies: default allocation strategy or nearest allocation strategy. If it is the nearest allocation strategy, the nearest allocation method is executed.
[0055] 6. Determine the nearest runway and default runway for flight G based on the definition in step 1, and proceed to step 7.
[0056] 6.1 Determine the default runway for flight G. The runway runs to the north. If flight G enters the airport from the west, the default runway for flight G is R1; if flight G enters the airport from the east, the default runway for flight G is R2.
[0057] 6.2 Determine the nearest runway for Flight G. There is only one nearest runway. Figure 2 , if the runway runs to the north, the nearest runway for C / E is R1, and the nearest runway for D / flight G is R2. According to the parking position of flight G, assign the corresponding nearest runway to flight G and execute step 7.
[0058] 6.3 Determine the nearest runway for flight G. There are two nearest runways. Figure 2 , if the runway runs north, the parking position of flight G is A or B. If the default runway of flight G is R1, flight G is assigned to the runway queue of R1 first, and step 7 is executed; flight G is assigned to the runway queue of R2 again, and step 7 is executed. In step 7, an additional penalty value P needs to be added. The P value is a custom value, which is temporarily set to 150s.
[0059] 7. Try to insert flight G into the runway queue.
[0060] 7.1 Divide different runways into different runway queues.
[0061] 7.2 Determine the calculated time ETA and runway of flight G. The calculated time ETA is the estimated arrival time corresponding to the flight landing on the runway. Determining the calculated time ETA of flight G is step 4, and determining the runway of flight G is step 5.
[0062] 7.3 Calculate the calculation time ETA of flight G at position i of the runway queue and try to insert flight G to generate a new queue.
[0063] 7.3.1 Determine the calculated time ETA of flight G at the initial position of the runway formation. Figure 5As shown, the flight code CCA001 is assigned runway R1, and the insertion position C1 of the flight is determined according to the calculated time position ETA. The position of CCA001 in the runway R1 queue is determined to be before MED001, and i=0 is set. The generated queue is CCA001-MED001-HVY002-HVY003.
[0064] 7.3.2 Loop through and try to insert into the original runway queue to generate multiple queues. Set i=i+1, then CCA001 is inserted into the additional queue based on step 7.3.1. Figure 5 The insertion position is C2, i=1, and the generated queue is MED001-CCA001-HVY002-HVY003.
[0065] 7.3.3 Execute step 7.3.2 until the end of the original runway queue element. Figure 5 As shown, execute step 7.3.2 until the end of the queue element, that is, after HVY003. The final queue generated is MED001-HVY002-HVY003-CCA001.
[0066] 7.4 Calculate flight G’s attempted insertion on other runways and add an additional penalty value P.
[0067] 7.4.1 Try to insert into the non-default nearest default runway queue of flight G, and use step 7.3 to generate multiple queues. Figure 5 As shown, if the default nearest runway of flight G is R1 and the non-default nearest runway is R2, flight G should be in the runway queue of R2, and use step 7.3 to try to insert and generate multiple queues on the runway queue of R2.
[0068] 7.4.2 Add an additional penalty value. Since flight G is assigned to a non-default nearest runway, a penalty value P should be added. The P value is a custom value, tentatively set at 150 seconds.
[0069] 7.5 Using the constraints, calculate the recommended landing time STA and delay time for each flight element of each generated queue, and add the additional penalty value P in step 7.4.2.
[0070] 7.5.1 Collect a copy of the queues generated by flight insertion for all runways. Figure 5 As shown, CCA001 generates 4 queues in the runway R1 queue and 4 queues in the runway R2 queue using step 7.3, generating 8 queues in total.
[0071] 7.5.2 Calculate the recommended landing time STA for each flight according to the constraints for each queue. The constraints include runway capacity constraints, corridor handover time, metering point interval, etc. Figure 5 The +2 after the runway queue HVY003 element in R1 is calculated using the constraint conditions, indicating that the recommended landing time STA of HVY003 is 2 minutes more than the estimated arrival time ETA.
[0072] 7.5.3 Add an additional penalty value P to calculate the total queue delay time. Figure 5 In the example, CCA001 is inserted at position C1. Assuming that its STA = ETA, the queue delay is 2 minutes, the additional penalty value is 0 seconds, and the total delay time is 120 seconds. Assuming that it is inserted into the runway queue of R2, the insertion position is C3. Assuming that the STA of all flights is ETA, the queue delay time is 0 seconds, the additional penalty value P is 150 seconds, and the total queue delay time is 150 seconds.
[0073] 8. Determine the optimal queue. The location and time of the optimal queue are the queue order and recommended landing time STA assigned to the flight under the proximity strategy.
[0074] 8.1 Use step 7.5 to calculate the total delay time of the flight, and determine the queue with the smallest total delay time as the optimal queue. Calculate the total delay time of all queues in step 7, and determine the queue with the smallest total delay time as the optimal queue. Comparing the two queues in step 7.5.3, the runway queue of R1 is the optimal queue.
[0075] 8.2 Take the optimal queue’s runway and queue position, and the recommended landing time STA as the result for flight G.
[0076] Beneficial effects: The runway allocation method for a multi-runway airport of the present invention selects a runway allocation strategy for a flight according to the estimated arrival time of the flight, and then determines the runway of the flight and the corresponding penalty value according to the allocation strategy. The runway allocation method is flexible, and the position of the flight in different runway queues and the total delay time of different queues are determined according to the estimated arrival time and the penalty value. The impact of the flight sorting on other flights is taken into account. The runway and sorting method of the flight are determined by using the total delay time, which reduces the delay time, improves the utilization efficiency of airport resources, reduces the workload of controllers, and improves the safety of operation.
[0077] Based on the same inventive concept, the present invention also proposes a runway allocation terminal for a multi-runway airport, please refer to Figure 6 , Figure 6 The structure diagram of the runway allocation terminal of a multi-runway airport of the present invention is combined with Figure 6 The runway allocation terminal for a multi-runway airport of the present invention will be described.
[0078] In this embodiment, the runway allocation terminal for a multi-runway airport includes: a processor and a memory, the processor is connected to the memory, the memory stores a computer program, and the processor executes the runway allocation method for a multi-runway airport as described above according to the computer program.
[0079] Based on the same inventive concept, the present invention also proposes a storage device, see Figure 7 , Figure 7 FIG. 1 is a structural diagram of an embodiment of a storage device of the present invention. Figure 7 The storage device of the present invention will be described.
[0080] In this embodiment, the storage device stores program data, and the program data is used to implement the runway allocation method for a multi-runway airport as described in the above embodiment.
[0081] In this embodiment, the program data for executing the runway allocation method for a multi-runway airport of the present invention can be stored on any computer-readable recording medium, such as a floppy disk, MO, CD-ROM, DVD, hard disk drive, ROM, MRAM, RAM, etc. In order to be stored in a recording medium, such a program can be downloaded from another data processing system connected via a communication line, or it can also be copied from another recording medium. In addition, such a program can also be compressed or divided into multiple segments to be recorded in one medium or multiple media. In addition, it should be noted that it is obvious that the program product that implements the present invention can be provided in various forms.
[0082] The storage medium of the present invention may also be any connectable and detachable external storage device that can be connected to (either wirelessly or wiredly) an information processing device and exchange data with the information processing device. Such external storage devices include SD cards, CompactFlash (trademark) (CF) cards, RFID tags, PCMCIA memory cards, etc., and the methods of connecting to the information processing device include IEEE 1394, wireless LAN, etc., but are not limited thereto.
[0083] The above-mentioned embodiments are only preferred embodiments of the present invention and cannot be used to limit the scope of protection of the present invention. Any non-substantial changes and substitutions made by technicians in this field on the basis of the present invention shall fall within the scope of protection required by the present invention.
Claims
1. A runway allocation method for a multi-runway airport, It is characterized in that The runway allocation method comprises: Obtaining the allocation rules of the nearest runway and the default runway, the allocation rules including: Determine the nearest runway corresponding to the parking stand according to the area where the parking stand is located; The default runway for a flight is determined by the parking position and approach direction of the flight; S101: Acquire flight information, calculate the flight's approach path and estimated arrival time according to the flight information, and acquire the flight's runway allocation strategy through the estimated arrival time, wherein the runway allocation strategy includes a default allocation strategy and a nearest allocation strategy; The step of obtaining the runway allocation strategy of the flight through the estimated arrival time specifically includes: Obtaining the time range of the runway allocation strategy, and determining the runway allocation strategy of the flight according to the time range of the estimated arrival time; S102: acquiring the runway of the flight and the penalty value corresponding to the runway according to the runway allocation strategy, and acquiring the initial position of the flight in the runway queue corresponding to each runway according to the estimated arrival time; The step of obtaining the runway of the flight and the penalty value corresponding to the runway according to the runway allocation strategy specifically includes: Obtain the runway allocation strategy and the allocation rule to obtain the runway to which the flight is allocated; Determine whether the assigned runway is a nearby runway and the number is at least two; If so, determining that the penalty value corresponding to the default nearest runway among the runways is a first penalty value, and the penalty value corresponding to the nearest runway of the non-default runway is a second penalty value; If not, the penalty value corresponding to the runway is a second penalty value, and the second penalty value is 0s; S103: traversing the insertion position of the flight in the runway queue according to the initial position, generating a queue according to the insertion position, calculating the recommended landing time and delay time of all flights in each queue, and obtaining the total delay time of each queue according to the delay time and penalty value; The step of calculating the recommended landing time and delay time of all flights in each queue specifically includes: Calculate the recommended landing time of all flights according to the constraint conditions, and obtain the delay time according to the difference between the recommended landing time and the estimated arrival time of the flight, wherein the constraint conditions include at least one of: runway allocation aircraft type constraint, minimum landing runway interval constraint, runway resource allocation constraint, and time slot resource constraint; The step of obtaining the total delay time of each queue according to the delay time and the penalty value specifically includes: Obtain the delay time and the corresponding penalty value of each flight in the queue, and take the sum of the delay time and the penalty value of all flights as the total delay time; S104: Determine the queue with the smallest total delay time as the optimal queue, and arrange the landing of the flight according to the order, runway and recommended landing time of the flights in the optimal queue.
2. The runway allocation method for a multi-runway airport as claimed in claim 1, It is characterized in that The step of calculating the flight's arrival path and estimated arrival time according to the flight information also includes: Determine whether the flight's distance to landing time is within a preset range or whether the actual location of the flight is within a preset area. If so, calculate the flight's arrival path based on the flight information; if not, do not calculate the flight's arrival path based on the flight information.
3. The runway allocation method for a multi-runway airport as claimed in claim 1, It is characterized in that The step of traversing the insertion position of the flight in the runway queue according to the initial position specifically includes: All positions from the initial position to the end of the runway queue are used as insertion positions of the flight, and the insertion positions are traversed in sequence.
4. A runway allocation terminal for a multi-runway airport, It is characterized in that The runway allocation terminal for a multi-runway airport comprises: a processor and a memory, wherein the processor is connected to the memory, the memory stores a computer program, and the processor executes the runway allocation method for a multi-runway airport according to any one of claims 1 to 3 according to the computer program.
5. A storage device, It is characterized in that The storage device stores program data, and the program data is used to implement the runway allocation method for a multi-runway airport as described in any one of claims 1-3.
