Parking stand scheduling method, system, device and storage medium

Abstract

The present disclosure relates to a parking stand scheduling method, system, device and storage medium. A parking stand scheduling method is provided, comprising: for a first flight whose scheduled parking stand is a far parking stand, determining that the first flight has taken off and is in flight; obtaining available parking stands for the first flight; when the available parking stands include a near parking stand, changing the parking stand to be used for the first flight to a near parking stand; and when the available parking stands do not include a near parking stand, changing the parking stand to be used for the first flight to a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand for the first flight by more than a taxiing time difference threshold.

Description

Technical Field

[0001] The present disclosure generally relates to the technical field of airport resource allocation, and more specifically, to a parking stand scheduling method, system, device and storage medium. Background Art

[0002] Parking space resources are one of the important resources of an airport. The allocation and scheduling of parking spaces directly affects the operating costs and efficiency of the airport as well as the satisfaction of airlines and passengers. The allocation and scheduling of parking spaces is a very complex process, which requires comprehensive consideration of many factors, such as the compatibility of parking spaces and aircraft types, the compatibility of parking space occupancy in time and space, and the special requirements of flights with specific attributes (such as domestic or international) or specific accreditors (such as airlines) for parking spaces. Summary of the invention

[0003] According to a first aspect of the present disclosure, a parking stand scheduling method is provided, comprising: for a first flight whose scheduled parking stand is a far parking stand, determining that the first flight has taken off and is in flight; obtaining available parking stands for the first flight; when the available parking stands include a near parking stand, changing the parking stand to be used for the first flight to the near parking stand; and when the available parking stands do not include a near parking stand, changing the parking stand to be used for the first flight to a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand for the first flight by more than a taxiing time difference threshold.

[0004] In some embodiments, said obtaining and said modifying are performed at a time that is more than a first amount of time threshold earlier than an estimated arrival time of said first flight.

[0005] In some embodiments, said obtaining and said modifying are performed at a time earlier than an estimated arrival time of said first flight by more than said first amount of time threshold but not more than a second amount of time threshold that is greater than said first amount of time threshold.

[0006] In some embodiments, the parking stand scheduling method further includes: when the available parking stands include neither a close parking stand nor a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand of the first flight by more than a taxi time difference threshold, waiting for a period of time and reacquiring the available parking stands of the first flight until one of the following situations occurs: the reacquired available parking stands include a close parking stand or a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand of the first flight by more than a taxi time difference threshold; the current time is earlier than the estimated arrival time of the first flight by no more than a first time amount threshold.

[0007] In some embodiments, the available parking stands of the first flight are free within the estimated parking stand occupancy time period of the first flight and meet the requirements of the approver, aircraft type, and domestic / international attributes of the first flight.

[0008] In some embodiments, when the first flight has a subsequent flight, the available parking spaces of the first flight also meet the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the first flight.

[0009] In some embodiments, the taxi time of the parking stand includes the outbound taxi time and the inbound taxi time of the parking stand.

[0010] In some embodiments, the parking stand scheduling method further includes: when the number of stranded flights at the airport exceeds a quantity threshold, changing the parking stand to be used for the first flight to a remote parking stand whose departure taxi time is shorter than the departure taxi time of the planned parking stand for the first flight.

[0011] In some embodiments, when the available parking stands include neither a close parking stand nor a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand of the first flight by more than a taxi time difference threshold, the parking stand scheduling method further includes: for a second flight whose planned parking stand is a close parking stand, determining that the planned parking stand of the first flight is available for the second flight, determining that the planned parking stand of the second flight is available for the first flight, and determining that the number of shuttle trips required for the first flight is greater than the number of shuttle trips required for the second flight; determining that the second flight has taken off and is in flight; and changing the parking stand to be used for the first flight to the planned parking stand for the second flight, and changing the parking stand to be used for the second flight to the planned parking stand for the first flight.

[0012] In some embodiments, determining that the scheduled parking position of the first flight is available for the second flight includes: determining that the scheduled parking position of the first flight meets the requirements of the approver, aircraft model, and domestic / international attributes of the second flight; and determining that the scheduled parking position of the first flight is free within the expected occupied parking position time period of the second flight after excluding the expected occupied parking position time period of the first flight, and determining that the scheduled parking position of the second flight is available for the first flight includes: determining that the scheduled parking position of the second flight meets the requirements of the approver, aircraft model, and domestic / international attributes of the first flight; and determining that the scheduled parking position of the second flight is free within the expected occupied parking position time period of the first flight after excluding the expected occupied parking position time period of the second flight.

[0013] In some embodiments, when the first flight has a subsequent flight, determining that the planned parking space of the second flight is available for the first flight also includes determining that the planned parking space of the second flight meets the requirements of the approver, aircraft model, and domestic / international attributes of the subsequent flight of the first flight; and when the second flight has a subsequent flight, determining that the planned parking space of the first flight is available for the second flight also includes determining that the planned parking space of the first flight meets the requirements of the approver, aircraft model, and domestic / international attributes of the subsequent flight of the second flight.

[0014] In some embodiments, when the first flight and the second flight have subsequent flights, it is determined that the total number of ferry trips required for the first flight and its subsequent flights is greater than the total number of ferry trips required for the second flight and its subsequent flights.

[0015] In some embodiments, the altering is performed at a time that is more than a first amount of time threshold earlier than an estimated arrival time of the first flight and more than a first amount of time threshold earlier than an estimated arrival time of the second flight.

[0016] In some embodiments, the second flight is not a VIP flight.

[0017] In some embodiments, available parking slots are obtained using a greedy algorithm.

[0018] According to a second aspect of the present disclosure, a parking stand scheduling method is provided, including: for a first flight whose planned parking stand is a far parking stand and a second flight whose planned parking stand is a near parking stand, determining that the planned parking stand of the first flight is available for the second flight, determining that the planned parking stand of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight; determining that the first flight has taken off and is in flight; determining that the second flight has taken off and is in flight; and changing the parking stand to be used for the first flight to the planned parking stand for the second flight, and changing the parking stand to be used for the second flight to the planned parking stand for the first flight.

[0019] According to a third aspect of the present disclosure, there is provided a parking stand scheduling device, comprising: one or more processors; and a memory storing computer-readable instructions, wherein when the computer-readable instructions are executed by the one or more processors, the one or more processors execute the parking stand scheduling method according to the first aspect or the second aspect of the present disclosure.

[0020] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores computer-readable instructions, and when the computer-readable instructions are executed by a processor, the processor causes the processor to execute the parking space scheduling method according to the first aspect or the second aspect of the present disclosure.

[0021] According to a fifth aspect of the present disclosure, a parking stand scheduling system is provided, including: a flight takeoff determination module, configured to determine, for a first flight whose scheduled parking stand is a far parking stand, that the first flight has taken off and is in flight; an available parking stand acquisition module, configured to acquire available parking stands for the first flight; and a parking stand scheduling module, configured to: when the available parking stands include a near parking stand, change the parking stand to be used for the first flight to the near parking stand; and when the available parking stands do not include a near parking stand, change the parking stand to be used for the first flight to a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand for the first flight by more than a taxiing time difference threshold.

[0022] According to a sixth aspect of the present disclosure, a parking stand scheduling system is provided, including: a parking stand exchange condition verification module, configured to determine, for a first flight whose planned parking stand is a far parking stand and a second flight whose planned parking stand is a near parking stand, that the planned parking stand of the first flight is available for the second flight, determine that the planned parking stand of the second flight is available for the first flight, and determine that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight; a flight takeoff determination module, configured to determine that the first flight has taken off and is in flight, and determine that the second flight has taken off and is in flight; and a parking stand scheduling module, configured to change the parking stand to be used for the first flight to the planned parking stand for the second flight, and change the parking stand to be used for the second flight to the planned parking stand for the first flight.

[0023] Other features and advantages of the present disclosure will become more apparent from the following detailed description of exemplary embodiments of the present disclosure with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The foregoing and other features and advantages of the present disclosure will become apparent from the following description of the embodiments of the present disclosure in conjunction with the accompanying drawings. The accompanying drawings are incorporated herein and form a part of the specification, and are further used to explain the principles of the present disclosure and enable those skilled in the art to make and use the present disclosure. Among them:

[0025] Figure 1 is a schematic block diagram illustrating a computer system on which embodiments of the present disclosure may be implemented;

[0026] Figure 2 is a flow chart illustrating a parking stand scheduling method according to some embodiments of the present disclosure;

[0027] Figure 3 is a flow chart illustrating a parking stand scheduling method according to some embodiments of the present disclosure;

[0028] Figure 4 is a flow chart illustrating an example parking stand scheduling process using the parking stand scheduling method according to an embodiment of the present disclosure;

[0029] Figure 5 is a schematic block diagram illustrating a parking stand scheduling system according to some embodiments of the present disclosure;

[0030] Figure 6 is a schematic block diagram illustrating a parking stand scheduling system according to some embodiments of the present disclosure; and

[0031] Figure 7 is a schematic block diagram illustrating a parking stand scheduling device according to some embodiments of the present disclosure.

[0032] Note that in the embodiments described below, sometimes the same reference numerals are used in common between different drawings to represent the same parts or parts with the same functions, and their repeated descriptions are omitted. In some cases, similar numbers and letters are used to represent similar items, so once an item is defined in one drawing, it does not need to be further discussed in subsequent drawings. DETAILED DESCRIPTION

[0033] Various exemplary embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. It should be noted that unless otherwise specifically stated, the relative arrangement of components and steps, numerical expressions and numerical values ​​set forth in these embodiments do not limit the scope of the present disclosure.

[0034] The following description of at least one exemplary embodiment is in fact merely illustrative and is in no way intended to limit the present disclosure and its application or use. That is, the structures and methods herein are shown in an exemplary manner to illustrate different embodiments of the structures and methods in the present disclosure. However, those skilled in the art will appreciate that they merely illustrate exemplary ways of the present disclosure that can be implemented, rather than exhaustive ways. In addition, the drawings need not be drawn to scale, and some features may be enlarged to illustrate the details of specific components.

[0035] In addition, technologies, methods, and apparatus known to ordinary technicians in the relevant field may not be discussed in detail, but where appropriate, such technologies, methods, and apparatus should be considered part of the authorization specification.

[0036] In all examples shown and discussed herein, any specific values ​​should be interpreted as merely exemplary and not as limiting. Therefore, other examples of the exemplary embodiments may have different values.

[0037] In the present disclosure, "flight" refers to the flight schedule of an aircraft, which is mainly divided into scheduled flights and irregular flights. Scheduled flights refer to scheduled flights with fixed times, fixed dates, fixed aircraft types and fixed routes published in the flight schedule. The remaining flights are usually irregular flights. In addition, flights flying on international routes are called international flights, and flights flying on domestic routes are called domestic flights. Multiple flights can be performed consecutively by the same aircraft, and each flight can have a preceding flight and / or a subsequent flight.

[0038] In the present disclosure, "parking stand occupation time period" refers to the time period during which an aircraft occupies a parking stand. The actual parking stand occupation time period is usually from a period of time before the on-block time of an incoming flight (usually 30 minutes) to a period of time after the off-block time of an outbound flight (the subsequent flight of an incoming flight) (usually 30 minutes). In the present disclosure, the "estimated parking stand occupation time period" can be estimated as from the estimated parking stand occupation start time to the estimated parking stand occupation end time, wherein the estimated parking stand occupation start time can be the time before the flight's estimated arrival time minus the preceding interval, and the estimated parking stand occupation end time can be the time after the flight's estimated arrival time plus the standard stopover guarantee time plus the subsequent interval.

[0039] In this disclosure, a "parking stand" is a designated location on the apron for parking aircraft, and is the operational end point for incoming aircraft and the operational starting point for outgoing aircraft. Parking stands can be divided into near stands (connected with a jet bridge to facilitate the direct movement of passengers between the terminal and the aircraft) and far stands (passengers are transported between the terminal and the aircraft by a shuttle bus). "Inbound taxi time of a parking stand" refers to the time between the actual arrival and actual block of an inbound flight at that parking stand, and "outbound taxi time of a parking stand" refers to the time between the actual removal of the block and the actual take-off of an outbound flight at that parking stand.

[0040] The following description is explained by taking an aircraft as an example, but in the present disclosure, the aircraft is not limited to an aircraft, but can be any suitable air vehicle. Moreover, the present disclosure can also be applied to other land or sea vehicles other than air vehicles.

[0041] As one of the most important resources of an airport, parking space resources are the key factors to achieve fast and safe flight parking, ensure efficient connection between flights, and improve the capacity and service efficiency of the entire airport. With the rapid development of the world's aviation industry, the number of flights landing and landing at airports around the world is increasing, resulting in a very tight situation for airport parking space resources. Improving the utilization rate of parking space resources has become one of the important issues that airports need to solve urgently. In order to ensure that each flight has a corresponding parking space, the airport usually allocates parking spaces for all aircraft for the next day one day in advance. However, even if the parking space allocation is completed one day in advance for the known static flight plan for the next day after considering many complex factors, the problem is that flights arrive in real time and usually not as planned. Therefore, in the actual operation of the next day, it may not be possible to achieve reasonable utilization of parking spaces. For example, for a flight that is greatly delayed, the airport will temporarily replace the near parking space originally intended for the flight with a far parking space so that the subsequent flight can take off as soon as possible. However, the idle near parking space is often not used in time. To this end, the present disclosure provides a parking stand scheduling technology, which can dynamically optimize the parking stands of flights that are about to arrive.

[0042] Figure 11 is a schematic block diagram illustrating a computer system 100 on which an embodiment of the present disclosure may be implemented. The computer system 100 includes a bus 106 or other communication mechanism for transmitting information, and a processor 101 coupled to the bus 106 for processing information. The computer system 100 also includes a storage device 102 coupled to the bus 106 for storing instructions to be executed by the processor 101, which may include a random access memory (RAM) or other dynamic storage device. The storage device 102 may also be used to store temporary variables or other intermediate information during the execution of instructions to be executed by the processor 101. The storage device 102 may also include a read-only memory (ROM) or other static storage device for storing static information and instructions for the processor 101. The storage device 102 may also include a storage device such as a magnetic disk or optical disk for storing information and instructions. The computer system 100 may include an input device 103 coupled to the bus 106 for transmitting information and command selections to the processor 101, such as a keyboard, a mouse, a touch pad, etc. The computer system 100 may include an output device 104, such as a display, a speaker, etc., coupled to the bus 106 for providing output to a user of the computer system 100. The computer system 100 may also include a network interface 105. In various embodiments, the computer system 100 may be connected to one or more other computer systems (such as the computer system 100) across a network to form a networked system. The network may include a private network or a public network such as the Internet. In a networked system, one or more computer systems may store data and supply data to other computer systems. Embodiments of the present disclosure may be implemented by the computer system 100 in response to the processor 101 executing one or more instructions contained in the storage device 102. Alternatively, a hardware circuit system may be used instead of a software instruction or in combination with a software instruction to implement the present disclosure. Therefore, the implementation of the present disclosure is not limited to any specific combination of hardware circuit systems and software.

[0043] Figure 2 FIG. 2 shows a parking stand scheduling method 200 according to some embodiments of the present disclosure. Figure 2 , the parking stand scheduling method 200 includes:

[0044] At step S202, for the first flight whose planned parking position is a remote parking position, it is determined that the first flight has taken off and is in flight;

[0045] At step S204, the available parking spaces of the first flight are obtained;

[0046] At step S206, when the available parking stands include a close parking stand, changing the parking stand to be used for the first flight to a close parking stand; and

[0047] At step S208, when the available parking stands do not include a close parking stand, the parking stand to be used for the first flight is changed to a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand for the first flight by more than a taxi time difference threshold.

[0048] Figure 5 The parking stand scheduling system 500 according to some embodiments of the present disclosure is shown. The parking stand scheduling system 500 includes a flight departure determination module 501, an available parking stand acquisition module 502, and a parking stand scheduling module 503. The parking stand scheduling system 500 can use the parking stand scheduling method 200 to schedule parking stands. Figure 2 and Figure 5 To describe the specific details of the parking stand scheduling method and system according to some embodiments of the present disclosure.

[0049] Step S202 can be performed by the flight departure determination module 501, for example. In some embodiments, in step S202, it can be determined whether the first flight whose planned parking position is a far parking position has an actual take-off time and an actual arrival time. If there is an actual take-off time but no actual arrival time, it means that the first flight has taken off and is in flight. The reason for determining that the first flight has taken off is that if it has not taken off, there may be too many changes in its arrival situation, and even if the parking position is rescheduled, it may ultimately be of no use. In addition, if the first flight has already arrived, there will be no time to implement the rescheduling, so it is meaningless.

[0050] Step S204 can be performed by the available parking space acquisition module 502, for example. In some embodiments, in step S204, the available parking space can be acquired by a greedy algorithm. A greedy algorithm means that when solving a problem, the best choice is always made at the moment, that is, the overall optimal solution is not considered, and the algorithm obtains a local optimal solution in a certain sense. In some embodiments, the available parking space of the first flight is idle during the estimated occupied parking space time period of the first flight, and meets the requirements of the approver, aircraft model, and domestic / international attributes of the first flight. In some embodiments, if the first flight has a subsequent flight, the available parking space of the first flight must also meet the requirements of the approver, aircraft model, and domestic / international attributes of the subsequent flight of the first flight.

[0051] Step S206 and step S208 can be performed by the parking stand scheduling module 503, for example. When the available parking stands include the near parking stands, the parking stands of the first flight are preferentially optimized as the near parking stands. In order to improve the docking rate, the airport can give priority to the near parking stands, which results in that there are usually no planned idle near parking stands after the parking stands are allocated one day in advance. However, depending on the actual flight arrival situation of the next day, there may be temporary idle near parking stands, for example, when the flight whose planned parking stand is the near parking stand is greatly delayed and thus adjusted to the far parking stand. Step S206 can optimize the parking stand of the first flight to the near parking stand if allowed, thereby improving the actual docking rate of the airport on that day. When the available parking stands do not include the near parking stands, the parking stand to be used for the first flight can be optimized to a far parking stand whose taxiing time is shorter than the taxiing time of the planned parking stand of the first flight by more than the taxiing time difference threshold.

[0052] In some embodiments, the taxiing time referred to in step S208 may include the taxiing time for departure and the taxiing time for arrival of the parking stand. The cost of each extra minute of taxiing of the aircraft is huge. Therefore, even if there is no near parking stand available at this time, the parking stand of the first flight can be optimized to a parking stand with a shorter taxiing time, thereby reducing the operating cost. The taxiing time difference threshold is set because the rescheduling of the parking stand also requires communication costs and there is a risk of a domino effect. Therefore, in order to maximize economic benefits, if the taxiing time of the available far parking stand and the planned parking stand is not much different, it may not be necessary to perform such rescheduling. In some embodiments, the taxiing time difference threshold can be set to 1 to 5 minutes, or 1 to 3 minutes, for example, it can be 2 minutes. Of course, it is also possible not to set such a taxiing time difference threshold or to set it to zero.

[0053] In some embodiments, the taxi time referred to in step S208 may also refer only to the departure taxi time of the parking stand. When there are many delays at the airport resulting in too many stranded flights, it is desirable that the flights depart as soon as possible. Therefore, in some embodiments, the method may further include, when the number of stranded flights at the airport exceeds a quantity threshold, changing the parking stand to be used for the first flight to a far parking stand whose departure taxi time is shorter than the departure taxi time of the planned parking stand for the first flight. The quantity threshold may be specifically set according to actual conditions.

[0054] For example, the outbound taxi time and inbound taxi time of the parking stand can be determined in the following manner. The actual arrival time and actual block time of the inbound flights of the parking stand in the past three years (or other suitable time periods) are obtained, and the difference between the actual block time and the actual arrival time is recorded as the inbound taxi time TA. According to the distribution of TA, 80% of all the data are dynamically taken out at the location in the data set to calculate the average value of TA as the inbound taxi time of the parking stand. Similarly, the actual off-block time and actual take-off time of the outbound flights of the parking stand in the past three years (or other suitable time periods) are obtained, and the difference between the actual take-off time and the actual off-block time is recorded as the outbound taxi time TD. According to the distribution of TD, 80% of all the data are dynamically taken out at the location in the data set to calculate the average value of TD as the outbound taxi time of the parking stand.

[0055] In some embodiments, the acquisition of available parking stands and the change of the parking stands to be used for the first flight may be performed at a time earlier than the expected arrival time of the first flight by more than a first time amount threshold. The first time amount threshold may depend on the preparation time required to reschedule the parking stands, for example, it may be 20 to 40 minutes or it may be 30 minutes. If the current time is already later than the time earlier than the expected arrival time of the first flight by the first time amount threshold, the parking stand scheduling may not be performed.

[0056] In some embodiments, the acquisition of available parking stands and the change of the parking stands to be used for the first flight may be performed at a time that is earlier than the estimated arrival time of the first flight by more than a first time threshold but not more than a second time threshold that is greater than the first time threshold. The second time threshold is set to prevent the parking stand scheduling method 200 from being executed too early, resulting in an inaccurate estimated arrival time of the first flight, causing a waste of parking stands, and also to prevent scheduling failure due to the lack of suitable available parking stands at this time.

[0057] In some embodiments, when the acquired available parking stands include neither a close parking stand nor a far parking stand whose taxi time is shorter than the taxi time of the scheduled parking stand of the first flight by more than a taxi time difference threshold, a period of time may be waited and available parking stands for the first flight may be reacquired until one of the following situations occurs: the reacquired available parking stands include a close parking stand or a far parking stand whose taxi time is shorter than the taxi time of the scheduled parking stand of the first flight by more than a taxi time difference threshold; the current time is earlier than the estimated arrival time of the first flight by no more than a first time amount threshold.

[0058] Figure 3 FIG. 3 shows a parking stand scheduling method 300 according to some embodiments of the present disclosure. Figure 3 , the parking stand scheduling method 300 includes:

[0059] At step S302, for a first flight whose planned parking position is a far parking position and a second flight whose planned parking position is a near parking position, it is determined that the planned parking position of the first flight is available for the second flight, it is determined that the planned parking position of the second flight is available for the first flight, and it is determined that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight;

[0060] At step S304, it is determined that the first flight has taken off and is in flight;

[0061] At step S306, it is determined that the second flight has taken off and is in flight; and

[0062] At step S308, the parking stand to be used for the first flight is changed to a planned parking stand for the second flight, and the parking stand to be used for the second flight is changed to a planned parking stand for the first flight.

[0063] Figure 6 The parking stand scheduling system 600 according to some embodiments of the present disclosure is shown. The parking stand scheduling system 600 includes a parking stand exchange condition verification module 601, a flight departure determination module 602, and a parking stand scheduling module 603. The parking stand scheduling system 600 can use the parking stand scheduling method 300 to schedule the parking stand. Figure 3 and Figure 6 To describe the specific details of the parking stand scheduling method and system according to some embodiments of the present disclosure.

[0064] Steps S304 and S306 may be performed by the flight departure determination module 602 , for example, and are similar to the aforementioned step S202 and the flight departure determination module 501 .

[0065] Step S302 can be performed, for example, by the parking stand exchange condition verification module 601 to determine whether the first flight and the second flight meet the conditions for exchanging parking stands. In some embodiments, determining that the planned parking stand of the first flight can be used for the second flight includes: determining that the planned parking stand of the first flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the second flight; and determining that the planned parking stand of the first flight is free within the expected occupied parking stand time period of the second flight after excluding the expected occupied parking stand time period of the first flight. In some embodiments, when the first flight has a subsequent flight, determining that the planned parking stand of the second flight can be used for the first flight also includes determining that the planned parking stand of the second flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the first flight. In some embodiments, determining that the planned parking stand of the second flight can be used for the first flight includes: determining that the planned parking stand of the second flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the first flight; and determining that the planned parking stand of the second flight is free within the expected occupied parking stand time period of the first flight after excluding the expected occupied parking stand time period of the second flight. In some embodiments, when the second flight has a subsequent flight, determining that the planned parking position of the first flight can be used for the second flight also includes determining that the planned parking position of the first flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the second flight. In addition, the number of shuttle bus trips required for the flight can be determined based on the number of passengers carried by the flight and the number of passengers carried by the shuttle bus. The number of passengers carried by the flight can be obtained from the booking information, check-in information, or boarding information of the flight. If the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight, it means that the shuttle bus resources consumed when the first flight is parked at a far parking position are greater than when the second flight is parked at a far parking position. Therefore, when the planned parking positions of the first flight and the second flight are available for each other, exchanging their parking positions can save shuttle bus resources.

[0066] Step S308, for example, may be performed by the parking stand scheduling module 603. In some embodiments, when at least one of the first flight and the second flight has a subsequent flight, the step of determining that the number of shuttle trips required for the first flight is greater than the number of shuttle trips required for the second flight may be modified to determining that the total number of shuttle trips required for the first flight and its subsequent flights (if any) is greater than the total number of shuttle trips required for the second flight and its subsequent flights (if any).

[0067] In some embodiments, the selection of the second flight must avoid VIP flights, that is, the second flight is not a VIP flight. The VIP flight referred to herein may refer to a flight carrying specific passengers (such as patients), important passengers (such as politicians), etc.

[0068] In some embodiments, the parking stand exchange of the first flight with the second flight may be performed at a time that is earlier than the expected arrival time of the first flight by more than a first time threshold and earlier than the expected arrival time of the second flight by more than a first time threshold. If the current time is already later than the time that is earlier than the expected arrival time of the first flight by the first time threshold or is already later than the time that is earlier than the expected arrival time of the second flight by the first time threshold, the parking stand exchange of the first flight with the second flight may not be performed. The execution order of the three determination sub-steps in step S302 and steps S304 and S306 is not limited and may be performed in any order or simultaneously. The three determination sub-steps in step S302 may even be performed before the first flight and / or the second flight take off. That is, in some embodiments, even if the first flight and the second flight have not taken off, it is possible to first determine whether the planned parking space of the first flight is available for the second flight, whether the planned parking space of the second flight is available for the first flight, and whether the number of shuttle trips required by the first flight is greater than the number of shuttle trips required by the second flight, and then perform the parking space exchange of the first flight and the second flight after the first flight and the second flight take off, at a time earlier than the expected arrival time of the first flight by more than the first time amount threshold and earlier than the expected arrival time of the second flight by more than the first time amount threshold. That is, an alternative flight that can exchange parking spaces with the first flight can be determined in advance.

[0069] Method 300 may be used in combination with method 200. Specifically, in some embodiments, when the available parking stands obtained in step S204 include neither a near parking stand nor a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand of the first flight by more than a taxiing time difference threshold, the parking stand scheduling method 200 may further include: for a second flight whose scheduled parking stand is a near parking stand, determining that the scheduled parking stand of the first flight is available for the second flight, determining that the scheduled parking stand of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight; determining that the second flight has taken off and is in flight; and changing the parking stand to be used for the first flight to the scheduled parking stand of the second flight, and changing the parking stand to be used for the second flight to the scheduled parking stand of the first flight.

[0070] Combine the following Figure 4 An exemplary parking stand scheduling process 400 using the parking stand scheduling method according to an embodiment of the present disclosure is described. Note that the process described below is merely illustrative and not restrictive.

[0071] At S401, flight F1 with a planned remote parking position S1 has taken off and is in flight. At S402, it is judged whether the current time is earlier than Ta minutes before the estimated arrival time of flight F1. If it is earlier, continue monitoring; otherwise, proceed to S403. At S403, it is judged whether the current time is earlier than Tb minutes (Tb < Ta) before the estimated arrival time of flight F1. If it is earlier, the parking position scheduling can continue; otherwise, as shown in S410, the parking position to be used for flight F1 will no longer be changed. Next, the parking position scheduling begins. At S404, it is judged whether there is a nearby parking position Sn available for flight F1. If there is, at S408, the parking position to be used for flight F1 is changed to the nearby parking position Sn. If not, proceed to S405 to judge whether there is a remote parking position Sf available for flight F1 and further judge at S406 whether the taxiing time of the available remote parking position Sf is less than Ts minutes more than the taxiing time of S1. If so, at S407, the parking position to be used for flight F1 is changed to the remote parking position Sf. If the answer is no at S405 or S406, there are then two options next. The first option, as shown by the dashed line, directly proceeds to S409, waits for ΔT minutes, and then returns to S403. The second option, as shown by the double-dashed line, attempts a parking position exchange. Specifically, at S411, flight F2 with a planned remote parking position S2 has taken off and is in flight. At S412, it is determined whether the remote parking position S1 is available for flight F2. At S413, it is determined whether the nearby parking position S2 is available for flight F1. At S414, it is determined whether the number of shuttle bus trips required for flight F1 is greater than the number of shuttle bus trips required for flight F2. The execution order of S412, S413, and S414 is not particularly restricted, and they can be executed in any order or simultaneously. When the determination results of all of S412, S413, and S414 are yes, at S415, the parking position to be used for flight F1 can be changed to the nearby parking position S2, and the parking position to be used for flight F2 can be changed to the remote parking position S1. If the determination result of any one of S412, S413, and S414 is no, the process can proceed to S409, or alternatively, another flight with a planned nearby parking position can be reselected to judge whether the conditions for exchanging the parking position with flight F1 are met. Alternatively, a flight with a planned nearby parking position that meets the conditions for exchanging the parking position with flight F1 can be selected first, and then the parking position can be exchanged with flight F1 after it takes off.

[0072] Figure 7A parking stand scheduling device 700 according to some embodiments of the present disclosure is shown. The parking stand scheduling device 700 may include one or more processors 701 and a memory 702. The one or more processors 701 may be coupled to the memory 702. The memory 702 may store computer-readable instructions that, when executed by the one or more processors 701, cause the one or more processors 701 to perform the parking stand scheduling method according to any embodiment of the present disclosure.

[0073] In the present disclosure, "processor" may refer to any computing processing unit or device with computing processing capabilities, including but not limited to a single-core processor; a single processor with software multi-threaded execution capabilities; a multi-core processor; a multi-core processor with software multi-threaded execution capabilities; a multi-core processor with hardware multi-threading technology; a parallel platform; and a parallel platform with distributed shared memory. In addition, a processor may refer to an integrated circuit, an application-specific integrated circuit (ASIC), a digital signal processor (DSP), a field programmable gate array (FPGA), a programmable logic controller (PLC), a complex programmable logic device (CPLD), a discrete gate or transistor logic, a discrete hardware component, or any combination thereof designed to perform the functions described herein. The processor may also be implemented as a combination of computing processing units. In the present disclosure, "memory" may be either a volatile memory or a non-volatile memory, or may include both a volatile memory and a non-volatile memory. As an illustration and not limitation, a non-volatile memory may include a read-only memory (ROM), a programmable ROM (PROM), an electrically programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), a flash memory, or a non-volatile random access memory (RAM) (e.g., a ferroelectric RAM (FeRAM)). By way of illustration and not limitation, volatile memory may include RAM, which is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), direct Rambus RAM (DRRAM), direct Rambus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM).

[0074] In addition, one aspect of the present disclosure further provides a non-transitory computer-readable storage medium, which can store computer-readable instructions, which, when executed by a processor, cause the processor to execute the parking space scheduling method described in any embodiment of the present disclosure. The computer-readable instructions described herein can be downloaded from the computer-readable storage medium to each computing and processing device, or downloaded to an external computer or external storage device via a network (e.g., the Internet, a local area network, a wide area network, and / or a wireless network). The network adapter card or network interface in each computing and processing device receives the computer-readable instructions from the network and forwards the computer-readable instructions for storage in the computer-readable storage medium in each computing and processing device. Examples of computer-readable storage media include, but are not limited to, read-only memory, random access memory, CD-ROM, DVD, magnetic tape, hard disk drive, solid-state drive, and optical data storage device, etc. The computer-readable storage medium can also be distributed in a network-coupled computer system so that the computer-readable instructions are stored and executed in a distributed manner.

[0075] As used herein, the word "exemplary" means "serving as an example, instance, or illustration" rather than as a "model" to be exactly copied. Any implementation described as exemplary herein is not necessarily to be construed as preferred or advantageous over other implementations. Furthermore, the present disclosure is not to be limited by any expressed or implied theory given in the technical field, background, summary, or detailed description.

[0076] In addition, for reference purposes only, "first", "second" and other similar terms may also be used herein, and thus are not intended to be limiting. For example, unless the context clearly indicates otherwise, the words "first", "second" and other such numerical terms referring to elements do not imply a sequence or order.

[0077] It should also be understood that when the term “include / comprises” is used in this document, it indicates the presence of the specified features, integers, steps, operations, units and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, units and / or components and / or their combinations.

[0078] As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items. The terms used herein are for the purpose of describing specific embodiments only and are not intended to limit the present disclosure. As used herein, the singular forms "a", "an", and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise.

[0079] Those skilled in the art will appreciate that the boundaries between the above steps or operations are merely illustrative. Multiple steps or operations can be combined into a single step or operation, which can be distributed in additional steps or operations, and the steps or operations can be performed at least partially overlapping in time. Moreover, alternative embodiments may include multiple instances of specific steps or operations, and the order of steps or operations can be changed in other various embodiments. However, other modifications, variations and replacements are equally possible. Aspects and elements of all embodiments disclosed above can be combined in any manner and / or in combination with aspects or elements of other embodiments to provide multiple additional embodiments. Therefore, this specification and accompanying drawings should be considered illustrative, not restrictive.

[0080] The flowcharts and block diagrams in the accompanying drawings show the possible architectures, functions and operations of the methods, systems, devices, equipment and computer-readable storage media according to multiple embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of an instruction, and a part of the module, program segment or instruction contains one or more executable instructions for implementing a specified logical function. It should be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0081] The present disclosure may also include the following examples.

[0082] Example 1: A parking stand scheduling method, comprising:

[0083] For a first flight whose planned parking position is a remote parking position, determining that the first flight has taken off and is in flight;

[0084] Obtaining available parking spaces for the first flight;

[0085] When the available parking stands include a close parking stand, changing the parking stand to be used for the first flight to the close parking stand; and

[0086] When the available parking stands do not include a close parking stand, the parking stand to be used for the first flight is changed to a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand of the first flight by more than a taxi time difference threshold.

[0087] Example 2: The parking stand scheduling method according to Example 1, wherein the obtaining and the changing are performed at a time that exceeds a first time amount threshold earlier than the estimated arrival time of the first flight.

[0088] Example 3: The parking stand scheduling method according to Example 2, wherein:

[0089] The obtaining and the modifying are performed at a time that is earlier than the estimated arrival time of the first flight by more than the first amount of time threshold but no more than a second amount of time threshold that is greater than the first amount of time threshold.

[0090] Example 4: The parking stand scheduling method according to Example 1 further includes:

[0091] When the available parking stands include neither a close parking stand nor a far parking stand whose taxiing time is shorter than the taxiing time of the planned parking stand of the first flight by more than a taxiing time difference threshold, wait for a period of time and re-acquire the available parking stands of the first flight until one of the following situations occurs:

[0092] The reacquired available parking stands include a close parking stand or a far parking stand whose taxiing time is shorter than the taxiing time of the planned parking stand of the first flight by more than a taxiing time difference threshold;

[0093] The current time is earlier than the estimated arrival time of the first flight by no more than a first amount of time threshold.

[0094] Example 5. A parking stand scheduling method according to Example 1, wherein the available parking stands of the first flight are idle during the estimated parking stand occupancy time period of the first flight and meet the requirements of the approver, aircraft model, and domestic / international attributes of the first flight.

[0095] Example 6. The parking stand scheduling method according to Example 5, wherein, when the first flight has a subsequent flight, the available parking stands of the first flight also meet the requirements of the approver, aircraft model, and domestic / international attributes of the subsequent flight of the first flight.

[0096] Example 7: The parking stand scheduling method according to Example 1, wherein the taxi time of the parking stand includes the outbound taxi time and the inbound taxi time of the parking stand.

[0097] Example 8. The parking stand scheduling method according to Example 1 further includes: when the number of stranded flights at an airport exceeds a quantity threshold, changing the parking stand to be used for the first flight to a remote parking stand whose departure taxi time is shorter than the departure taxi time of the planned parking stand for the first flight.

[0098] Example 9. The parking stand scheduling method according to Example 1, wherein when the available parking stands include neither a close parking stand nor a far parking stand whose taxiing time is shorter than the taxiing time of the planned parking stand of the first flight by more than a taxiing time difference threshold, the parking stand scheduling method further includes:

[0099] For a second flight whose scheduled parking position is a close parking position, determining that the scheduled parking position of the first flight is available for the second flight, determining that the scheduled parking position of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight;

[0100] determining that the second flight has taken off and is en route; and

[0101] The parking stand to be used for the first flight is changed to the planned parking stand for the second flight, and the parking stand to be used for the second flight is changed to the planned parking stand for the first flight.

[0102] Example 10. The parking stand scheduling method according to Example 9, wherein:

[0103] Determining that a scheduled parking slot for the first flight is available for the second flight includes:

[0104] Determining that the planned parking slots for the first flight meet the requirements of the approver, aircraft type, and domestic / international attributes of the second flight; and

[0105] determining that the planned parking stand of the first flight is free during the estimated occupied parking stand time period of the second flight after excluding the estimated occupied parking stand time period of the first flight, and

[0106] Determining that the scheduled parking slot for the second flight is available for the first flight includes:

[0107] Determining that the planned parking slots for the second flight meet the requirements of the approver, aircraft type, and domestic / international attributes of the first flight; and

[0108] It is determined that the planned parking stand of the second flight is free within the estimated occupied parking stand time period of the first flight after excluding the estimated occupied parking stand time period of the second flight.

[0109] Example 11. The parking stand scheduling method according to Example 10, wherein:

[0110] When the first flight has a subsequent flight, determining that a planned parking space for the second flight is available for the first flight further includes:

[0111] Determining that the planned parking slot for the second flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flights of the first flight; and

[0112] When the second flight has a subsequent flight, determining that a planned parking space of the first flight is available for the second flight further includes:

[0113] Determine that the planned parking space of the first flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the second flight.

[0114] Example 12. A parking stand scheduling method according to Example 11, wherein, when the first flight and the second flight have subsequent flights, it is determined that the total number of shuttle bus trips required for the first flight and its subsequent flights is greater than the total number of shuttle bus trips required for the second flight and its subsequent flights.

[0115] Example 13. A parking stand scheduling method according to Example 9, wherein the change is performed at a time that is earlier than the expected arrival time of the first flight by more than a first time amount threshold and earlier than the expected arrival time of the second flight by more than a first time amount threshold.

[0116] Example 14. The parking stand scheduling method according to Example 9, wherein the second flight is not a VIP flight.

[0117] Example 15. The parking space scheduling method according to Example 1, wherein the available parking spaces are obtained through a greedy algorithm.

[0118] Example 16: A parking stand scheduling method, comprising:

[0119] For a first flight whose planned parking position is a far parking position and a second flight whose planned parking position is a near parking position, determining that the planned parking position of the first flight is available for the second flight, determining that the planned parking position of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight;

[0120] Determining that the first flight has taken off and is in flight;

[0121] determining that the second flight has taken off and is en route; and

[0122] The parking stand to be used for the first flight is changed to the planned parking stand for the second flight, and the parking stand to be used for the second flight is changed to the planned parking stand for the first flight.

[0123] Example 17: A parking stand scheduling device, comprising:

[0124] one or more processors; and

[0125] A memory storing computer-readable instructions, which, when executed by the one or more processors, cause the one or more processors to perform a parking stand scheduling method according to any one of Examples 1 to 16.

[0126] Example 18. A non-transitory computer-readable storage medium storing computer-readable instructions, which, when executed by a processor, causes the processor to perform a parking space scheduling method according to any one of Examples 1 to 16.

[0127] Example 19: A parking stand scheduling system, comprising:

[0128] A flight departure determination module, configured to determine, for a first flight whose scheduled parking position is a remote parking position, that the first flight has taken off and is in flight;

[0129] an available parking space acquisition module, configured to acquire an available parking space for the first flight; and

[0130] The parking stand scheduling module is configured to:

[0131] When the available parking stands include a close parking stand, changing the parking stand to be used for the first flight to the close parking stand; and

[0132] When the available parking stands do not include a close parking stand, the parking stand to be used for the first flight is changed to a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand of the first flight by more than a taxi time difference threshold.

[0133] Example 20: A parking stand scheduling system, comprising:

[0134] The parking stand exchange condition verification module is configured to determine, for a first flight whose planned parking stand is a far parking stand and a second flight whose planned parking stand is a near parking stand, that the planned parking stand of the first flight is available for the second flight, determine that the planned parking stand of the second flight is available for the first flight, and determine that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight;

[0135] a flight departure determination module, configured to determine that the first flight has taken off and is in flight, and to determine that the second flight has taken off and is in flight; and

[0136] The parking stand scheduling module is configured to change the parking stand to be used for the first flight to the planned parking stand for the second flight, and change the parking stand to be used for the second flight to the planned parking stand for the first flight.

[0137] Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. The various embodiments disclosed herein may be combined in any manner without departing from the spirit and scope of the present disclosure. It should also be understood by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.

Claims

1. A parking stand scheduling method, comprising: For a first flight whose planned parking position is a remote parking position, determining that the first flight has taken off and is in flight; Obtaining available parking spaces for the first flight; When the available parking stands include a close parking stand, changing the parking stand to be used for the first flight to the close parking stand; as well as When the available parking stands do not include a close parking stand, changing the parking stand to be used for the first flight to a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand for the first flight by more than a taxi time difference threshold; as well as When the available parking stands include neither a close parking stand nor a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand of the first flight by more than a taxiing time difference threshold: For a second flight whose scheduled parking position is a close parking position, determining that the scheduled parking position of the first flight is available for the second flight, determining that the scheduled parking position of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight, Determining that the second flight has taken off and is en route, The parking stand to be used for the first flight is changed to the scheduled parking stand for the second flight, and the parking stand to be used for the second flight is changed to the scheduled parking stand for the first flight.

2. The parking stand scheduling method according to claim 1, wherein: The obtaining and the modifying are performed at a time that is more than a first amount of time threshold earlier than an estimated arrival time of the first flight.

3. The parking stand scheduling method according to claim 2, wherein: The obtaining and the modifying are performed at a time that is earlier than the estimated arrival time of the first flight by more than the first amount of time threshold but no more than a second amount of time threshold that is greater than the first amount of time threshold.

4. The parking stand scheduling method according to claim 1, wherein: The available parking stands of the first flight are free within the estimated parking stand occupation time period of the first flight and meet the requirements of the approver, aircraft type, and domestic / international attributes of the first flight.

5. The parking stand scheduling method according to claim 4, wherein: When the first flight has a subsequent flight, the available parking spaces of the first flight also meet the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the first flight.

6. The parking stand scheduling method according to claim 1, wherein: The taxi time of a parking stand includes the departure taxi time and arrival taxi time of the parking stand.

7. The parking stand scheduling method according to claim 1, further comprising: When the number of stranded flights at the airport exceeds a quantity threshold, the parking stand to be used for the first flight is changed to a remote parking stand whose departure taxi time is shorter than the departure taxi time of the planned parking stand for the first flight.

8. The parking stand scheduling method according to claim 1, wherein: Determining that a scheduled parking slot for the first flight is available for the second flight includes: Determining that the planned parking slots for the first flight meet the requirements of the approver, aircraft type, and domestic / international attributes of the second flight; and determining that the planned parking stand of the first flight is free during the estimated occupied parking stand time period of the second flight after excluding the estimated occupied parking stand time period of the first flight, and Determining that the scheduled parking slot for the second flight is available for the first flight includes: Determining that the planned parking slots for the second flight meet the requirements of the approver, aircraft type, and domestic / international attributes of the first flight; and It is determined that the planned parking stand of the second flight is free within the estimated occupied parking stand time period of the first flight after excluding the estimated occupied parking stand time period of the second flight.

9. The parking stand scheduling method according to claim 8, wherein: When the first flight has a subsequent flight, determining that a planned parking space for the second flight is available for the first flight further includes: Determining that the planned parking slot for the second flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flights of the first flight; and When the second flight has a subsequent flight, determining that a planned parking space of the first flight is available for the second flight further includes: Determine that the planned parking space of the first flight meets the requirements of the approver, aircraft type, and domestic / international attributes of the subsequent flight of the second flight.

10. The parking stand scheduling method according to claim 9, wherein: When the first flight and the second flight have subsequent flights, it is determined that the total number of ferry trips required for the first flight and its subsequent flights is greater than the total number of ferry trips required for the second flight and its subsequent flights.

11. The parking stand scheduling method according to claim 1, wherein: The altering is performed at a time that is more than a first amount of time threshold earlier than an estimated arrival time of the first flight and more than a first amount of time threshold earlier than an estimated arrival time of the second flight.

12. The parking stand scheduling method according to claim 1, wherein: The second flight is not a VIP flight.

13. The parking stand scheduling method according to claim 1, wherein: Available parking slots are obtained using a greedy algorithm.

14. A parking stand scheduling device, comprising: one or more processors; as well as A memory storing computer readable instructions, which, when executed by the one or more processors, cause the one or more processors to perform the parking stand scheduling method according to any one of claims 1 to 13.

15. A non-transitory computer-readable storage medium storing computer-readable instructions, which, when executed by a processor, cause the processor to perform the parking stand scheduling method according to any one of claims 1 to 13.

16. A parking stand scheduling system, comprising: A flight departure determination module, configured to determine, for a first flight whose scheduled parking position is a remote parking position, that the first flight has taken off and is in flight; An available parking space acquisition module, configured to acquire an available parking space for the first flight; as well as The parking stand scheduling module is configured to: When the available parking stands include a close parking stand, changing the parking stand to be used for the first flight to the close parking stand; When the available parking stands do not include a close parking stand, changing the parking stand to be used for the first flight to a far parking stand whose taxi time is shorter than the taxi time of the planned parking stand for the first flight by more than a taxi time difference threshold; as well as When the available parking stands include neither a close parking stand nor a far parking stand whose taxiing time is shorter than the taxiing time of the scheduled parking stand of the first flight by more than a taxiing time difference threshold: For a second flight whose scheduled parking position is a close parking position, determining that the scheduled parking position of the first flight is available for the second flight, determining that the scheduled parking position of the second flight is available for the first flight, and determining that the number of shuttle bus trips required for the first flight is greater than the number of shuttle bus trips required for the second flight, Determining that the second flight has taken off and is en route, The parking stand to be used for the first flight is changed to the scheduled parking stand for the second flight, and the parking stand to be used for the second flight is changed to the scheduled parking stand for the first flight.

Images