Aircraft deicing plan automatic generation method and system

Abstract

The invention discloses an aircraft deicing plan automatic generation method and system, and the method comprises the steps: collecting the environment data of a current airport in real time, generating a deicing plan generation instruction when the collected environment data accords with preset deicing triggering data, the preset deicing triggering data comprises a temperature threshold value and a humidity threshold value; according to the deicing plan generation instruction, a flight sequence which is sequentially arranged according to the take-off time in the airport is obtained according to the period, the flight sequence is divided into i subsequences, and the i subsequences are in one-to-one correspondence with i sub time periods which are sequentially arranged according to the time. According to the method and the system, through multi-stage sorting optimization and dynamic resource allocation, the operation efficiency and the passenger experience in ice and snow weather are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of air transport management, and in particular to a method and system for automatically generating an aircraft deicing plan. Background Art

[0002] In winter snowy weather, aircraft must complete de-icing before they can take off safely. The current mainstream methods include centralized de-icing on the de-icing pad and de-icing at the parking stand. Existing technologies usually pre-sort flights based on the scheduled departure time, or temporarily schedule resources after the flight boarding is completed. However, such methods have the following defects: during static sorting, the dynamically changing maximum number of flights that can be released and the maximum number of flights that can be de-iced on the ground are not taken into account, resulting in the inability to adapt to resource constraints during actual execution. Temporary scheduling can easily lead to uneven distribution of security resources, causing flights to wait for a long time, reducing resource utilization, and thus affecting flight regularity and passenger experience. Summary of the invention

[0003] In order to solve the technical problems existing in the background technology, the present invention proposes a method and system for automatically generating an aircraft deicing plan.

[0004] The present invention proposes a method for automatically generating an aircraft deicing plan, comprising the following steps: S1. Real-time collection of environmental data of the current airport, and when the collected environmental data meets preset deicing trigger data, generating a deicing plan generation instruction, wherein the environmental data includes temperature and humidity, and the preset deicing trigger data includes a temperature threshold and a humidity threshold; S2. According to the de-icing plan generation instruction, a flight sequence arranged in sequence according to the take-off time at the airport is periodically obtained, and the flight sequence is divided into i sub-sequences, where the i sub-sequences correspond one to one to i sub-time periods arranged in sequence according to time; S3, obtaining the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period in the i-th sub-time period at the current airport, and optimizing the sorting of the i-th sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence, so as to obtain i-th sub-sequences after the sorting optimization; S4. The optimized sorting result is used as the de-icing plan sequence of the current airport, and a dispatch instruction for the de-icing operation is generated according to the de-icing plan sequence.

[0005] Preferably, the step of optimizing the order of the i subsequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th subsequence to obtain the i subsequences after the order optimization specifically includes: When the maximum number of flights that can be released or the maximum number of flights that can be de-iced in any x-th sub-time period among i-th sub-time periods does not satisfy the x-th sub-sequence, one or more flights in the x-th sub-sequence are included in any sub-sequence after the x-th sub-sequence, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the x-th sub-time period can satisfy the adjusted x-th sub-sequence, x≤i.

[0006] Preferably, in step S3, x=1; and after step S3, the following steps are further included: S31. Repeat step S3 i-1 times. During the i-1 times of repeating step S3, the value of x is 2, 3, ..., i, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i sub-time periods in this cycle correspond to each other and satisfy the i sub-sequences.

[0007] Preferably, step S3 further includes: when it is analyzed that the maximum number of flights that can be released and the maximum number of flights that can be de-iced of the airport in the i-th sub-time period do not satisfy the i-th sub-sequence, one or more flights in the i-th sub-sequence are included in the next cycle, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced of the airport in the i-th sub-time period can satisfy the adjusted i-th sub-sequence.

[0008] Preferably, when the maximum number of flights that can be released or the maximum number of flights that can be de-iced in any x-th sub-time period in the i-th sub-time period does not satisfy the x-th sub-sequence, one or more flights in the x-th sub-sequence are classified into any sub-sequence after the x-th sub-sequence, specifically including: If the maximum number of flights that can be dispatched is greater than the maximum number of flights that can be de-iced and the maximum number of flights that can be de-iced is greater than the number of flights corresponding to the x-th subsequence, the number of flights in the x-th subsequence is retained; Otherwise, the maximum number of flights that can be released is retained according to the order of the xth subsequence, and the remaining flights in the first subsequence group are postponed to the subsequent x+1th subsequence.

[0009] Preferably, after step S31, the following steps are further included: S32. For a subsequence, when the departure time interval between adjacent flights is ≤ the preset interval t minutes, the corresponding flights are added to the same first-type subsequence, so that the subsequence is optimized into one or more first-type subsequences; S33. Repeat step S32 to optimize the i subsequences in turn to obtain y first-type subsequences corresponding to the i subsequences, where i≤y.

[0010] Preferably, it also includes: S34, obtaining the deicing priority corresponding to each flight in the same first type subsequence, and optimizing the sorting of the flights in the same first type subsequence in descending order of the deicing priority to obtain a second type subsequence; S35. Repeat step S34 to sequentially sort and optimize the y first-type subsequences to obtain y second-type subsequences.

[0011] Preferably, it also includes: S36, assigning deicing types to the flights in the y second type sub-sequences one by one, and outputting the y second type sub-sequences in order, wherein the deicing types include stand deicing and fixed-point deicing.

[0012] The present invention proposes an automatic generation system for aircraft deicing plan, comprising: An instruction generation module is used to collect environmental data of the current airport in real time, and generate a deicing plan generation instruction when the collected environmental data meets the preset deicing trigger data, wherein the environmental data includes temperature and humidity, and the preset deicing trigger data includes a temperature threshold and a humidity threshold; The sequence division module is used to periodically obtain the flight sequence arranged in sequence by take-off time at the airport according to the deicing plan generation instruction, and divide the flight sequence into i subsequences, where the i subsequences correspond one to one to i sub-time periods arranged in sequence; The analysis module is used to obtain the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period of the i-th sub-time period at the current airport, and to optimize the sorting of the i-sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence, so as to obtain the i-sub-sequences after sorting optimization; The de-icing plan generation module is used to use the results of the sorting optimization as the de-icing plan sequence of the current airport and generate scheduling instructions for de-icing operations according to the de-icing plan sequence.

[0013] In the present invention, the proposed method and system for automatically generating aircraft deicing plans solves the problems of static sorting and resource waste in the prior art through multi-stage sorting optimization and dynamic resource allocation. Based on the maximum number of flights that can be released, the maximum number of flights that can be de-iced on the ground, and flight priority, a time-divided deicing plan is automatically generated, which significantly improves the flight operation efficiency and passenger experience in snowy weather. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 A schematic diagram of the work flow structure of a method for automatically generating an aircraft deicing plan proposed by the present invention; Figure 2 A schematic diagram of the work flow structure of an implementation method of an aircraft de-icing plan automatic generation method proposed by the present invention; Figure 3 A schematic diagram of the priority distribution structure of a method for automatically generating an aircraft de-icing plan proposed by the present invention; Figure 4 A schematic diagram of the system architecture of an automatic generation system for an aircraft de-icing plan proposed by the present invention. DETAILED DESCRIPTION

[0015] Reference Figure 1-4 The present invention proposes a method for automatically generating an aircraft deicing plan, comprising the following steps: S1. Collect the environmental data of the current airport in real time. When the collected environmental data meets the preset deicing trigger data, generate a deicing plan generation instruction. The environmental data includes temperature and humidity. The preset deicing trigger data includes a temperature threshold and a humidity threshold.

[0016] In this embodiment, the following environmental parameters are obtained in real time through a distributed sensor network deployed on the airport runway, apron and weather station: temperature data: an anti-interference PT100 temperature sensor is used to monitor the runway surface temperature and air temperature at a sampling frequency of ≥1Hz; humidity data: a capacitive humidity sensor is used to synchronously collect the relative humidity of the air and the condensation status of the runway surface; real-time precipitation, wind speed and visibility can also be collected to assist in judging the icing risk level.

[0017] S2. Generate instructions for the de-icing plan and periodically obtain a flight sequence arranged in sequence by take-off time at the airport, and divide the flight sequence into i subsequences, where the i subsequences correspond one to one to i sub-time periods arranged in sequence by time.

[0018] In this embodiment, the flight schedule list of the airport within the period is obtained, and the flights in the flight schedule list are initially sorted based on the scheduled departure time of each flight to obtain the corresponding flight sequence .

[0019] In this embodiment, one hour is used as an interval, and the flight schedule departure time is used as a condition to start the flight sequence. Divide into different time periods, and set the planned flight volume in the first hour period to be A1.

[0020] S3. Obtain the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period in the i-th sub-time period at the current airport, and optimize the sorting of the i-sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence to obtain i-sub-sequences after sorting optimization.

[0021] In this embodiment, when the maximum number of flights that can be released or the maximum number of flights that can be de-iced in any x-th sub-time period in i sub-time periods does not satisfy the x-th sub-sequence, one or more flights in the x-th sub-sequence are included in any sub-sequence after the x-th sub-sequence, specifically including: If the maximum number of flights that can be dispatched is greater than the maximum number of flights that can be de-iced and the maximum number of flights that can be de-iced is greater than the number of flights corresponding to the x-th subsequence, the number of flights in the x-th subsequence is retained; Otherwise, the maximum number of flights that can be released is retained according to the order of the xth subsequence, and the remaining flights in the first subsequence group are postponed to the subsequent x+1th subsequence.

[0022] In step S3, x=1; and after step S3, the method further includes: S31. Repeat step S3 i-1 times. During the i-1 times of repeating step S3, the value of x is 2, 3, ..., i, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i sub-time periods in this cycle correspond to each other and satisfy the i sub-sequences.

[0023] In this embodiment, step S3 also includes: when it is analyzed that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i-th sub-time period do not satisfy the i-th sub-sequence, one or more flights in the i-th sub-sequence are included in the next cycle, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i-th sub-time period can satisfy the adjusted i-th sub-sequence.

[0024] Specifically, let the maximum number of flights that can be released be P and the maximum number of flights that can be de-iced be B. If the maximum number of flights that can be released, P, is greater than the maximum number of flights that can be de-iced, B, and the maximum number of flights that can be de-iced, B, is greater than the planned number of flights in the first hourly period, A1, then the de-icing flight plan for the first period is A1; otherwise, the de-icing flight plan for the first period = the first P flights of the planned number of flights in the first hourly period, and the remaining flights (A1-P) are placed in the second planned period; and so on, traverse all subsequences until all flights are scheduled.

[0025] In this embodiment, the maximum number of de-icing flights is The maximum number of de-icing flights is the sum of the maximum de-icing flights per hour of different airlines / ground service agents (set as B1, B2...Bn).

[0026] S32. For a subsequence, when the departure time interval between adjacent flights is ≤ the preset interval t minutes, the corresponding flights are added to the same first-type subsequence, so that the subsequence is optimized into one or more first-type subsequences; S33. Repeat step S32 to optimize the i subsequences in turn to obtain y first-type subsequences corresponding to the i subsequences, where i≤y.

[0027] In this embodiment, t can be set to different parameter values ​​according to airports with different flight volumes.

[0028] Specifically, let the subsequence of the first time period be Group1, initialize flights S1 and S3 to join, if S3-S1≤t minutes, then S3 joins the first type of subsequence; if S3-S3≤t minutes, then S3 joins the first type of subsequence, and so on, until the end of subsequence Group1. Similarly, traverse i subsequences to find all similar flight groups, and obtain y first type subsequences.

[0029] S34, obtaining the deicing priority corresponding to each flight in the same first type subsequence, and optimizing the sorting of the flights in the same first type subsequence in descending order of the deicing priority to obtain a second type subsequence; S35. Repeat step S34 to sequentially sort and optimize the y first-type subsequences to obtain y second-type subsequences.

[0030] In this embodiment, the deicing priority includes priority 1-6, and the urgency of priority 1-6 is from high to low. In the deicing priority, flight attribute>flight type>destination airport>flight delay duration>flight schedule adjustment>regular flight. Priority 1 is related to flight attribute. When the flight attribute of any flight is a preset important flight, the deicing priority of the flight is defined as priority 1. Priority 2 is related to flight type. When the flight attribute of any flight does not belong to the preset important flight and the flight type belongs to the specified area flight, the deicing priority of the flight is defined as priority 2. Priority 3 is related to the destination airport. When the flight attribute of any flight does not belong to the preset important flight and the flight type does not belong to the specified area flight, it is determined whether there is a curfew at the destination airport or whether the flight is a restricted flight. When the flight is a restricted flight or there is a curfew at the destination airport, the deicing priority of the flight is defined as priority 3. Priority 4 is related to the flight delay duration. When any flight does not belong to the type of priority 1-3, it is determined whether the flight is delayed for more than 2 hours. If the flight is delayed for more than 2 hours, the deicing priority of the flight is defined as priority 4. Priority 5 is related to flight schedule adjustment. When any flight does not belong to the priority 1-4 type, it is determined whether the flight schedule of the flight is adjusted. If the flight schedule of the flight is adjusted, the deicing priority of the flight is defined as priority 5. Priority 6 is a regular flight. When any flight does not have a situation corresponding to priority 1-5, the flight is defined as priority 6.

[0031] S36, assigning deicing types to the flights in the y second type sub-sequences one by one, and outputting the y second type sub-sequences in order, wherein the deicing types include stand deicing and fixed-point deicing.

[0032] In this embodiment, the second type of subsequence of the first time period is taken: , de-icing configuration and de-icing type are allocated according to the airline corresponding to the flight. If the maximum de-icing sorties per hour Bi of different airlines / ground service agents ≥ the number of flights Ai of this airline, all flights Ai of this airline will be allocated for aircraft stand de-icing, and then the remaining flights Ai-Bi will be allocated for fixed-point de-icing based on the principle of evenly distributed flight sequence.

[0033] S4. The optimized sorting result is used as the de-icing plan sequence of the current airport, and a dispatch instruction for the de-icing operation is generated according to the de-icing plan sequence.

[0034] Reference Figure 1-4 The present invention proposes an automatic generation system for aircraft deicing plan, comprising: An instruction generation module is used to collect the environmental data of the current airport in real time. When the collected environmental data meets the preset deicing trigger data, a deicing plan generation instruction is generated. The environmental data includes temperature and humidity. The preset deicing trigger data includes a temperature threshold and a humidity threshold. The sequence division module is used to periodically obtain the flight sequence arranged in sequence by take-off time at the airport according to the deicing plan generation instruction, and divide the flight sequence into i subsequences, where the i subsequences correspond one to one to i sub-time periods arranged in sequence; The analysis module is used to obtain the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period of the i-th sub-time period at the current airport, and to optimize the sorting of the i-sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence, so as to obtain the i-sub-sequences after sorting optimization; The de-icing plan generation module is used to use the results of the sorting optimization as the de-icing plan sequence of the current airport and generate scheduling instructions for de-icing operations according to the de-icing plan sequence.

[0035] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can make equivalent replacements or changes according to the technical scheme and inventive concept of the present invention within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A method for automatically generating an aircraft deicing plan, characterized in that: The following steps are involved: S1. Real-time collection of environmental data of the current airport, and when the collected environmental data meets preset deicing trigger data, generating a deicing plan generation instruction, wherein the environmental data includes temperature and humidity, and the preset deicing trigger data includes a temperature threshold and a humidity threshold; S2. According to the de-icing plan generation instruction, a flight sequence arranged in sequence according to the take-off time at the airport is periodically obtained, and the flight sequence is divided into i sub-sequences, where the i sub-sequences correspond one to one to i sub-time periods arranged in sequence according to time; S3, obtaining the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period in the i-th sub-time period at the current airport, and optimizing the sorting of the i-th sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence, so as to obtain i-th sub-sequences after the sorting optimization; S4. The optimized sorting result is used as the de-icing plan sequence of the current airport, and a dispatch instruction for the de-icing operation is generated according to the de-icing plan sequence.

2. The method for automatically generating an aircraft deicing plan according to claim 1, characterized in that: The step of optimizing the order of the i subsequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th subsequence to obtain the i subsequences after the order optimization specifically includes: When the maximum number of flights that can be released or the maximum number of flights that can be de-iced in any x-th sub-time period among i-th sub-time periods does not satisfy the x-th sub-sequence, one or more flights in the x-th sub-sequence are included in any sub-sequence after the x-th sub-sequence, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the x-th sub-time period can satisfy the adjusted x-th sub-sequence, x≤i.

3. The method for automatically generating an aircraft deicing plan according to claim 1, characterized in that: In step S3, x=1; and after step S3, the method further includes: S31. Repeat step S3 i-1 times. During the i-1 times of repeating step S3, the value of x is 2, 3, ..., i, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i sub-time periods in this cycle correspond to each other and satisfy the i sub-sequences.

4. The method for automatically generating an aircraft deicing plan according to claim 3, characterized in that: Step S3 also includes: when it is analyzed that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i-th sub-time period do not satisfy the i-th sub-sequence, one or more flights in the i-th sub-sequence are included in the next cycle, so that the maximum number of flights that can be released and the maximum number of flights that can be de-iced at the airport in the i-th sub-time period can satisfy the adjusted i-th sub-sequence.

5. The method for automatically generating an aircraft deicing plan according to claim 2, characterized in that: When the maximum number of flights that can be released or the maximum number of flights that can be de-iced in any x-th sub-time period in the i-th sub-time period does not satisfy the x-th sub-sequence, one or more flights in the x-th sub-sequence are classified into any sub-sequence after the x-th sub-sequence, specifically including: If the maximum number of flights that can be dispatched is greater than the maximum number of flights that can be de-iced and the maximum number of flights that can be de-iced is greater than the number of flights corresponding to the x-th subsequence, the number of flights in the x-th subsequence is retained; Otherwise, the maximum number of flights that can be released is retained according to the order of the xth subsequence, and the remaining flights in the first subsequence group are postponed to the subsequent x+1th subsequence.

6. The method for automatically generating an aircraft deicing plan according to claim 3, characterized in that: After step S31, the following steps are also included: S32. For a subsequence, when the departure time interval between adjacent flights is ≤ the preset interval t minutes, the corresponding flights are added to the same first-type subsequence, so that the subsequence is optimized into one or more first-type subsequences; S33. Repeat step S32 to optimize the i subsequences in turn to obtain y first-type subsequences corresponding to the i subsequences, where i≤y.

7. The method for automatically generating an aircraft deicing plan according to claim 6, characterized in that: Also includes: S34, obtaining the deicing priority corresponding to each flight in the same first type subsequence, and optimizing the sorting of the flights in the same first type subsequence in descending order of the deicing priority to obtain a second type subsequence; S35. Repeat step S34 to sequentially sort and optimize the y first-type subsequences to obtain y second-type subsequences.

8. The method for automatically generating an aircraft deicing plan according to claim 7, characterized in that: Also includes: S36, assigning deicing types to the flights in the y second type sub-sequences one by one, and outputting the y second type sub-sequences in order, wherein the deicing types include stand deicing and fixed-point deicing.

9. An automatic generation system for aircraft deicing plan, characterized in that: include: An instruction generation module is used to collect environmental data of the current airport in real time, and generate a deicing plan generation instruction when the collected environmental data meets the preset deicing trigger data, wherein the environmental data includes temperature and humidity, and the preset deicing trigger data includes a temperature threshold and a humidity threshold; The sequence division module is used to periodically obtain the flight sequence arranged in sequence by take-off time at the airport according to the deicing plan generation instruction, and divide the flight sequence into i subsequences, where the i subsequences correspond one to one to i sub-time periods arranged in sequence; The analysis module is used to obtain the maximum number of flights that can be released and the maximum number of flights that can be de-iced in any x-th sub-time period of the i-th sub-time period at the current airport, and to optimize the sorting of the i-sub-sequences based on the numerical relationship between the maximum number of flights that can be released, the maximum number of flights that can be de-iced, and the number of flights corresponding to the x-th sub-sequence, so as to obtain the i-sub-sequences after sorting optimization; The de-icing plan generation module is used to use the results of the sorting optimization as the de-icing plan sequence of the current airport and generate scheduling instructions for de-icing operations according to the de-icing plan sequence.

Images