CN115310731A - Flight entering and leaving scheduling method, system and device - Google Patents
Flight entering and leaving scheduling method, system and device Download PDFInfo
- Publication number
- CN115310731A CN115310731A CN202211243539.0A CN202211243539A CN115310731A CN 115310731 A CN115310731 A CN 115310731A CN 202211243539 A CN202211243539 A CN 202211243539A CN 115310731 A CN115310731 A CN 115310731A
- Authority
- CN
- China
- Prior art keywords
- time
- flight
- entering
- leaving
- departure
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 70
- 230000010006 flight Effects 0.000 claims abstract description 76
- 238000012163 sequencing technique Methods 0.000 claims abstract description 14
- 238000013459 approach Methods 0.000 claims description 40
- 230000008569 process Effects 0.000 claims description 17
- 238000003860 storage Methods 0.000 claims description 15
- 230000006870 function Effects 0.000 claims description 13
- 238000005457 optimization Methods 0.000 claims description 11
- 238000009826 distribution Methods 0.000 claims description 9
- 230000008014 freezing Effects 0.000 claims description 8
- 238000007710 freezing Methods 0.000 claims description 8
- 239000000126 substance Substances 0.000 claims description 7
- 230000003993 interaction Effects 0.000 claims description 3
- 238000012804 iterative process Methods 0.000 claims description 2
- 238000004590 computer program Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000009467 reduction Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- 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
-
- 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/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
-
- G06Q50/40—
Abstract
The invention belongs to the technical field of civil aviation, and particularly relates to a flight entering and leaving scheduling method, system and device. The method comprises the following steps: acquiring an incoming and outgoing flight set; fixing the entering and leaving time of the frozen flights, and randomly generating the entering and leaving time of each flight to be optimized based on time window constraint to obtain a first sequence; updating the entering and leaving time in sequence to obtain a first entering and leaving strategy based on the minimum safe time interval table; on the basis of keeping the time of the specific number of the flights to be optimized to enter and leave unchanged, a second sequencing and a second entering and leaving strategy are obtained by sequentially adopting the method; respectively calculating the delay cost of the first entering and leaving strategy and the second entering and leaving strategy based on a delay cost function; and iteratively updating the second entering-leaving field strategy based on the Metropolis criterion until a preset iteration stop condition is reached. The method improves the generation efficiency of the scheduling strategy, gives consideration to the requirements of entering and leaving the airport at fixed time, and has strong applicability in all time periods of the airport.
Description
Technical Field
The invention belongs to the technical field of civil aviation, and particularly relates to a flight entering and leaving scheduling method, system and device.
Background
With the rapid increase of air traffic flow, the throughput of airports becomes an important factor for limiting the increase of flow, some airports increase the throughput by additionally repairing a plurality of runways, but many airports cannot increase the runways due to the limitation of sites, so that the optimization of the scheduling strategy for flights to enter and leave the airport by an intelligent algorithm is more and more concerned by the industry.
At present, the approach and departure scheduling method of the flight mostly takes the purposes of minimizing time delay, minimizing economic loss and minimizing time gap, but ignores the intensive time period and the sparse time period existing in the approach and departure of the airport, the optimization target has strong applicability in the intensive time period, but the optimization effect in the sparse time period is slightly insufficient, and meanwhile, the scheduling method does not consider the special condition of the fixed time approach and departure frequently occurring in the airport.
Disclosure of Invention
In order to solve the problems in the prior art, namely, the generation efficiency of the scheduling strategy is improved, and the requirement of fixed time on entering and leaving is considered, the invention provides a flight entering and leaving scheduling method, system and device.
In another aspect of the present invention, a flight arrival and departure scheduling method is provided, including:
s100, acquiring an incoming and outgoing flight set F, including incoming and outgoing flights to be optimized and frozen flights;
s200, fixedly freezing the departure and entrance time of flights, randomly generating departure and entrance time of each flight to be optimized on the basis of time window constraint of each flight to be optimized, and obtaining a first sequence after sequencing;
s300, updating the departure and entrance time of flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy;
s400, on the basis that the time of the S items of the flight to be optimized in the first entering and leaving strategy is unchanged, the methods of S200 and S300 are sequentially adopted to obtain a second sequencing and second entering and leaving strategy;
s500, respectively calculating the delay cost of the first entering and leaving strategy and the delay cost of the second entering and leaving strategy based on a preset delay cost function E;
s600, accepting/rejecting a second entering/leaving strategy based on Metropolis criterion;
s700, iteratively executing S400-S600 until a preset iteration stop condition is reached, and outputting a current second approach and departure strategy as a flight approach and departure scheduling strategy;
wherein the initial value of S is 1, and S-1 is the count of continuous p-times decrease of the delay cost of the second entering-leaving field strategy relative to the first entering-leaving field strategy in the iteration process.
In a preferred real-time manner, the delay cost function
Comprises the following steps:
wherein the content of the first and second substances,
、
、
、
are respectively the first in the entering and leaving field strategy
The departure delay time, departure advance time, landing delay time and landing advance time of each flight; a. b, c and d are weight coefficients of takeoff delay, takeoff advance, landing delay and landing advance respectively;
forward/backward offset of the ith flight relative to its position in the FCFS for the inbound departure strategy;
a preset maximum amount of position for flights to lean forward/backward relative to their position in the FCFS; q is the uniformity of the distribution of the idle time among flights in the entering and leaving strategy; n is the total number of incoming and outgoing flights.
In a preferred real-time manner, the uniformity Q of the distribution of idle time between flights in the departure and arrival strategy is
Wherein the content of the first and second substances,
for the free time between the ith flight and the (i + 1) th flight in the departure strategy,
the average value of the idle time between adjacent flights in the departure strategy is shown.
In a preferred real-time manner, the frozen flights in the inbound and outbound flight set F include two flights nearest to the time window to be optimized, and the flight with a fixed inbound and outbound time set in the time window to be optimized.
In a preferred real-time mode, the approach/departure time of flights in the first sequence is updated in sequence based on a preset minimum safe time interval table, and the method comprises the following steps:
for the first in the first ordering
Flight number based on
、
The model and the entering and leaving type of each flight are respectively obtained from the minimum safe time interval table of the pre-examination
、
Obtaining two entering and leaving time according to the minimum safety time interval of each flight, and selecting the later time as the time to be selected of the ith flight;
if the previous randomly generated time of the ith flight is earlier than the to-be-selected entering and leaving time, updating the entering and leaving time of the ith flight to be the to-be-selected entering and leaving time, and otherwise, keeping the previous randomly generated time as the entering and leaving time of the flight.
In a preferred real-time manner, the accepting/rejecting the second entering/leaving policy based on Metropolis criteria in S600 includes:
accepting a second approach-departure strategy:
updating the first entering and leaving strategy by using the second entering and leaving strategy;
if the total delay cost of the second approach-departure strategy is continuously reduced for p times compared with the total delay cost of the first approach-departure strategy, making S = S +1;
executing S700;
rejecting the second approach-departure strategy:
the second departure/entry policy is discarded, and S700 is performed.
In a preferred real-time manner, the preset minimum safe time interval table is: the time of the corresponding items of the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table is superposed to obtain the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table; and the format of the added time adjustment amount table is consistent with that of a take-off and landing aircraft tail eddy current interval standard table, and various data are recorded and obtained through a human-computer interaction interface.
In a preferred real-time manner, after the departure and arrival time of the flights in the first sequence is updated in sequence in S300, the method further includes determining a first departure and arrival strategy based on a preset constraint condition, and if the constraint condition is not satisfied, discarding the first departure and arrival strategy, and skipping S200.
In a preferred real-time manner, the preset constraint conditions include a minimum time interval constraint, a maximum advance time constraint, and a maximum delay time constraint runway resource constraint.
In a preferred real-time manner, the time window constraint for randomly generating the departure and arrival time of the departure and arrival flight to be optimized in S200 is:
wherein, in the process,
、
flight i is the maximum lead time allowed, the maximum delay time allowed,
the average interval time is counted based on a standard table of interval of wake vortexes of the takeoff and landing aircraft.
In a second aspect of the present invention, a flight arrival and departure scheduling system is provided, including:
the first module is used for acquiring an incoming and outgoing flight set F, including incoming and outgoing flights to be optimized and frozen flights;
the second module is used for fixedly freezing the entering and leaving time of the flights, randomly generating the entering and leaving time of the flights to be optimized based on the time window constraint of the flights to be optimized, and obtaining a first sequence after sequencing;
the third module is used for updating the departure and entrance time of flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy;
the fourth module is used for obtaining a second sequencing and a second entering and leaving strategy through the second module and the third module on the basis that S time of the entering and leaving flights to be optimized in the first entering and leaving strategy is unchanged;
the fifth module is used for respectively calculating the delay cost of the first entering and leaving strategy and the delay cost of the second entering and leaving strategy based on a preset delay cost function E;
a sixth module for accepting/rejecting the second entering/leaving policy based on Metropolis criteria;
a seventh module, configured to iterate through the fourth module, the fifth module, and the sixth module until a preset iteration stop condition is reached, and output a current second approach and departure strategy as a flight approach and departure scheduling strategy;
wherein the initial value of S is 1, and S-1 is the count of continuous p-times decrease of the delay cost of the second entering-leaving field strategy relative to the first entering-leaving field strategy in the iteration process.
In a third aspect of the present invention, an electronic device is provided, including:
at least one processor; and
a memory communicatively coupled to at least one of the processors; wherein the content of the first and second substances,
the memory stores instructions executable by the processor for execution by the processor to implement the flight approach and departure scheduling method described above.
In a fourth aspect of the present invention, a computer-readable storage medium is provided, where the computer-readable storage medium stores computer instructions for being executed by the computer to implement the flight approach and departure scheduling method.
The invention has the beneficial effects that:
(1) According to the method, the entering and leaving time of the corresponding flight is randomly generated based on the time window constraint of the entering and leaving flight, and an iterative optimization mode is performed, so that the production of invalid schemes is greatly reduced, and meanwhile, the optimized generation efficiency of the scheduling strategy is greatly improved by combining the iterative optimization of Metropolis criteria;
(2) After the frozen flight time is solidified, putting the frozen flight time into a flight queue to be optimized for optimizing the overall scheduling strategy, so that the frozen flight and the flight queue to be optimized are combined more effectively, and the obtained scheduling strategy containing the frozen flight is more reasonable and efficient on the whole;
(3) The delay cost function carries out differentiated weight processing on the departure delay time, the departure advance time, the landing delay time and the landing advance time, and a factor of position deviation weight relative to the position in the FCFS and a factor of idle time distribution uniformity among flights are added, so that the applicability of the optimized scheduling scheme to the whole airport time interval is enhanced, the efficiency is considered, and the entering and leaving safety is enhanced.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is a flow chart of a flight arrival and departure scheduling method according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating flight arrival and departure time updating according to an embodiment of the present invention;
FIG. 3 is a flow chart illustrating a second entering-leaving policy obtaining process according to an embodiment of the present invention;
FIG. 4 is a flow chart illustrating an acceptance status based on Metropolis criteria in an embodiment of the present invention;
FIG. 5 is a schematic diagram of a flight arrival and departure scheduling system framework according to an embodiment of the present invention;
FIG. 6 is a block diagram of a computer system of a server for implementing embodiments of the method, system, and apparatus of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not to be construed as limiting the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
A flight approach and departure scheduling method according to an embodiment of the present invention, as shown in fig. 1, includes steps S100 to S700.
S100, acquiring an incoming and outgoing flight set
Including entering and leaving flights to be optimized and freezing flights.
In this embodiment, the flight entering and leaving optimization may be performed in a time window manner according to a set step length, and a time window of a time interval to be optimized and a time step length between two times of optimization may be set.
For example, setting a time interval to be optimized as H, selecting flights from an FCFS (first come first served scheduling policy) of an airport whose departure and arrival times fall into the time interval H, identifying the frozen flights therein as intermediate frozen flights, and selecting the rest as departure and arrival flights to be optimized, and simultaneously selecting two departure and arrival flights nearest to the time interval H as initial frozen flights, wherein the initial frozen flights, the intermediate frozen flights and the departure and arrival flights to be optimized form a departure and arrival flight set F together.
S200, fixedly freezing the departure and entrance time of the flights, randomly generating departure and entrance time of each flight to be optimized on the basis of time window constraint of each flight to be optimized, and obtaining a first sequence after sequencing.
In this step, the time window constraint of each flight to be optimized entering and leaving may be a time interval formed by the maximum advance time and the maximum delay time corresponding to each flight as the time window constraint, or a more effective time window constraint may be formed after the maximum delay time is reduced on this basis, for example:
wherein, in the process,
、
flight i is the maximum lead time allowed, the maximum delay time allowed,
the average interval time is counted based on a standard table of interval of wake vortexes of the takeoff and landing aircraft.
The latter is preferably used in the present embodiment, so that the occurrence of the situation in which the maximum delay time is exceeded can be greatly reduced when the time interval adjustment is performed on the generated first sequence in the subsequent step. Of course, in order to completely avoid exceeding the maximum delay time, the delay time can be increased
The maximum interval time in the standard table of the interval of the wake vortex of the takeoff and landing aircraft is set, but the optimization efficiency is improved, but the optimization effect is slightly poor.
Based on the time window constraint of each approaching and departing flight to be optimized, an approaching and departing time is randomly generated in a time window respectively, all the frozen flights keep the original approaching and departing time unchanged, and thus an approaching and departing flight sequence arranged according to a time sequence can be obtained.
And S300, updating the departure and entrance time of the flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy.
In this embodiment, the preset minimum safe time interval table is: the time of the corresponding items of the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table is superposed to obtain the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table; and the format of the added time adjustment amount table is consistent with that of the take-off and landing aircraft tail vortex interval standard table, and various data are recorded and acquired through a human-computer interaction interface. The standard table of the wake vortex interval of the takeoff and landing aircraft is shown in table 1, and the table of the added time adjustment amount is shown in table 2. The numerical units in tables 1 and 2 are seconds.
TABLE 1
Wherein HA, LA and SA respectively represent H-type, L-type and S-type landing aircrafts; HD. LD and SD respectively represent H-shaped, L-shaped and S-shaped take-off airplanes.
TABLE 2
In this embodiment, the departure and arrival times of flights in the first sequence are updated in sequence, as shown in fig. 2, the method includes:
for the ith flight in the first sequence, based on the ith
、
The model and the entering and leaving type of each flight are respectively obtained from the minimum safe time interval table of the pre-examination
、
The minimum safe time interval of each flight is obtained as two entering and leaving time, and the later time is selected as the second time
The time of departure to be selected of each flight;
and if the time of the ith flight generated randomly in advance is earlier than the entering and leaving time to be selected, updating the entering and leaving time of the ith flight to the entering and leaving time to be selected, and otherwise, keeping the time of the ith flight generated randomly as the entering and leaving time of the flight.
Starting to freeze flights in the 1 st flight and the 2 nd flight in the first sequence without updating the departure time, starting from the 3 rd flight, respectively obtaining the departure time interval based on the information of the 1 st flight and the 2 nd flight, obtaining an departure time based on the departure time of the 1 st flight and the departure time interval of the 3 rd flight, obtaining another departure time based on the departure time of the 2 nd flight and the departure time interval of the 3 rd flight, selecting the later time as the time to be selected for the departure time of the 3 rd flight, and simultaneously judging whether the later time is closer to the departure time randomly generated by the 3 rd flight in S200, if the later time is closer to the later time, updating the departure time of the 3 rd flight to be selected for the departure time, otherwise, not updating, and keeping the time unchanged.
If the updated departure/entrance time exceeds the maximum delay time constraint or the flight jumps from the front to the back of the intermediate freezing flight, the first departure/entrance strategy is abandoned and the transition is made to S200.
In this embodiment, after the departure and entrance time of the flights in the first sequence is updated in sequence, the method further includes determining a first departure and entrance strategy based on a preset constraint condition, and if the constraint condition is not satisfied, discarding the first departure and entrance strategy, and skipping S200. The preset constraint conditions comprise minimum time interval constraint, maximum advance time constraint and maximum delay time constraint runway resource constraint, the constraint conditions are described in detail in many existing documents, the content of the invention is not the point content of the invention, the detailed description is omitted, and the proper constraint conditions can be selected for use in the implementation process according to the needs.
S400, on the basis that the time of the items S of the flight to be optimized in the first entering and leaving strategy is kept unchanged, the methods S200 and S300 are sequentially adopted to obtain a second sequencing and a second entering and leaving strategy.
The initial value of S in this example is 1 and the way this variable is adjusted is described in detail in the following steps. As shown in fig. 3, when S =1, on the basis that 1 flight time is reserved for the inbound and outbound flights to be optimized in the first inbound and outbound strategy, the method of S200 and S300 is adopted to obtain the second ranking and the second inbound and outbound strategy, and the approximate flow is as follows: fixing the flight entering and leaving time; optionally selecting one of the flights to be optimized to enter and leave the station and keeping the original entering and leaving time unchanged; all the rest flights to be optimized enter and leave the airport based on time window constraint, and randomly generating enter and leave time; obtaining a second sequence after sequencing; and updating the departure and entrance time of the flights in the second sequence in sequence to obtain a second departure and entrance strategy. When S is other numerical values, the method is the same, and the quantity of the retained space time is changed according to the numerical values.
S500, based on a preset delay cost function
And respectively calculating the delay cost of the first entering and leaving strategy and the second entering and leaving strategy.
The delay cost function of this embodiment performs weight differentiation processing on the departure delay time, departure advance time, landing delay time and landing advance time of the flight, adds a factor of the position offset weight relative to the position in the FCFS and a factor of the distribution uniformity of the idle time between flights, and delays the cost function
Is composed of
Wherein the content of the first and second substances,
、
、
、
respectively, the departure delay time, departure advance time, landing delay time and landing advance time of the ith flight in the departure and departure strategy, for example,
at most, only one parameter of each flight is a non-0 parameter; a. b, c and d are weight coefficients of takeoff delay, takeoff advance, landing delay and landing advance respectively, and can be set by a user;
forward/backward offset of the ith flight relative to its position in the FCFS for the inbound departure strategy;
the preset maximum amount of position for the flight to lean forward/backward relative to its position in the FCFS may be set by the user at his discretion; q is the uniformity of the distribution of the idle time among flights in the entering and leaving strategy; n is the total number of incoming and outgoing flights.
The uniformity Q of the distribution of the idle time among the flights in the departure and arrival strategy is
Wherein the content of the first and second substances,
for the ith flight and the ith flight in the departure and entrance strategy
The free time between each flight is the number of flights,
the average value of the idle time between adjacent flights in the departure strategy is shown.
S600, based on Metropolis criterion, accepting/rejecting the second entering/leaving strategy.
The Metropolis criterion accepts a new state with a certain probability, accepts when the delay cost is reduced, and accepts when the delay cost is not reduced, does not reject the new state with a certain probability.
The method specifically comprises the following steps:
accepting a second approach-departure strategy:
as shown in fig. 4, the first entering-leaving strategy is updated with the second entering-leaving strategy; if the total delay cost of the second entering and leaving strategy is continuously reduced for p times compared with the first entering and leaving strategy, making S = S +1, otherwise, keeping S unchanged; executing S700; wherein p is a set threshold value which is a natural number, and S-1 represents the count of continuous p-time reduction of delay cost of a second approach and departure strategy relative to a first approach and departure strategy in the iterative process;
rejecting the second approach-departure strategy:
the second departure/entry policy is discarded, and S700 is performed.
In this embodiment, the next iteration loop is determined by using p successive drops, and in other embodiments, a parameter changing mode may be used, for example, a mode of continuously changing parameters
The secondary reduction ratio is less than
，
Is a preset number of times under the value corresponding to the variable S,
is a preset threshold value under the value corresponding to the variable S.
And S700, iteratively executing S400-S600 until a preset iteration stop condition is reached, and outputting the current second approach and departure strategy as a flight approach and departure scheduling strategy.
The preset iteration stop condition may be that the value of the variable S is equal to the number of the inbound and outbound flights to be optimized, or that the delay cost reduction ratio is smaller than a set threshold value for a continuously set number of times.
A flight arrival/departure scheduling system according to a second embodiment of the present invention, as shown in fig. 5, includes:
a first module to obtain a set of inbound and outbound flights
The flight optimization method comprises the steps of entering and leaving flights to be optimized and freezing flights;
the second module is used for fixing the departure and entrance time of the frozen flights, randomly generating departure and entrance time of each flight to be optimized on the basis of time window constraint of each flight to be optimized, and obtaining a first sequence after sequencing;
the third module is used for updating the departure and entrance time of flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy;
the fourth module is used for obtaining a second sequencing and a second entering and leaving strategy through the second module and the third module on the basis that S time of the entering and leaving flights to be optimized in the first entering and leaving strategy is unchanged;
a fifth module for generating a delay cost function based on the predetermined delay cost function
Respectively calculating the delay cost of the first entering and leaving strategy and the second entering and leaving strategy;
a sixth module for accepting/rejecting the second entering/leaving policy based on Metropolis criteria;
a seventh module, configured to iterate through the fourth module, the fifth module, and the sixth module until a preset iteration stop condition is reached, and output a current second approach and departure strategy as a flight approach and departure scheduling strategy;
wherein the initial value of S is 1, and S-1 is the count of continuous p-times decrease of the delay cost of the second entering-leaving field strategy relative to the first entering-leaving field strategy in the iteration process.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process and related description of the system described above may refer to the corresponding process in the foregoing method embodiments, and will not be described herein again.
It should be noted that, the flight entering and leaving scheduling system provided in the foregoing embodiment is only illustrated by the division of the functional modules, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the modules or steps in the embodiment of the present invention are further decomposed or combined, for example, the modules in the foregoing embodiment may be combined into one module, or may be further split into multiple sub-modules, so as to complete all or part of the functions described above. The names of the modules and steps involved in the embodiments of the present invention are only for distinguishing the modules or steps, and are not to be construed as unduly limiting the present invention.
An electronic device of a third embodiment of the present invention includes:
at least one processor; and
a memory communicatively coupled to at least one of the processors; wherein, the first and the second end of the pipe are connected with each other,
the memory stores instructions executable by the processor for execution by the processor to implement the flight approach and departure scheduling method described above.
A computer-readable storage medium of a fourth embodiment of the present invention stores computer instructions for being executed by the computer to implement the flight approach and departure scheduling method.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes and related descriptions of the storage device and the processing device described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
Reference is now made to FIG. 6, which illustrates a block diagram of a computer system of a server for implementing embodiments of the method, system, and apparatus of the present application. The server shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 6, the computer system includes a Central Processing Unit (CPU) 601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for system operation are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An Input/Output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output section 607 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 608 including a hard disk and the like; and a communication section 609 including a Network interface card such as a LAN (Local Area Network) card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the method of the present application when executed by a Central Processing Unit (CPU) 601. It should be noted that the computer readable medium mentioned above in the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terms "first," "second," and the like are used for distinguishing between similar elements and not necessarily for describing or implying a particular order or sequence.
The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
So far, the technical solutions of the present invention have been described in connection with the preferred embodiments shown in the drawings, but it is easily understood by those skilled in the art that the scope of the present invention is obviously not limited to these specific embodiments. Equivalent changes or substitutions of related technical features can be made by those skilled in the art without departing from the principle of the invention, and the technical scheme after the changes or substitutions can be within the protection scope of the invention.
Claims (13)
1. A flight arrival and departure scheduling method is characterized by comprising the following steps:
s100, acquiring an incoming and outgoing flight set F, including incoming and outgoing flights to be optimized and frozen flights;
s200, fixedly freezing the departure and entrance time of flights, randomly generating departure and entrance time of each flight to be optimized on the basis of time window constraint of each flight to be optimized, and obtaining a first sequence after sequencing;
s300, updating the departure and entrance time of flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy;
s400, on the basis that the time of the S items of the flight to be optimized in the first entering and leaving strategy is unchanged, the methods of S200 and S300 are sequentially adopted to obtain a second sequencing and second entering and leaving strategy;
s500, based on a preset delay cost function
Respectively calculating the delay cost of the first entering and leaving strategy and the second entering and leaving strategy;
s600, accepting/rejecting a second entering/leaving strategy based on Metropolis criterion;
s700, iteratively executing S400-S600 until a preset iteration stop condition is reached, and outputting a current second approach and departure strategy as a flight approach and departure scheduling strategy;
wherein the initial value of S is 1, S-1 is the count of continuous p-times decrease of the delay cost of the second entering and leaving strategy relative to the first entering and leaving strategy in the iterative process.
2. A flight approach/departure scheduling method according to claim 1, characterized in that the delay cost functionEIs composed of
Wherein the content of the first and second substances,
、
、
、
respectively in the entering and leaving field strategyiThe departure delay time, departure advance time, landing delay time and landing advance time of each flight; a. b, c and d are weight coefficients of takeoff delay, takeoff advance, landing delay and landing advance respectively;
for the first in the entering and leaving field strategyiA position amount by which an individual flight is offset forward/backward relative to its position in the FCFS;
a preset maximum amount of position for flights to lean forward/backward relative to their position in the FCFS; q is the uniformity of the distribution of the idle time among flights in the entering and leaving strategy;nthe total number of incoming and outgoing flights.
3. The method of claim 2, wherein the distribution of the idle time between flights in the approach and departure strategy has a uniformity Q of
Wherein the content of the first and second substances,
for the first in the entering and leaving field strategyiIndividual flight and the first
The free time between each flight is the number of flights,
the average value of the idle time between adjacent flights in the departure strategy is shown.
4. A flight approach and departure scheduling method according to any of claims 1-3, wherein the set of approach and departure flightsFThe frozen flights in (1) include two flights nearest to the time window to be optimized and a flight with a fixed departure time set in the time window to be optimized.
5. A method for scheduling flight approaches and departures according to claim 4, wherein the approach times of flights in the first sequence are updated sequentially based on a preset minimum safe time interval table, and the method comprises:
for the first in the first ordering
Flight number based on
、
The model and the entering and leaving type of each flight are respectively obtained from a pre-audited minimum safety time interval table
、
The minimum safe time interval of each flight is obtained as two entering and leaving time, and the later time is selected as the second timeiThe time of departure to be selected of each flight;
if it is the firstiIf the time of the previous random generation of the flight is earlier than the departure time to be selected, the flight will be the first flightiAnd updating the entering and leaving time of each flight as the to-be-selected entering and leaving time, and otherwise, keeping the previously randomly generated time as the entering and leaving time of the flight.
6. The method as claimed in claim 5, wherein the step S600 of accepting/rejecting the second approach/departure strategy based on Metropolis criteria comprises:
accepting a second approach-departure strategy:
updating the first entering and leaving strategy by using the second entering and leaving strategy;
if the total delay cost of the second entering and leaving strategy is continuously reduced for p times compared with the first entering and leaving strategy, making S = S +1;
executing S700;
rejecting the second approach-departure strategy:
the second entering-leaving policy is discarded and S700 is performed.
7. A flight arrival and departure scheduling method according to any one of claims 1-3, wherein the predetermined minimum safe time interval table is: the time of the corresponding items of the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table is superposed to obtain the take-off and landing aircraft wake vortex interval standard table and the added time adjustment table; and the format of the added time adjustment amount table is consistent with that of a take-off and landing aircraft tail eddy current interval standard table, and various data are recorded and obtained through a human-computer interaction interface.
8. The flight approach and departure scheduling method according to any of claims 1-3, wherein after the approach and departure time of the flights in the first sequence is updated in the step S300, the method further comprises determining a first approach and departure strategy based on a preset constraint condition, and if the constraint condition is not satisfied, discarding the first approach and departure strategy, and skipping to the step S200.
9. A flight approach and departure scheduling method according to any of claims 1-3, wherein said preset constraints include minimum time interval constraints, maximum advance time constraints, maximum delay time constraints runway resource constraints.
10. A flight approach and departure scheduling method according to any of claims 1-3, wherein the time window constraint for randomly generating approach and departure times to be optimized for approach and departure flights in S200 is:
wherein, in the process,
、
separate flightsiThe maximum advance time and the maximum delay time are allowed,
the average interval time counted based on a take-off and landing aircraft wake vortex interval standard table is adopted.
11. A flight arrival and departure scheduling system, comprising:
a first module to obtain a set of inbound and outbound flightsFThe flight optimization method comprises the steps of entering and leaving flights to be optimized and freezing flights;
the second module is used for fixing the departure and entrance time of the frozen flights, randomly generating departure and entrance time of each flight to be optimized on the basis of time window constraint of each flight to be optimized, and obtaining a first sequence after sequencing;
the third module is used for updating the departure and entrance time of flights in the first sequence in sequence based on a preset minimum safe time interval table to obtain a first departure and entrance strategy;
the fourth module is used for obtaining a second sequencing and a second entering and leaving strategy through the second module and the third module on the basis that the time of the S items of the flight to be optimized in the first entering and leaving strategy is kept unchanged;
a fifth module for generating a delay cost function based on the predetermined delay cost function
Respectively calculating the delay cost of the first entering and leaving strategy and the second entering and leaving strategy;
a sixth module for accepting/rejecting the second entering/leaving strategy based on Metropolis criterion;
the seventh module is used for iterating through the fourth module, the fifth module and the sixth module until a preset iteration stop condition is reached, and outputting a current second approach and departure strategy as a flight approach and departure scheduling strategy;
wherein the initial value of S is 1, and S-1 is the count of continuous p-times decrease of the delay cost of the second entering-leaving field strategy relative to the first entering-leaving field strategy in the iteration process.
12. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to at least one of the processors; wherein, the first and the second end of the pipe are connected with each other,
the memory stores instructions executable by the processor for performing the flight approach/departure scheduling method of any of claims 1-10.
13. A computer-readable storage medium storing computer instructions for execution by the computer to perform the flight approach and departure scheduling method of any one of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211243539.0A CN115310731B (en) | 2022-10-12 | 2022-10-12 | Flight entering and leaving scheduling method, system and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211243539.0A CN115310731B (en) | 2022-10-12 | 2022-10-12 | Flight entering and leaving scheduling method, system and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115310731A true CN115310731A (en) | 2022-11-08 |
| CN115310731B CN115310731B (en) | 2022-12-30 |
Family
ID=83868174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211243539.0A Active CN115310731B (en) | 2022-10-12 | 2022-10-12 | Flight entering and leaving scheduling method, system and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115310731B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117292585A (en) * | 2023-11-27 | 2023-12-26 | 四川省机场集团有限公司成都天府国际机场分公司 | Departure flight ordering method, system, terminal and medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103778481A (en) * | 2014-01-23 | 2014-05-07 | 南京航空航天大学 | Dynamic scheduling method for multi-runway flight getting in and out |
| US20160132791A1 (en) * | 2014-11-07 | 2016-05-12 | Graph SQL, Inc. | Methods and systems for distributed graphical flight search |
| CN107016881A (en) * | 2017-05-11 | 2017-08-04 | 中国电子科技集团公司第二十八研究所 | A kind of multirunway field is marched into the arena flight multi-effect optimization sequencing method |
| CN107393348A (en) * | 2017-07-10 | 2017-11-24 | 南京航空航天大学 | Enter station departure flight collaboration sort method under a kind of information sharing mechanism |
| CN110689765A (en) * | 2019-09-20 | 2020-01-14 | 中国民用航空飞行学院 | Flight approach ordering method based on cross entropy and sliding time window |
| US20220215760A1 (en) * | 2019-05-28 | 2022-07-07 | Sita Information Networking Computing Uk Limited | System and method for flight arrival time prediction |
-
2022
- 2022-10-12 CN CN202211243539.0A patent/CN115310731B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103778481A (en) * | 2014-01-23 | 2014-05-07 | 南京航空航天大学 | Dynamic scheduling method for multi-runway flight getting in and out |
| US20160132791A1 (en) * | 2014-11-07 | 2016-05-12 | Graph SQL, Inc. | Methods and systems for distributed graphical flight search |
| CN107016881A (en) * | 2017-05-11 | 2017-08-04 | 中国电子科技集团公司第二十八研究所 | A kind of multirunway field is marched into the arena flight multi-effect optimization sequencing method |
| CN107393348A (en) * | 2017-07-10 | 2017-11-24 | 南京航空航天大学 | Enter station departure flight collaboration sort method under a kind of information sharing mechanism |
| US20220215760A1 (en) * | 2019-05-28 | 2022-07-07 | Sita Information Networking Computing Uk Limited | System and method for flight arrival time prediction |
| CN110689765A (en) * | 2019-09-20 | 2020-01-14 | 中国民用航空飞行学院 | Flight approach ordering method based on cross entropy and sliding time window |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117292585A (en) * | 2023-11-27 | 2023-12-26 | 四川省机场集团有限公司成都天府国际机场分公司 | Departure flight ordering method, system, terminal and medium |
| CN117292585B (en) * | 2023-11-27 | 2024-03-08 | 四川省机场集团有限公司成都天府国际机场分公司 | Departure flight ordering method, system, terminal and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115310731B (en) | 2022-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11308818B2 (en) | Method and apparatus for outputting information | |
| Bennell et al. | Airport runway scheduling | |
| Solveling et al. | Runway operations optimization in the presence of uncertainties | |
| WO2018034142A1 (en) | Air traffic control support system, air traffic control support method, and recording medium | |
| CN115310731B (en) | Flight entering and leaving scheduling method, system and device | |
| CN115239026B (en) | Method, system, device and medium for optimizing parking space allocation | |
| Shao et al. | Flight delay prediction using airport situational awareness map | |
| CN104299454B (en) | Multi-airport collaborative delivery system flight sort method under a kind of inclement weather | |
| Şafak et al. | Multi-stage airline scheduling problem with stochastic passenger demand and non-cruise times | |
| CN111210094A (en) | Airport taxi automatic scheduling method and device based on real-time passenger flow prediction | |
| Çeçen et al. | Aircraft sequencing and scheduling in TMAs under wind direction uncertainties | |
| CN110570693A (en) | Flight operation time prediction method based on reliability | |
| Jun et al. | Towards a greener Extended-Arrival Manager in air traffic control: A heuristic approach for dynamic speed control using machine-learned delay prediction model | |
| JP2016071882A (en) | Duty block time control via statistical analysis | |
| KR20230159604A (en) | Method and mechanism for predicting seasonal classification of flights, and machine-readable media | |
| Balakrishnan et al. | Efficient and equitable departure scheduling in real-time: new approaches to old problems | |
| US10283001B2 (en) | Optimizing real-time and planned air-traffic | |
| CN111784049A (en) | Passenger loss time prediction method and device | |
| CN109979245B (en) | Flight flow regulation and control method and device | |
| Capps et al. | Design characteristics of a terminal departure scheduler | |
| JP2006523874A (en) | Method for ordering landing aircraft | |
| Curry et al. | A queueing model of airport passenger departures by taxi: Competition with a public transportation mode | |
| Wang et al. | A constructive heuristic approach for single airport slot allocation problems | |
| CN114819510A (en) | Multi-objective flight time optimization method | |
| Dönmez | Aircraft sequencing under the uncertainty of the runway occupancy times of arrivals during the backtrack procedure |
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 |