An efficient dynamic parking space allocation method based on bridge approach rate

Through a dynamic stoppage allocation method for bridge rate, combined with mixed integer planning and greedy algorithms, the airport allocation is optimized, and the problem of flight resource failure caused by flight delays or early development is solved, and the airport operation efficiency and normal flight operation are improved.

CN118762562BActive Publication Date: 2024-12-06WUHAN BRILLIANCE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411064531.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2024-07-12
Filing Date
2024-08-05
Publication Date
2024-12-06
Estimated Expiration
2044-08-05

AI Technical Summary

Technical Problem

The prior art cannot effectively reduce the cabin adjustment ratio when dealing with flight delays or early flight resource failures, affecting the normal flight and ground services.

Method used

An efficient dynamic stop-location method for bridge-relief rate is proposed. By defining the goals and constraints of the stop-location model, combining the mixed integer planning method and greedy algorithm, the camera allocation is optimized and the allocation completion rate and bridge-relief rate are maximized. and the unadjusted rate of the camera position, reducing the adjustment ratio of the camera position.

Benefits of technology

In the dynamic adjustment scenario, the efficiency and accuracy of the seat allocation are improved, the number of seat adjustments is reduced, and the normal operation of the flight and passenger service efficiency is improved. The result is close to the theoretical optimal solution of mathematical planning.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118762562B_ABST
    Figure CN118762562B_ABST
Patent Text Reader

Abstract

The invention relates to an efficient dynamic parking stand allocation method oriented to the docking rate, comprising: defining the target and constraint conditions of a parking stand allocation model; the target is to maximize the weighted sum of the allocation completion rate, the docking rate, the stand optimization rate and the stand non-adjustment rate; the constraint conditions include: hard constraints and time interval constraints; determining a set of flights to be allocated, and selecting to use a mixed integer programming method or a greedy algorithm to solve the parking stand allocation model based on the size of the set of flights to be allocated; being compatible with both static allocation and dynamic allocation scenarios, having the same set of optimization targets, making the operation simple, being able to be used in dynamic adjustment scenarios to solve sudden flight adjustment needs, and also being able to be used in daily static allocation scenarios, and being able to conveniently switch between small-scale and medium-scale problem scenarios and quickly obtain high-quality solutions according to the mixed integer programming solution method and the heuristic method proposed according to the problem scale.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of parking space allocation, and in particular to a highly efficient dynamic parking space allocation method oriented to bridge approach rate. Background Art

[0002] There are a large number of flights taking off and landing at the airport every day. After landing, each flight will be assigned to a designated parking space for support, and then leave for the next leg of the flight. In order to ensure that each flight has a corresponding parking space, the airport will arrange all aircraft parking space resources for the next day in advance.

[0003] AGAP (Airport Gate Assignment Problem) refers to allocating reasonable parking spaces for each arriving and departing flight, taking into account flight arrival and departure times, aircraft models, flight types, passenger and baggage information, as well as the topological structure, operation rules, and utilization status of the airport parking spaces. It is a key task in airport operation management. Generally, the two most basic constraints of uniqueness and exclusivity need to be considered, that is, each flight must and only needs to be allocated one parking space, and during its parking space occupancy time, the parking space is exclusively occupied by it and cannot serve other flights.

[0004] The research goal of the AGAP problem is to ensure flight punctuality as much as possible, reduce flight delays, facilitate passengers to get on and off the plane, and improve the operational efficiency of airports and airlines. The AGAP problem can be described as a constrained resource allocation problem with NP-Hard difficulty. Parking spaces are resources and flights are resource demanders. There is currently no unified solution to this type of difficult problem, because the constraints and optimization goals of different scenarios are different, but the main solutions include solving mixed integer programming problems, or using column generation, branch and bound based on mixed integer programming problems to maximize the planning and solving speed, as well as heuristic methods.

[0005] A new metric for the docking rate has been added to airport operations to guide the allocation of aircraft stands, ensuring that there are allocated aircraft stands while increasing the ratio of aircraft stands with jet bridges, thereby saving passengers time on boarding and disembarking. Many existing technologies take into account the optimization of the docking rate, but do not take into account that in actual airport scheduling tasks, there are often new special mission flights, flight delays or advances due to weather or air traffic control, which will make some of the aircraft stand resources arranged the previous day invalid. If the original allocation method is used for reallocation, it is likely that a large number of flights that have already been allocated aircraft stands will need to change their allocated aircraft stands, which will have a significant impact on the normal flight of flights and ground service work. Summary of the invention

[0006] In view of the technical problems existing in the prior art, the present invention provides an efficient dynamic parking stand allocation method oriented to the bridge approach rate. For the dynamic adjustment scenario, while taking into account conventional constraints and optimization objectives, the present invention adds the consideration of minimizing the stand adjustment ratio during dynamic adjustment.

[0007] According to a first aspect of the present invention, there is provided an efficient dynamic parking stand allocation method oriented to bridge approach rate, comprising:

[0008] Step 1, define the objectives and constraints of the parking stand allocation model; the objective is to maximize the weighted sum of the allocation completion rate, the bridge docking rate, the parking stand optimization rate and the parking stand unadjustment rate; the constraints include: hard constraints and the time interval constraint that the two consecutive flights on the same parking stand meet the minimum safety time;

[0009] Step 2: determine the set of flights to be allocated, and choose to use a mixed integer programming method or a greedy algorithm to solve the parking space allocation model based on the size of the set of flights to be allocated.

[0010] Based on the above technical solution, the present invention can also make the following improvements.

[0011] Optionally, the objective formula of the parking space allocation model is:

[0012]

[0013] in, represents the allocation completion rate; Indicates the bridge-relying rate; Indicates the seat preference rate; represents the unadjusted rate of aircraft positions; q1, q2, q3 and q4 represent the respective weights;

[0014] I is the set of flight numbers, i is the sequence number of the flight number; J is the set of aircraft stand numbers, j is the sequence number of the aircraft stand number; J C is the set of all the numbers of the close positions; C i represents the preferred seat set of flight i; x ij The decision variable indicating whether flight i is at gate j, r i represents the decision variable describing whether the slots allocated to flight i are adjusted; P i represents the slot allocation result of flight i under various hard constraints and preference constraints, I pi ,p i ≠-1 indicates the set of flights that have been allocated seats before the secondary allocation and whose seats meet the constraints;

[0015] Describes whether flight i is assigned and only assigned to parking stand j.

[0016] Optionally, the parking stand allocation model is a static allocation scenario or a dynamic allocation scenario. When the weight of the stand unadjusted rate is 0, the parking stand allocation model is a static allocation scenario; when the weight of the stand unadjusted rate is not equal to 0, the parking stand allocation model is a dynamic allocation scenario.

[0017] Optionally, the allocation result must satisfy all hard constraints, which are:

[0018]

[0019] Among them, H1 i * The matrix representing the hard constraints* of the flight, H2 j * A matrix representing the camera support hard constraints*.

[0020] H1 i * is a 0 / 1 matrix of dimension |I|×|J|, with the i-th row H1 i* represents the hard attribute * of flight i, obviously ∑*H1 i* =1. H2 j * is a 0 / 1 matrix of dimension |J|×|J|, with the jth column H2 *j Indicates whether the slot j satisfies the attribute *. Therefore, if the condition of formula (1.3) holds, flight i can be assigned to slot j.

[0021] Optionally, the time interval constraint is:

[0022]

[0023] Among them, y i'ij is a dummy variable; i and d i Respectively represent the arrival time and departure time of the previous aircraft, a i' represents the arrival time of the next aircraft, τ i Indicates the departure time of the previous flight d i The time of arrival of the next aircraft is a i' The minimum time interval to ensure safety.

[0024] Optionally, when the size of the set of flights to be allocated in step 2 is smaller than a set value, an optimizer is used to perform a mixed integer programming problem to solve the parking space allocation model.

[0025] Optionally, when the size of the set of flights to be allocated in step 2 is not less than a set value, the process of solving the parking space allocation model based on the greedy algorithm includes:

[0026] Select one pending flight from the pending flight set in turn, perform conflict resolution after assigning flights to the pending flight, then select a suitable parking space for the pending flight and occupy the parking space and update the candidate parking space; end when the pending flight set is empty.

[0027] Optionally, the processing process of the greedy algorithm includes:

[0028] Step 201, define a CandidateStandSet class for representing a candidate stand set of a flight; the CandidateStandSet class contains various attribute information, including: flight number, candidate stand list, number of candidate stands, minimum number of conflicts, candidate stand number with minimum number of conflicts, arrival time and departure time;

[0029] Step 202, define a buildCandidateStandCounter method for calculating the number of candidate stands for each flight; the buildCandidateStandCounter method traverses the candidateMatrixZ matrix to count the number of elements that are 1 in each flight; the elements that are 1 in the candidateMatrixZ matrix are candidate stands;

[0030] Step 203, define an occupyStand method for handling conflicts after flights are assigned to stands; the occupyStand method updates the occupancy of corresponding stands in the candidateMatrixZ matrix according to the time conflict matrix conflictMatrixQ;

[0031] Step 204, defining a chooseOneStand method for selecting a most suitable stand from a given stand list to allocate to a flight; the chooseOneStand method selects a stand based on whether the original stand can be kept available and the preferred stand list, and then selects a suitable stand based on the load of the stand;

[0032] Step 205, defining a countConflicts method for calculating the number of conflicts between two flights; the countConflicts method calculates the number of conflicts between two flights according to the candidateMatrixZ matrix and the time conflict matrix conflictMatrixQ;

[0033] Step 206, defining an extractCandidateStands method for extracting all candidate stands from a given matrix; the extractCandidateStands method traverses each element in the matrix and adds the element that is 1 to the result list;

[0034] Step 207, define an extractTheOnlyCandidateStand method for extracting a unique candidate stand from a given matrix; the extractTheOnlyCandidateStand method traverses each element in the matrix, finds the element that is 1 and returns its index;

[0035] Step 208 defines a buildCandidateStandSets method for building a candidate stand set according to given parameters; the buildCandidateStandSets method first sorts the flights according to the arrival time and departure time, and then builds a candidate stand set according to the number of candidate stands and the number of conflicts of the flights;

[0036] Step 209, define the assignStands method for executing the parking stand allocation algorithm; the assignStands method first sorts the flights according to their arrival time, then traverses the flight list, and assigns a most suitable stand to each flight according to the algorithm rules.

[0037] The present invention provides an efficient dynamic parking stand allocation method for docking rate, which can be used in dynamic adjustment scenarios to solve sudden flight adjustment needs, and can also be used in daily static allocation scenarios, and can be used by airports to pre-arrange aircraft parking resources for the next day. It is compatible with both static allocation and dynamic allocation scenarios, and has the same set of optimization objectives, making the operation simple. The mixed integer programming solution method and heuristic method proposed according to the problem scale can be easily switched in small-scale and medium-scale problem scenarios to quickly obtain high-quality solutions; the parking stand allocation algorithm based on the greedy algorithm reduces conflicts and improves the stand allocation completion rate and docking rate by giving priority to flights with fewer candidate stands and considering the load conditions of the stands, and considers the dynamic allocation scenario when selecting from the available stand set, which can keep the original stands available as much as possible without changing the allocation results; after large-scale comparative tests, the results obtained by the heuristic method are very close to the theoretical optimal solution of mathematical programming, and have obvious confidence and advantages in landing applications in medium and large airports. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 A flow chart of a highly efficient dynamic parking space allocation method for bridge approach rate provided by the present invention;

[0039] Figure 2 A flowchart of a solution process for a parking space allocation model based on a greedy algorithm provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0040] The principles and features of the present invention are described below in conjunction with the accompanying drawings. The examples given are only used to explain the present invention and are not used to limit the scope of the present invention.

[0041] Figure 1 A flowchart of an efficient dynamic parking space allocation method for bridge approach rate provided by the present invention is shown in FIG. Figure 1 As shown, the allocation method includes:

[0042] Step 1, define the objectives and constraints of the parking stand allocation model; the objective is to maximize the weighted sum of the allocation completion rate, bridge docking rate, stand preference rate and stand unadjustment rate; the constraints include: hard constraints and the time interval constraint that the two flights on the same stand meet the minimum safety time.

[0043] Step 2: determine the set of flights to be allocated, and choose to use a mixed integer programming method or a greedy algorithm to solve the parking space allocation model based on the size of the set of flights to be allocated.

[0044] The present invention provides an efficient dynamic parking stand allocation method for bridge docking rate, which is compatible with both static allocation and dynamic allocation scenarios and has the same set of optimization objectives, making the operation simple. It can be used in dynamic adjustment scenarios to solve sudden flight adjustment needs and can also be used in daily static allocation scenarios. The mixed integer programming solution method and heuristic method proposed according to the problem scale can be easily switched between small-scale and medium-scale problem scenarios to quickly obtain high-quality solutions.

[0045] Example 1

[0046] Embodiment 1 of the present invention is an embodiment of a highly efficient dynamic parking space allocation method for bridge approach rate provided by the present invention, combined with Figure 1 It can be seen that the embodiments of the allocation method include:

[0047] Step 1, define the objectives and constraints of the parking stand allocation model; the objective is to maximize the weighted sum of the allocation completion rate, bridge docking rate, stand preference rate and stand unadjustment rate; the constraints include: hard constraints and the time interval constraint that the two flights on the same stand meet the minimum safety time.

[0048] In a possible implementation manner, the objective formula of the parking space allocation model is:

[0049]

[0050] Among them, q1, q2, q3 and q4 represent respective weights.

[0051] It represents the allocation completion rate. The allocation completion rate indicator describes what proportion of all flights are allocated to seats.

[0052] It represents the bridge-to-bridge rate, which describes the proportion of all flights that are assigned to close parking positions.

[0053] Indicates the slot preference rate, which describes the proportion of all flights that are allocated to the preset preferred slot set.

[0054] It represents the unadjusted seat rate, which describes the proportion of flights whose seats have not changed in the previous and next allocation results during the secondary allocation.

[0055] I is the set of flight numbers, i is the sequence number of the flight number, i∈I.

[0056] J is the set of seat numbers, j is the sequence number of the seat numbers, j∈J; J C is the set of all the near-stand numbers; J f is the set of all remote stand numbers; J c ∪J f =J,J c ∩J f =φ.

[0057] C i represents the preferred slot set of flight i, which is used to describe the flight's preference for slots. If resources are sufficient, the slots that may be selected for the flight this year may be selected from this set. C i ∈J, the preferred seat set is a subset of the seat set.

[0058] x ij The decision variable indicating whether flight i is at gate j,

[0059] r i It represents the decision variable describing whether the slots allocated to flight i are adjusted. If not, the value is 1, otherwise the value is 0:

[0060] P i It represents the slot allocation results of flight i under various hard constraints and preference constraints:

[0061]

[0062] I pi ,p i≠-1 indicates the set of flights that have been allocated seats before the secondary allocation and whose seats meet the constraints.

[0063] Describes whether flight i is assigned and only assigned to parking stand j.

[0064] The weight value range q1, q2, q3 and q4 should be greater than 0. When the problem degenerates into a static allocation problem, the weight q4 is set to 0.

[0065] In a possible implementation manner, the parking stand allocation model is a static allocation scenario or a dynamic allocation scenario. When the weight of the stand unadjustment rate is 0, the parking stand allocation model is a static allocation scenario; when the weight of the stand unadjustment rate is not equal to 0, the parking stand allocation model is a dynamic allocation scenario.

[0066] In a possible implementation manner, the allocation result must satisfy all hard constraints, which are:

[0067]

[0068] Among them, H1 i * The matrix representing the hard constraints* of the flight, H2 j * A matrix representing the camera support hard constraints*.

[0069] H1 i * is a 0 / 1 matrix of dimension |I|×|J|, with the i-th row H1 i* represents the hard attribute * of flight i, obviously ∑*H1 i* =1. H2 j * is a 0 / 1 matrix of dimension |J|×|J|, with the jth column H2 *j Indicates whether the slot j satisfies the attribute *. Therefore, if the condition of formula (1.3) holds, flight i can be assigned to slot j.

[0070] In a possible implementation manner, the time interval constraint is:

[0071]

[0072] Among them, y i'ij is a dummy variable; i and d i Respectively represent the arrival time and departure time of the previous aircraft, a i' represents the arrival time of the next aircraft, τ i Indicates the minimum safe interval between two flights assigned to the same parking space, that is, the departure time of the previous flight di The time of arrival of the next aircraft is a i' The minimum time interval to ensure safety is a i' -d i ≥τ if and only if x i'j x ij =1.

[0073] The dummy variable y is used to describe whether the two flights at the same stand meet the minimum safety time interval.

[0074] Step 2: determine the set of flights to be allocated, and choose to use a mixed integer programming method or a greedy algorithm to solve the parking space allocation model based on the size of the set of flights to be allocated.

[0075] In a possible implementation manner, when the size of the set of flights to be allocated in step 2 is less than a set value, an optimizer is used to perform a mixed integer programming problem to solve the parking space allocation model.

[0076] During the specific implementation process, when the problem scale is small, optimizers such as CPLEX and Gurobi can be used to solve mixed integer programming problems, and the theoretical optimal solution can be obtained in a relatively short time.

[0077] After testing, it was found that with 280 flights and 50 aircraft stands, it was not possible to obtain results within one day using a machine with 16 cores and 32GB of memory. However, given enough time, this method can be used to obtain a sufficiently good solution for comparison with subsequent heuristic methods.

[0078] In a possible implementation manner, when the size of the set of flights to be allocated in step 2 is not less than the set value, Figure 2 FIG. 1 is a flowchart of a solution process of a parking space allocation model based on a greedy algorithm according to an embodiment of the present invention, Figure 2 It can be seen that the process includes:

[0079] Select a pending flight from the set of pending flights in turn, handle conflicts after assigning flights to the pending flight, then select a suitable parking space for the pending flight and occupy the parking space and update the candidate parking space; end when the set of pending flights is empty.

[0080] The parking space allocation algorithm based on the greedy algorithm first sorts the flights according to their arrival and departure times, and then gives priority to flights with fewer candidate seats, while considering the load of the seats. If there is a conflict, the algorithm will give priority to the seats with fewer conflicts. In a possible implementation method, the processing process of the greedy algorithm includes:

[0081] Step 201, define a CandidateStandSet class for representing a candidate stand set of a flight; the CandidateStandSet class contains various attribute information, including: flight number, candidate stand list, number of candidate stands, minimum number of conflicts, candidate stand number with minimum number of conflicts, arrival time and departure time, etc.

[0082] Step 202, define a buildCandidateStandCounter method for calculating the number of candidate stands for each flight; the buildCandidateStandCounter method traverses the candidateMatrixZ matrix to count the number of elements that are 1 (ie, candidate stands) in each flight.

[0083] Step 203, define the occupyStand method for handling the conflict situation after the flight is assigned to the stand; the occupyStand method updates the occupancy situation of the corresponding stand in the candidateMatrixZ matrix according to the time conflict matrix conflictMatrixQ.

[0084] Step 204, define a chooseOneStand method for selecting a possible most suitable stand from a given stand list to allocate to a flight; the chooseOneStand method selects a stand based on whether the original stand can be kept available (dynamic allocation scenario exists) and the preferred stand list (if any), and then selects a suitable stand based on the load situation of the stand.

[0085] Step 205, define a countConflicts method for calculating the number of conflicts between two flights; the countConflicts method calculates the number of conflicts between two flights according to the candidateMatrixZ matrix and the time conflict matrix conflictMatrixQ.

[0086] Step 206, define an extractCandidateStands method for extracting all candidate stands from a given matrix; the extractCandidateStands method traverses each element in the matrix and adds the element that is 1 (ie, the candidate stand) to the result list.

[0087] Step 207, define an extractTheOnlyCandidateStand method for extracting a unique candidate stand from a given matrix; the extractTheOnlyCandidateStand method traverses each element in the matrix, finds an element that is 1 (ie, a candidate stand) and returns its index.

[0088] Step 208 defines a buildCandidateStandSets method for building a candidate stand set according to given parameters; the buildCandidateStandSets method first sorts the flights according to the arrival time and departure time, and then builds a candidate stand set according to the number of candidate stands and the number of conflicts of the flights.

[0089] Step 209, define the assignStands method for executing the parking stand allocation algorithm; the assignStands method first sorts the flights according to their arrival time, then traverses the flight list and assigns a most suitable stand to each flight according to the algorithm rules.

[0090] In a specific application embodiment, 28 problems of different sizes were selected and solved by mixed integer programming method (MIP) and heuristic method (HP) respectively. From the GAP field in the table below, it can be seen that the average performance gap between the HP method and the MIP method is 2.33%, which is sufficient to be applied to solving problems in actual scenarios.

[0091] Note: Some of the result values ​​in the table are None, which means that the problem cannot be solved by the MIP method in a short time.

[0092]

[0093] The embodiment of the present invention provides an efficient dynamic parking stand allocation method for docking rate, which can be used in dynamic adjustment scenarios to solve sudden flight adjustment needs, and can also be used in daily static allocation scenarios, and can be used by airports to pre-arrange aircraft parking resources for the next day. It is compatible with both static allocation and dynamic allocation scenarios, and has the same set of optimization objectives, making the operation simple. The mixed integer programming solution method and heuristic method proposed according to the problem scale can be easily switched in small-scale and medium-scale problem scenarios to quickly obtain high-quality solutions; the parking stand allocation algorithm based on the greedy algorithm reduces conflicts and improves the stand allocation completion rate and docking rate by giving priority to flights with fewer candidate stands and considering the load conditions of the stands, and considers the dynamic allocation scenario when selecting from the available stand set, which can keep the original stands available as much as possible without changing the allocation results; after large-scale comparative tests, the results obtained by the heuristic method are very close to the theoretical optimal solution of mathematical programming, and have obvious confidence and advantages in landing applications in medium and large airports.

[0094] It should be noted that in the above embodiments, the description of each embodiment has its own emphasis, and for parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0095] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0096] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded computer, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0097] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0098] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0099] Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0100] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. An efficient dynamic parking space allocation method for bridge approach rate, characterized in that: The allocation method includes: Step 1, define the objectives and constraints of the parking stand allocation model; the objective is to maximize the weighted sum of the allocation completion rate, the bridge docking rate, the parking stand optimization rate and the parking stand unadjustment rate; the constraints include: hard constraints and the time interval constraint that the two consecutive flights on the same parking stand meet the minimum safety time; Step 2: determine the set of flights to be allocated, and choose to use a mixed integer programming method or a greedy algorithm to solve the parking space allocation model based on the size of the set of flights to be allocated; The objective formula of the parking space allocation model is: in, represents the allocation completion rate; It indicates the bridge-relying rate; Indicates the seat preference rate; It indicates the rate of unadjusted seats; , , and Represents each weight; is the set of flight numbers, i is the sequence number of the flight number; is the set of aircraft seat numbers, j is the sequence number of the aircraft seat numbers; It is the collection of all the close-in camera positions numbers; represents the preferred seat set of flight i; The decision variable indicating whether flight i is at gate j, ; represents the decision variable describing whether the slots allocated to flight i are adjusted; represents the slot allocation result of flight i under various hard constraints and preference constraints, It represents the set of flights that have been allocated seats before the secondary allocation and whose seats meet the constraints; Describes whether flight i is assigned and only assigned to parking stand j; The allocation result must satisfy all hard constraints, which are: (1.3) in, A matrix representing the hard constraints* of a flight, A matrix representing the camera support hard constraints*.

2. The distribution method according to claim 1, characterized in that: The parking stand allocation model is a static allocation scenario or a dynamic allocation scenario. When the weight of the stand unadjustment rate is 0, the parking stand allocation model is a static allocation scenario; when the weight of the stand unadjustment rate is not equal to 0, the parking stand allocation model is a dynamic allocation scenario.

3. The distribution method according to claim 1, characterized in that: The time interval constraint is: (1.4a) (1.4b) (1.4c) (1.4) in, is a dummy variable; and They represent the arrival time and departure time of the previous aircraft respectively. Indicates the arrival time of the next aircraft. Indicates the departure time of the previous flight Arrival time of the next aircraft The minimum time interval to ensure safety.

4. The distribution method according to claim 1, characterized in that: When the size of the set of flights to be allocated in step 2 is less than a set value, an optimizer is used to perform a mixed integer programming problem to solve the parking space allocation model.

5. The distribution method according to claim 1, characterized in that: When the size of the set of flights to be allocated in step 2 is not less than the set value, the process of solving the parking space allocation model based on the greedy algorithm includes: Select one pending flight from the pending flight set in turn, perform conflict resolution after assigning flights to the pending flight, then select a suitable parking space for the pending flight and occupy the parking space and update the candidate parking space; end when the pending flight set is empty.

6. The distribution method according to claim 1, characterized in that: The processing process of the greedy algorithm includes: Step 201, define a CandidateStandSet class for representing a candidate stand set of a flight; the CandidateStandSet class contains various attribute information, including: flight number, candidate stand list, number of candidate stands, minimum number of conflicts, candidate stand number with minimum number of conflicts, arrival time and departure time; Step 202, define a buildCandidateStandCounter method for calculating the number of candidate stands for each flight; the buildCandidateStandCounter method traverses the candidateMatrixZ matrix to count the number of elements that are 1 in each flight; the elements that are 1 in the candidateMatrixZ matrix are candidate stands; Step 203, define an occupyStand method for handling conflicts after flights are assigned to stands; the occupyStand method updates the occupancy of corresponding stands in the candidateMatrixZ matrix according to the time conflict matrix conflictMatrixQ; Step 204, defining a chooseOneStand method for selecting a most suitable stand from a given stand list to allocate to a flight; the chooseOneStand method selects a stand based on whether the original stand can be kept available and the preferred stand list, and then selects a suitable stand based on the load of the stand; Step 205, defining a countConflicts method for calculating the number of conflicts between two flights; the countConflicts method calculates the number of conflicts between two flights according to the candidateMatrixZ matrix and the time conflict matrix conflictMatrixQ; Step 206, defining an extractCandidateStands method for extracting all candidate stands from a given matrix; the extractCandidateStands method traverses each element in the matrix and adds the element that is 1 to the result list; Step 207, define an extractTheOnlyCandidateStand method for extracting a unique candidate stand from a given matrix; the extractTheOnlyCandidateStand method traverses each element in the matrix, finds the element that is 1 and returns its index; Step 208 defines a buildCandidateStandSets method for building a candidate stand set according to given parameters; the buildCandidateStandSets method first sorts the flights according to the arrival time and departure time, and then builds a candidate stand set according to the number of candidate stands and the number of conflicts of the flights; Step 209, define the assignStands method for executing the parking stand allocation algorithm; the assignStands method first sorts the flights according to their arrival time, then traverses the flight list, and assigns a most suitable stand to each flight according to the algorithm rules.