CN110175743B - Dynamic allocation method for airport apron removal - Google Patents

Dynamic allocation method for airport apron removal Download PDF

Info

Publication number
CN110175743B
CN110175743B CN201910324179.9A CN201910324179A CN110175743B CN 110175743 B CN110175743 B CN 110175743B CN 201910324179 A CN201910324179 A CN 201910324179A CN 110175743 B CN110175743 B CN 110175743B
Authority
CN
China
Prior art keywords
flight
time
ice
distributed
estimated
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910324179.9A
Other languages
Chinese (zh)
Other versions
CN110175743A (en
Inventor
周洪涛
余明晖
曾伟
潘林强
江耀东
段连浪
袁成斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201910324179.9A priority Critical patent/CN110175743B/en
Publication of CN110175743A publication Critical patent/CN110175743A/en
Application granted granted Critical
Publication of CN110175743B publication Critical patent/CN110175743B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063114—Status monitoring or status determination for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a dynamic allocation method for airport ice terrace removal, which comprises the following steps: (1) screening the ice terrace removing set Q selectable by the flight to be distributed according to the hard service constraint0(ii) a (2) Obtaining a deicing plateau set Q by calculating the predicted entry time and the predicted exit time of the flights to be distributed1(ii) a (3) If no terrace aggregate Q1In the set Q of ice terrace for non-empty set1Screening the deicing lawn with the earliest estimated lawn time in the middle, and turning to the step (4); otherwise, delaying the predicted entering time of the flight to be distributed, and collecting Q in the ice terrace removing set0Screening the deicing lawn with the earliest estimated lawn time in the middle, and turning to the step (4); (4) and before the flight enters the airport, judging whether the flight state at the current moment is changed in real time, if so, turning to the step S2, otherwise, maintaining the existing distribution result. The invention considers the hard service constraint and the time constraint, and simultaneously adjusts the distribution scheme in time according to the real-time monitoring of the flight state to be distributed, thereby not only improving the working efficiency of the distributor, but also improving the distribution accuracy.

Description

Dynamic allocation method for airport apron removal
Technical Field
The invention belongs to the field of scheduling distribution, and particularly relates to a dynamic distribution method for airport deicing plateaus.
Background
In winter, the ice on the surface of the airplane can be frozen in cold ice and snow weather, the air transportation safety is damaged, and the deicing of the ground of the airplane is an important guarantee for the safe operation of flights in winter.
The distribution problem of the airport deicing plateaus is a highly real-time dynamic distribution problem, the domestic airports basically still adopt a manual distribution method, however, with the continuous expansion of the airport scale, flights needing deicing in cold ice and snow weather in winter grow exponentially, which brings huge workload to workers, and the manual distribution is very easy to make mistakes during the departure peak period on duty, so that the intellectualization and the convenience of the distribution of the airport deicing plateaus are urgently realized. The problem of airport deicing apron distribution is solved, airport resources can be fully utilized, and airport operation benefits and service quality are improved.
In the current stage of research on the distribution problem of the airport ice lawn removal, most of the methods such as the traditional genetic algorithm, the queuing theory, the game theory and the like are adopted, and the method stays in the static distribution stage. However, in actual work, the distributor is highly dependent on information transmitted by the air traffic control in real time and information obtained from the radar of the field monitor in real time when the ice terrace is distributed. When a flight applies for deicing, an allocator allocates one deicing apron in real time according to the current occupancy of each deicing apron and the slide way, and continuously adjusts the deicing aprons according to real-time information, which is a highly real-time dynamic allocation process.
Disclosure of Invention
Aiming at the defects of the prior art, the invention aims to provide a dynamic allocation method of airport deicing aprons, and aims to solve the problem of low static allocation efficiency of airport deicing aprons.
In order to achieve the above object, the present invention provides a dynamic allocation method for airport ice apron removal, comprising:
s1: screening the ice terrace removing set Q selectable by the flight to be distributed according to the hard service constraint0；
S2: obtaining a set Q for removing ice aprons which do not meet the time constraint by calculating the predicted time for entering the aprons and the predicted time for leaving the aprons of the flights to be distributed1；
S3: judging ice terrace removing set Q1If it is empty, if the ice terrace is removed, set Q1If the set is not an empty set, the set Q is in the ice terrace removing set1Screening the deicing plateaus with the earliest estimated plateau time to obtain a distribution result, and turning to the step S4; otherwise, after delaying the assignment of the flight's time to enter the plateau, divideIceground set Q0Screening the deicing plateaus with the earliest estimated plateau time to obtain a distribution result, and turning to the step S4;
s4: before the flight leaves the airport, judging whether the flight state changes in real time, if so, turning to the step S2, otherwise, maintaining the distribution result;
preferably, the hard traffic constraint comprises: the number of the ice aprons corresponds to the model constraint, the unit constraint of the flights to which the units of the ice aprons belong corresponds to the unit constraint of the flights to which the units of the ice aprons belong, and the position constraint of the ice aprons to which the positions of the flight berths correspond to the positions of the ice aprons.
The step S2 obtains the ice terrace detachment set Q1The method comprises the following steps:
s2.1 calculating set Q of ice terrace removing0The flight sets which are distributed in all the ice aprons and are not empowered are determined;
s2.2, judging whether the flight set which is distributed in each deicing station and has no station is empty, and if the flight set is not empty, turning to the step S2.3;
s2.3, respectively calculating the estimated apron entering time and the estimated apron exiting time of the flights to be distributed and the distributed and undistributed flight sets;
s2.4, according to the calculation in the step S2.3, judging whether the flight to be distributed and the flight without taking the flight have overlapping of the occupied time, if so, removing the ice pad corresponding to the flight without taking the flight to obtain an ice pad set Q1。
Preferably, the method for calculating the estimated entering time and the estimated exiting time of the flight to be allocated comprises the following steps:
(1) judging the current position of the flight, and if the flight sends an deicing application but does not slide out of the parking space, turning to the step (2); if the flight has already slipped out of the parking space but has not entered the floor, go to step (3); if the flight has entered the level, go to step (4);
(2) according to the current time T and the application time T for sending deicing to the flightaCalculating the estimated time T to enter the plateau of the flight to be allocatedeAnd the estimated plateau time Tl；
Wherein, Tl＝Te+T3；
If Ta+T1T, then Te＝Ta+T1+T2(ii) a If Ta+T1If < T, then Te＝t；
(3) According to the current time T and the time T of the flight sliding out of the standsCalculating the estimated time T to enter the plateau of the flight to be allocatedeAnd the estimated plateau time Tl；
Wherein, Tl＝Te+T3；
If Ts+T2T, then Te＝Ts+T2(ii) a If Ts+T2If < T, then Te＝t；
(4) Calculating the predicted entering time T of the flight to be distributed according to the current time TeAnd the estimated plateau time Tl；
Wherein if Te+T3T, then Tl＝Te+T3(ii) a If Te+T3If < T, then Tl＝t；
Wherein, T1Time from applying for de-icing to docking for the flight; t is2Time for flights from berthing to each de-icepad; t is3The flight takes time to remove the ice pad.
The method for delaying the predicted entering time of the distributed flights comprises the following steps:
when removing plateau set Q1When the flight is empty, the estimated entering time of the flight to be allocated for removing each deicing plateau is the estimated exiting time of the previous flight allocated to each deicing plateau +1 min.
The change in flight status includes: the flight status changes from normal to urgent and the flight is not settled, or the urgent changes to delayed and the flight is not settled.
The method for judging the flight state comprises the following steps:
if the estimated time of taking out the flight to be distributed is later than the estimated taking-off time and the time difference is less than the threshold time, the flight is a normal flight;
if the current time is later than the expected takeoff time and the time difference is greater than the threshold time, the flight is a delayed flight;
otherwise, the flight is an emergency flight.
Preferably, the threshold time is 25 minutes.
Through the technical scheme, compared with the prior art, the invention can obtain the following advantages
Has the advantages that:
(1) on one hand, the invention obtains the ice terrace removing set Q by considering hardware business constraint and time constraint1Then, in order to improve distribution efficiency, a ice terrace removing set Q is further screened1The deicing plateau with the earliest plateau time is predicted; on the other hand, the estimated time for entering and leaving the flight of the flight to be distributed is updated by monitoring the change of the actual state of the flight to be distributed, so that the assignment scheme is timely adjusted while the flight to be distributed is monitored in real time, and the working efficiency of an assignor is greatly improved.
(2) Firstly, comprehensively considering hard service constraint and time constraint, selecting the optimal ice terrace corresponding to the flight to be distributed, continuously screening and determining an ice terrace set for three times, and completing a pre-distribution process; and then, the estimated time for entering and leaving the flight corresponding to the flight to be distributed is fed back and updated in real time in combination with the actual flight state, and the ice terrace corresponding to the flight to be distributed is redistributed.
Drawings
FIG. 1 is a flow chart of a method for airport de-icing apron assignment provided by the present invention;
FIG. 2 shows a set Q of screened deicing plateaus provided by the present invention1Is a schematic flow diagram.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, the present invention provides a dynamic allocation method for airport ice apron removal, comprising:
s1: screening the ice terrace removing set Q selectable by the flight to be distributed according to the hard service constraint0；
S2: obtaining a set Q for removing ice aprons which do not meet the time constraint by calculating the predicted time for entering the aprons and the predicted time for leaving the aprons of the flights to be distributed1；
S3: judging ice terrace removing set Q1If it is empty, if the ice terrace is removed, set Q1If the set is not an empty set, the set Q is in the ice terrace removing set1Screening the deicing plateaus with the earliest estimated plateau time to obtain a distribution result, and turning to the step S4; otherwise, delaying the time of allocating flights to enter the flight level, and collecting Q in the ice level removing set0Screening the deicing plateaus with the earliest estimated plateau time to obtain a distribution result, and turning to the step S4;
generally, if the plateau is removed, Q1When the flight is empty, adjusting the estimated entering time of the flight to be distributed to be one minute after the departure time of the flight on each ice removal plateau;
s4: and before the flight leaves the airport, judging whether the flight state changes in real time, if so, turning to the step S2, otherwise, maintaining the distribution result. Preferably, the hard traffic constraint comprises: the number of the ice aprons corresponds to the model constraint, the unit constraint of the flights to which the units of the ice aprons belong corresponds to the unit constraint of the flights to which the units of the ice aprons belong, and the position constraint of the ice aprons to which the positions of the flight berths correspond to the positions of the ice aprons.
As shown in fig. 2, the above step S2 obtains the ice pad detachment set Q1The method of (1), comprising:
s2.1 calculating set Q of ice terrace removing0The flight sets which are distributed in all the ice aprons and are not empowered are determined;
s2.2, judging whether the flight set which is distributed in each deicing station and has no station is empty, and if the flight set is not empty, turning to the step S2.3;
s2.3, respectively calculating the estimated apron entering time and the estimated apron exiting time of the flights to be distributed and the distributed and undistributed flight sets;
s2.4, according to the calculation in the step S2.3, judging whether the occupied space time of the flight to be distributed and the flight without leaving the flight are overlapped, if so, removing the ice terrace corresponding to the distributed flight without leaving the flight, and acquiring an ice terrace set Q1。
Preferably, the method for calculating the estimated entering time and the estimated exiting time of the flight to be allocated comprises the following steps:
(1) judging the current position of the flight, and if the flight has a deicing application but does not slide out of the parking space, turning to the step (2); if the flight has already slipped out of the parking space but has not entered the floor, go to step (3); if the flight has entered the level, go to step (4);
(2) according to the current time T and the application time T for sending deicing to the flightaCalculating the estimated time T to enter the plateau of the flight to be allocatedeAnd the estimated plateau time Tl；
Wherein, Tl＝Te+T3；
If Ta+T1T, then Te＝Ta+T1+T2(ii) a If Ta+T1If < T, then Te＝t；
(3) According to the current time T and the time T of the flight sliding out of the standsCalculating the estimated time T to enter the plateau of the flight to be allocatedeAnd the estimated plateau time Tl；
Wherein, Tl＝Te+T3；
If Ts+T2T, then Te＝Ts+T2(ii) a If Ts+T2If < T, then Te＝t；
(4) Calculating the predicted entering time T of the flight to be distributed according to the current time TeAnd the estimated plateau time Tl；
Wherein if Te+T3T, then Tl＝Te+T3(ii) a If Te+T3If < T, then Tl＝t；
Wherein, T1Time from applying for de-icing to sliding out of the stand for the flight; t is2The time for the flight from the slide-out flight level to each ice pad; t is3The flight takes time to remove the ice pad.
T1The method comprises the steps of calculating the average time from applying for deicing to stopping of a flight to be distributed in one month to obtain the average time; t is3The initial value is the time of taking the flight of the first flight in each ice terrace on the day, and each ice terrace in one month is calculatedAverage take-over time for flights in the ice terrace, starting with the second flight, T3The mean of the time of flight in the plateau is the previous flight.
Preferably, the method for delaying the estimated approach time of the flight to be allocated comprises: when removing plateau set Q1When the flight is empty, the estimated entering time of the flight to be allocated for removing each deicing plateau is the estimated exiting time of the previous flight allocated to each deicing plateau +1 min.
The change in flight status includes: the flight status changes from normal to urgent and the flight is not settled, or the urgent changes to delayed and the flight is not settled.
The method for judging the flight state comprises the following steps:
if the estimated time of taking the flight to be distributed is later than the estimated taking-off time and the time difference is less than the threshold time, the flight is a normal flight;
if the current time is later than the expected takeoff time and the time difference is greater than the threshold time, the flight is a delayed flight;
otherwise, the flight is an emergency flight.
Preferably, the threshold time is 25 minutes.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims (6)

1. A method for dynamically allocating ice pads on an airport, comprising:
s1: screening the ice terrace removing set Q selectable by the flight to be distributed according to the hard service constraint0；
S2: obtaining a set Q for removing ice aprons which do not meet the time constraint by calculating the estimated time for entering the aprons and the estimated time for leaving the aprons of the flights to be distributed1；
The step S2 obtains the ice terrace removing set Q1The method of (1), comprising:
s2.1 calculating set Q of ice terrace removing0The flight sets which are distributed in all the ice aprons and are not empowered are determined;
s2.2, judging whether the flight set which is distributed in each deicing station and has no station is empty, and if the flight set is not empty, turning to the step S2.3;
s2.3, respectively calculating the estimated apron entering time and the estimated apron exiting time of the flight to be distributed and the distributed and undistributed flight set;
s2.4, according to the calculation in the step S2.3, judging whether the flight to be distributed and the flight without taking the flight have overlapping of the time of taking the flight, if so, removing the ice terrace corresponding to the flight without taking the flight, and obtaining an ice terrace set Q1；
The calculation method of the estimated entering time and the estimated exiting time of the flight to be distributed comprises the following steps:
(1) judging the current position of the flight, and if the flight sends an deicing application but does not slide out of the parking space, turning to the step (2); if the flight has already slipped out of the parking space but has not entered the floor, go to step (3); if the flight has entered the level, go to step (4);
(2) according to the current time T and the application time T for sending deicing to the flightaCalculating the predicted time T of entering the level of the flight to be distributedeAnd the estimated plateau time TL；
Wherein, TL＝Te+T3；
If Ta+T1T, then Te＝Ta+T1+T2(ii) a If Ta+T1If < T, then Te＝t；
(3) According to the current time T and the time T when the flight slides out of the standsCalculating the predicted time T of entering the level of the flight to be distributedeAnd the estimated plateau time TL；
Wherein, TL＝Te+T3；
If Ts+T2T, then Te＝Ts+T2(ii) a If Ts+T2If < T, then Te＝t；
(4) Calculating the predicted entering time T of the flight to be distributed according to the current time TeAnd the estimated plateau time TL；
Wherein if Te+T3T, then TL＝Te+T3(ii) a If Te+T3If < T, then TL＝t；
Wherein, T1Time from applying for de-icing to sliding out of the stand for the flight; t is2The time for the flight from the slide-out flight level to each ice pad; t is3Time to take the flight to remove the ice pad;
s3: judging ice terrace removing set Q1If it is empty, if the ice terrace is removed, set Q1If the set is not an empty set, the set Q is in the ice terrace removing set1Screening the deicing plateaus with the earliest predicted plateau time to obtain a distribution result, and turning to the step S4;
otherwise, delaying the predicted entering time of the flight to be distributed and then collecting Q in the ice terrace removing set0Screening the deicing plateaus with the earliest predicted plateau time to obtain a distribution result, and turning to the step S4;
s4: and before the flight enters the airport, judging whether the flight state at the current moment is changed in real time, if so, turning to the step S2, otherwise, maintaining the distribution result.
2. The dynamic allocation method of claim 1, wherein the hard traffic constraints comprise: the number of the ice aprons corresponds to the model constraint, the unit constraint of the flights to which the units of the ice aprons belong corresponds to the unit constraint of the flights to which the units of the ice aprons belong, and the position constraint of the ice aprons to which the positions of the flight berths correspond to the positions of the ice aprons.
3. The dynamic allocation method according to claim 1, wherein the method of delaying the estimated arrival time of the flight to be allocated is:
when removing plateau set Q1When the flight is empty, the estimated entering time of the flight to be allocated for removing each deicing plateau is the estimated exiting time of the previous flight allocated to each deicing plateau for +1 min.
4. The dynamic allocation method of claim 1, wherein the change in flight status comprises: the flight status changes from normal to urgent and the flight is not settled, or the urgent changes to delayed and the flight is not settled.
5. The dynamic allocation method according to claim 4, wherein the flight status is determined by:
if the estimated time of taking out the flight to be distributed is later than the estimated taking-off time and the time difference is less than the threshold time, the flight is a normal flight;
if the current time is later than the expected takeoff time and the time difference is greater than the threshold time, the flight is a delayed flight;
otherwise, the flight is an emergency flight.
6. The dynamic allocation method of claim 5, wherein said threshold time is 25 minutes.
CN201910324179.9A 2019-04-22 2019-04-22 Dynamic allocation method for airport apron removal Active CN110175743B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910324179.9A CN110175743B (en) 2019-04-22 2019-04-22 Dynamic allocation method for airport apron removal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910324179.9A CN110175743B (en) 2019-04-22 2019-04-22 Dynamic allocation method for airport apron removal

Publications (2)

Publication Number Publication Date
CN110175743A CN110175743A (en) 2019-08-27
CN110175743B true CN110175743B (en) 2021-06-29

Family

ID=67689849

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910324179.9A Active CN110175743B (en) 2019-04-22 2019-04-22 Dynamic allocation method for airport apron removal

Country Status (1)

Country Link
CN (1) CN110175743B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114491317B (en) * 2022-04-18 2022-06-21 中国民航大学 Centralized deicing operation method and system for airplane, storage medium and computer equipment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101100222A (en) * 2007-07-18 2008-01-09 中国民航大学 Integral concentration deicing system for airplane
US7725410B2 (en) * 2005-08-18 2010-05-25 The United States Of America As Represented By The Secretary Of Transportation Method, apparatus and system for aircraft deicing and estimating deicing completion times
CN107393348A (en) * 2017-07-10 2017-11-24 南京航空航天大学 Enter station departure flight collaboration sort method under a kind of information sharing mechanism

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7725410B2 (en) * 2005-08-18 2010-05-25 The United States Of America As Represented By The Secretary Of Transportation Method, apparatus and system for aircraft deicing and estimating deicing completion times
CN101100222A (en) * 2007-07-18 2008-01-09 中国民航大学 Integral concentration deicing system for airplane
CN107393348A (en) * 2017-07-10 2017-11-24 南京航空航天大学 Enter station departure flight collaboration sort method under a kind of information sharing mechanism

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种飞机地面集中除冰的新型优化调度方法;吴孟丽等;《计算机仿真》;20151215;第32卷(第12期);第1页第1段-第4页第3段 *
飞机地面除冰运行调度模型研究;张伟等;《中国民航大学学报》;20171015;第35卷(第5期);第1页第1段-第4页第5段 *

Also Published As

Publication number Publication date
CN110175743A (en) 2019-08-27

Similar Documents

Publication Publication Date Title
CN107016881B (en) A kind of multirunway field is marched into the arena flight multi-effect optimization sequencing method
CN103426331B (en) Multi-airport collaborative delivery system flight sorting and decision making method
CN103218681B (en) Aviation hub is met an urgent need management-control method
CN107169677B (en) Centralized dispatching command system for civil airport apron security vehicles
CN112396871B (en) Approach delay allocation and absorption method based on track prediction
CN109740871B (en) Flight time slot resource utilization method based on buffer mechanism and corresponding system
CN107025805B (en) Time calculation method of cooperative decision system based on candidate mechanism and corresponding system
CN107591034A (en) A kind of implementation method for flight sequence of approaching
CN106952022B (en) Scheduling method and scheduling system for airport flight resources and airplanes
US7725410B2 (en) Method, apparatus and system for aircraft deicing and estimating deicing completion times
Nakahara et al. Analysis of a surface congestion management technique at New York JFK airport
CN112614384B (en) Approach multi-constraint ordering calculation method based on multi-target dynamic allocation runway
CN110175743B (en) Dynamic allocation method for airport apron removal
WO2022213756A1 (en) Air route, time slot, and flight level collaborative optimization and distribution method
CN104574959A (en) System and method for predicting supply and demand states of taxis in airports
Lee et al. A comparison of aircraft trajectory-based and aggregate queue-based control of airport taxi processes
CN113808439A (en) Departure ordering method under flight traffic management system
CN116580601A (en) Harbor entering sequencing method based on airspace constraint and approach flow
CN110163491A (en) A kind of the aircraft gate dispatching method and scheduling system of the real-time elasticity optimizing handling capacity
CN116312070A (en) Air traffic flow management implementation method based on flight handover altitude
CN114299762B (en) Flight time slot automatic optimization method and system based on consistency monitoring
Lange et al. Convergence in airline operations: The case of ground times
CN112800382B (en) Method and system for optimizing deducing time slot allocation based on flight departure cost
CN113223332A (en) Airport take-off and landing capacity dynamic monitoring method and system
EP3660814A1 (en) Flight time exchange system and exchange method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant