CN111062541A - Idle flight allocation method and system - Google Patents
Idle flight allocation method and system Download PDFInfo
- Publication number
- CN111062541A CN111062541A CN201911378051.7A CN201911378051A CN111062541A CN 111062541 A CN111062541 A CN 111062541A CN 201911378051 A CN201911378051 A CN 201911378051A CN 111062541 A CN111062541 A CN 111062541A
- Authority
- CN
- China
- Prior art keywords
- idle
- flight
- route
- airplanes
- time
- 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
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
- 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
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G5/00—Traffic control systems for aircraft, e.g. air-traffic control [ATC]
- G08G5/003—Flight plan management
Abstract
The invention discloses an idle flight allocation method and system, and relates to the technical field of flight management. The method comprises the following steps: determining at least two idle routes and idle flight time in each idle route; taking each idle route as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model; and acquiring the number of idle airplanes, and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes. According to the method, the alliance game is introduced into the idle flight allocation process, the idle airlines are used as alliance members, the game is carried out with the goal of maximizing the income, the game result with the maximized income can be obtained and is not realized by depending on the artificial experience, then the idle aircraft is allocated to each idle airline according to the game result, the flight allocation scheme with the maximized income can be obtained, and therefore the overall income of an airline company is improved.
Description
Technical Field
The invention relates to the technical field of flight management, in particular to an idle flight allocation method and system.
Background
At present, flight plans are mainly planned based on manual experience, each airline company has a certain number of flight times, but due to the influence of factors such as the number of airplanes, passenger carrying rate and income, the flight plans cannot be arranged at all flight times by each airline company.
When the flight is idle at the moment, the flight is usually scheduled manually, and the scheduling mode depends on manual experience, so that the income cannot be maximized.
Disclosure of Invention
The invention provides a method and a system for allocating idle flights, aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
a method of idle flight allocation, comprising:
determining at least two idle routes and idle flight time in each idle route;
taking each idle route as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model;
and acquiring the number of idle airplanes, and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
The invention has the beneficial effects that: according to the method, the alliance game is introduced into the idle flight allocation process, the idle airlines are used as alliance members, the game is carried out with the goal of maximizing the income, the game result with the maximized income can be obtained and is not realized by depending on the artificial experience, then the idle aircraft is allocated to each idle airline according to the game result, the flight allocation scheme with the maximized income can be obtained, and therefore the overall income of an airline company is improved.
Another technical solution of the present invention for solving the above technical problems is as follows:
an idle flight distribution system comprising:
the information reading unit is used for determining at least two idle routes and idle flight time in each idle route;
the information processing unit is used for taking each idle airline as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model;
and the flight distribution unit is used for acquiring the number of idle airplanes and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
The alliance game is introduced into the idle flight allocation process, the information of the idle airline is read from the airline data platform through the information reading unit, the idle airline is used as an alliance member by the information processing unit, the game is conducted with the goal of maximizing income, the game result with maximized income can be obtained, the game is realized without depending on artificial experience, then the idle airplane is allocated to each idle airline by the flight allocation unit according to the game result, the flight allocation scheme with maximized income can be obtained, and the overall income of an airline company is improved.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a flow chart illustrating a method for idle flight allocation according to an embodiment of the present invention;
FIG. 2 is a schematic illustration of a repeat flight in accordance with another embodiment of the idle flight allocation method of the present invention;
FIG. 3 is a block diagram of an idle flight distribution system according to an embodiment of the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth to illustrate, but are not to be construed to limit the scope of the invention.
As shown in fig. 1, a schematic flow chart of an idle flight allocation method according to an embodiment of the present invention is provided, the method is suitable for allocating idle flights, and includes:
s1, at least two idle routes and the idle flight time in each idle route are determined.
It should be noted that the idle airline refers to an airline including an idle flight time, and no matter how many idle flight times it includes, the idle airline can be used as the idle airline as long as it includes the idle flight time, and those skilled in the art can understand that the determination of the idle flight time is performed within a certain date, for example, within 1 year, 1 month, or 1 week, and the like, and the determined idle flight time and the idle airline may be different according to different time scales, which can be set by those skilled in the art according to actual needs.
The idle flight time refers to a time when a flight plan is not scheduled but the airline has a right of use for the flight time. For example, for a certain airport, the departure time of the airport may be divided at certain time intervals, for example, the departure time may be 15 o ' clock, 15 o ' clock 30 o ' clock, 15 o ' clock 45 o ' clock, etc., which indicates the use right of the airline company for the time, and the specific departure time needs to be uniformly scheduled by the tower, and is not described herein again.
That is, the current method for allocating flight time only focuses on the flight time, that is, whether an airplane takes off or lands at the flight time, but does not focus on where the airplane takes off, and the originating point and the arriving point are connected with the corresponding airports by the airline company, so that the idle flight time is not easily allocated.
The invention divides the idle flight time by the idle flight route, which is convenient for subsequent game and flight distribution. For example, assuming that an airline company has A, B and C three routes, and within a specified date, for example, between x month and x days of x year and y month and y days of y year, two routes a and B have idle flight times, that is, flight times at which flight plans are not scheduled, the two routes a and B may be used as idle routes, where a is taken as an example, and the idle flight times may be: a, b, c, a, b, and c.
And S2, taking each idle route as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model.
An example of an league gaming model is given below.
Where I ═ {1,2, …, n } is the set of n coalition members, SiIs to I containThe set formed by all subsets of the i-th coalition members, | S | is the set SiThe number of elements in (1), ω (| s |) is a weighting factor, and can be calculated according to the following formula:
where v(s) -v (s \ i }) can be understood as the contribution of member i in his participating collaboration s, i.e. the expected revenue generated. The sum of such collaboration is (| s | -1) |! (n- | s |)! The way in which they occur, and therefore the probability of each occurrence is ω (| s |).
And S3, acquiring the number of idle airplanes, and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
This is specifically described below as an example.
For example, if there are 2 idle routes, the first idle route has 5 flight times that can be scheduled, and the second idle route has 3 flight times that can be scheduled, then after the 2 idle routes are subjected to the game, the result is that the first idle route is 3 and the second idle route is 1, that is, when the number of flights of the 2 idle routes is 3: 1, the profit is the greatest. Then the aircraft for each flight is scheduled in that ratio, and assuming that there are 4 idle aircraft in total, then 3 of the 5 available scheduled idle flight times for the first idle flight are selected to schedule the flight plan, and 1 of the 3 available scheduled idle flight times for the second idle flight are selected to schedule the flight plan.
It should be noted that the idle flight time can be selected randomly, or according to the time sequence of the idle flight time.
In the embodiment, the alliance game is introduced into the idle flight allocation process, the idle airlines are used as alliance members, the game is carried out with the goal of maximizing the income, the game result with the maximized income can be obtained and is not realized by depending on the artificial experience, then the idle aircraft is allocated to each idle airline according to the game result, and the flight allocation scheme with the maximized income can be obtained, so that the overall income of an airline company is improved.
Optionally, in some embodiments, the method may further include:
judging whether a first idle route exists, wherein the number of idle flight moments of the first idle route is smaller than the number of idle airplanes distributed to the first idle route;
when a first idle route exists, distributing redundant idle airplanes distributed for the first idle route to other idle routes according to the first game result;
it should be understood that the remaining idle lanes refer to the remaining idle lanes except for the first idle lane among all idle lanes.
And the first game result is the game result after the first idle route is removed.
A specific example will be described below.
Assuming that the idle flight time of the idle flight line A is 3, the idle flight time of the idle flight line B is 4, and the idle flight time of the idle flight line C is 2, as a result of the game, 6 airplanes are allocated to the idle flight line A, 2 airplanes are allocated to the idle flight line B, and 1 airplane is allocated to the idle flight line C, so that the idle flight line B directly selects 2 idle flight times from the 4 idle flight times to allocate an airplane plan, and the idle flight line C directly selects 1 idle flight time from the 2 idle flight times to allocate an airplane plan.
For the idle flight path A, the number of the idle airplanes distributed to the idle flight path A is larger than the number of the idle flight times, so that resource waste is obviously caused, and 3 airplanes can be preferentially distributed to the idle flight path A to meet all the idle flight time requirements.
For the remaining 3 aircraft, the remaining idle lanes may be assigned. According to the example, the proportion of the game results of the idle route A, the idle route B and the idle route C is 6: 2: 1, after the idle route A is eliminated, the proportion of the first game result is 2: 1, and then 3 excessive airplanes can be distributed to the idle route B and the idle route C according to the proportion of 2: 1, so that the overall utilization rate of idle flights is guaranteed.
In the embodiment, the number of the distributed idle airlines is larger than that of the idle airlines at the idle flight time, and when the first idle airline occurs, the distribution scheme of the idle airlines is adjusted in time, so that the overall utilization rate of the idle flight time can be improved on the premise of meeting the maximum benefit.
Optionally, in some embodiments, the method may further include:
judging whether a second idle route exists, wherein the number of idle flight moments of the second idle route is larger than the number of idle airplanes distributed to the second idle route;
when a second idle route exists, judging whether the first idle aircraft can repeatedly fly on the second idle route according to the service time of the first idle aircraft;
updating the number of idle airplanes according to the judgment result, and reallocating idle airplanes for idle flight time in each idle route according to the game result and the updated number of idle airplanes;
the first idle airplane is any one of idle airplanes distributed to the second idle route according to the game result and the number of the idle airplanes.
It should be noted that the repeated flight refers to that after the aircraft executes the flight plan of the current idle flight time, the flight plan of the next idle flight time can be continued.
The use time refers to the time between the time when the aircraft executes the current flight plan and the time when the aircraft can execute the next flight plan, and generally can comprise the round trip time, the overhaul time and other preparation time when the aircraft executes the flight plan, and the other preparation time can reserve time for crew preparation time and other emergencies.
For example, if the number of available flights of the idle route a is 3, but as a result of the game, 2 airplanes are allocated to the idle route a, then if a certain airplane can continue to use after performing the return flight plan and completing the maintenance, the airplane can continue to perform the flight plan, thereby saving the number of airplanes, and if the number of airplanes is 10 in total, the number of idle airplanes can be increased by one, so that the overall utilization rate of the idle route is increased by the minimum number of airplanes.
As further described below in conjunction with the drawings, as shown in fig. 2, an exemplary repetitive flight diagram is provided, assuming that the origin waypoint for idle route a is a1 and the arrival waypoint is a2, taking the origin waypoint as a1 as an example, which has 3 idle flight times, i.e., 16 days at 5 months 7, 7 days at 5 months 8 and 14 days at 5 months 9, respectively, assuming that idle aircraft a is used for 1 day at idle route a, it can be seen that idle aircraft a cannot continue to perform flight tasks at 7 days at 5 months 8, but idle aircraft a can continue to perform flight tasks at 14 days at 5 months 9, 2 idle aircraft allocated for idle route a can be served by idle aircraft a, which is equivalent to adding one to the total number of idle aircraft, thereby enabling more idle aircraft to be put into use, to reduce idle flight times as a whole.
Optionally, in some embodiments, determining whether the first idle aircraft can repeatedly fly on the second idle route according to the usage time of the first idle aircraft may specifically include:
acquiring the time difference between any two idle flight moments in the second idle flight path;
and judging whether the service time of the first idle aircraft is less than the time difference, if so, judging that the first idle aircraft can repeatedly fly on the second idle route, and otherwise, judging that the first idle aircraft cannot repeatedly fly on the second idle route.
Continuing with the example shown in fig. 2, for the 3 idle flight times given in fig. 2, the time difference between any two idle flight times is 15 hours, 31 hours and 46 hours, respectively, and the usage time of the aircraft is 1 day, i.e. 24 hours, then it is determined that the idle aircraft a can fly repeatedly. The first flight plan, which is twice a flight at 16/5/7 and 14/5/9, because the time difference is 46 hours, which is longer than the service time of the airplane by 24 hours; the second flight plan, two flights at 5 months 8, 7 days and 5 months 9, 14 days, because the time difference between them is 31 hours, which is longer than the service time of the airplane 24 hours.
For another example, assuming that the 3 idle flight times are respectively 16 days on 5 months 7, 18 days on 5 months 7 and 14 days on 5 months 8, then it can be concluded that the time difference between any two idle flight times is respectively 2 hours, 20 hours and 22 hours, which are all less than 24 hours of the usage time of the aircraft, and that the first idle aircraft cannot repeatedly fly on the second idle route.
In the embodiment, the time difference of the idle flight time is calculated, and then whether the idle aircraft can fly repeatedly is judged according to the time difference and the use time of the aircraft, so that the flight plan of the aircraft does not need to be simulated, a complex simulation system does not need to be used for prediction, only the time difference of the idle flight time needs to be calculated, and the method has the advantage of high judgment efficiency.
Preferably, when a time difference larger than the use time of the first idle aircraft exists, 2 idle route times corresponding to the time difference are obtained and calculated, and when any two time differences exist the same idle route time, one time difference is removed.
For example, continuing with the example shown in FIG. 2, which has 2 time differences greater than 24 hours, 31 hours and 46 hours, respectively, then by reverse derivation, 31 hours of idle route time could be found to be 5 months, 8 days, 7 hours, and 5 months, 9 days, 14 hours; the 46 hour idle route times are 5 months, 7 days, 16 hours and 5 months, 9 days, 14 hours.
The comparison shows that when the two time differences exist at the same idle route time 5, 9 and 14, the increase of the number of idle airplanes caused by the two time differences is not overlapped, that is, the idle airplane a can only select the first flight plan or the second flight plan but not simultaneously select the first flight plan or the second flight plan as shown in the above embodiment.
And specifically select which idle flight moment, can set up according to actual demand.
The preferred embodiment further improves the practicability of the invention by judging whether any two time differences have the same idle route time or not and rejecting the flight plans which cannot be executed simultaneously according to the time differences, and has the advantage of high processing efficiency.
Optionally, in some embodiments, determining whether the first idle aircraft can be repeatedly flown in the second idle route according to the usage time of the first idle aircraft may further include:
acquiring historical delay time of a first idle aircraft;
determining an expected delay time of the first idle aircraft according to the historical delay time;
and updating the use time of the first idle aircraft according to the expected delay time.
It should be understood that the expected delay time may be determined by manual experience, or the historical delay times of the aircraft may be counted to obtain an average value as the expected delay time.
It should be noted that the expected delay time may be calculated within the usage time.
In the embodiment, the historical delay time is considered in the use time of the airplane, so that the robustness of the method can be further improved, and the problem that the subsequent idle airplane distribution plan is wrong due to airplane delay is avoided.
It is understood that some or all of the alternative embodiments described above may be included in some embodiments.
As shown in fig. 3, a structural framework diagram is provided for an embodiment of the idle flight allocation system of the present invention, which is suitable for allocating idle flights, and includes:
the information reading unit 1 is used for determining at least two idle routes and idle flight time in each idle route;
the information processing unit 2 is used for taking each idle airline as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model;
and the flight distribution unit 3 is used for acquiring the number of idle airplanes and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
In the embodiment, a league game is introduced into an idle flight allocation process, information of idle airlines is read from an airline data platform through the information reading unit 1, the idle airlines are used as league members by the information processing unit 2, the game is performed with the goal of maximizing income, the game result with the maximized income can be obtained, the realization is independent of artificial experience, then the flight allocation unit 3 allocates idle airplanes to each idle airline according to the game result, the flight allocation scheme with the maximized income can be obtained, and therefore the overall income of an airline company is improved.
Optionally, in some embodiments, the method may further include:
the first judging unit 4 is used for judging whether a first idle route exists, and the number of idle flight times of the first idle route is smaller than the number of idle airplanes distributed to the first idle route;
the flight allocating unit 3 is further configured to allocate, when a first idle flight path exists, redundant idle airplanes allocated to the first idle flight path to the remaining idle flight paths according to the first game result;
and the first game result is the game result after the first idle route is removed.
Optionally, in some embodiments, the method may further include:
the second judging unit 5 is used for judging whether a second idle airline exists, and the number of idle flight times of the second idle airline is larger than the number of idle airplanes distributed to the second idle airline; when a second idle route exists, judging whether the first idle aircraft can repeatedly fly on the second idle route according to the service time of the first idle aircraft;
the flight distribution unit 3 is also used for updating the number of idle airplanes according to the judgment result and redistributing the idle airplanes for the idle flight time in each idle route according to the game result and the updated number of the idle airplanes;
the first idle airplane is any one of idle airplanes distributed to the second idle route according to the game result and the number of the idle airplanes.
Optionally, in some embodiments, the second determining unit 5 may specifically be configured to obtain a time difference between any two idle flight times in the second idle route; and judging whether the service time of the first idle aircraft is less than the time difference, if so, judging that the first idle aircraft can repeatedly fly on the second idle route, and otherwise, judging that the first idle aircraft cannot repeatedly fly on the second idle route.
Optionally, in some embodiments, the information reading unit 1 may also be configured to obtain a historical delay time of the first idle aircraft;
the information processing unit 2 is also used for determining the expected delay time of the first idle airplane according to the historical delay time; and updating the usage time of the first idle aircraft according to the expected delay time.
It is understood that some or all of the alternative embodiments described above may be included in some embodiments.
It should be noted that the above embodiments are product embodiments corresponding to the previous method embodiments, and for the description of each optional implementation in the product embodiments, reference may be made to corresponding descriptions in the above method embodiments, and details are not described here again.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described method embodiments are merely illustrative, and for example, the division of steps into only one logical functional division may be implemented in practice in another way, for example, multiple steps may be combined or integrated into another step, or some features may be omitted, or not implemented.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for idle flight allocation, comprising:
determining at least two idle routes and idle flight time in each idle route;
taking each idle route as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model;
and acquiring the number of idle airplanes, and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
2. The idle flight allocation method of claim 1, further comprising:
judging whether a first idle airline exists, wherein the number of idle flight times of the first idle airline is smaller than the number of idle airplanes distributed to the first idle airline;
when the first idle route exists, distributing redundant idle airplanes distributed for the first idle route to other idle routes according to a first game result;
and the first game result is the game result after the first idle route is removed.
3. The idle flight allocation method according to claim 1 or 2, further comprising:
judging whether a second idle airline exists, wherein the number of idle flight times of the second idle airline is larger than the number of idle airplanes distributed to the second idle airline;
when the second idle route exists, judging whether the first idle aircraft can repeatedly fly on the second idle route according to the use time of the first idle aircraft;
updating the number of the idle airplanes according to the judgment result, and reallocating idle airplanes for idle flight time in each idle route according to the game result and the updated number of the idle airplanes;
the first idle airplane is any one of idle airplanes distributed to the second idle route according to the game result and the number of the idle airplanes.
4. The method of claim 3, wherein determining whether a first idle aircraft can be flown repeatedly on the second idle route based on the usage time of the first idle aircraft comprises:
acquiring the time difference between any two idle flight moments in the second idle flight path;
and judging whether the service time of the first idle aircraft is less than the time difference, if so, judging that the first idle aircraft can repeatedly fly on the second idle route, and otherwise, judging that the first idle aircraft cannot repeatedly fly on the second idle route.
5. The method of claim 3, wherein determining whether a first idle aircraft can be flown repeatedly before a second idle route based on the time of use of the first idle aircraft further comprises:
acquiring historical delay time of the first idle aircraft;
determining an expected delay time of the first idle aircraft according to the historical delay time;
and updating the service time of the first idle airplane according to the expected delay time.
6. An idle flight distribution system, comprising:
the information reading unit is used for determining at least two idle routes and idle flight time in each idle route;
the information processing unit is used for taking each idle airline as a coalition member, taking the maximum income as a game target, and playing the game through a preset coalition game model;
and the flight distribution unit is used for acquiring the number of idle airplanes and distributing the idle airplanes for the idle flight time in each idle route according to the game result and the number of the idle airplanes.
7. The idle flight distribution system of claim 6, further comprising:
the first judging unit is used for judging whether a first idle airline exists, and the number of idle flight times of the first idle airline is smaller than the number of idle airplanes distributed to the first idle airline;
the flight allocation unit is also used for allocating redundant idle airplanes allocated to the first idle route to other idle routes according to a first game result when the first idle route exists;
and the first game result is the game result after the first idle route is removed.
8. The idle flight distribution system of claim 6 or 7, further comprising:
the second judgment unit is used for judging whether a second idle airline exists, and the number of idle flight times of the second idle airline is larger than the number of idle airplanes distributed to the second idle airline; when the second idle route exists, judging whether the first idle aircraft can repeatedly fly on the second idle route according to the use time of the first idle aircraft;
the flight allocation unit is further used for updating the number of the idle airplanes according to the judgment result and reallocating the idle airplanes for the idle flight time in each idle route according to the game result and the updated number of the idle airplanes;
the first idle airplane is any one of idle airplanes distributed to the second idle route according to the game result and the number of the idle airplanes.
9. The idle flight allocation system of claim 8, wherein the second determining unit is specifically configured to obtain a time difference between any two idle flight times in the second idle route; and judging whether the service time of the first idle aircraft is less than the time difference, if so, judging that the first idle aircraft can repeatedly fly on the second idle route, and otherwise, judging that the first idle aircraft cannot repeatedly fly on the second idle route.
10. The idle flight distribution system of claim 8, wherein the information reading unit is further configured to obtain a historical delay time for the first idle aircraft;
the information processing unit is further used for determining the expected delay time of the first idle airplane according to the historical delay time; and updating the service time of the first idle aircraft according to the expected delay time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378051.7A CN111062541B (en) | 2019-12-27 | 2019-12-27 | Idle flight allocation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911378051.7A CN111062541B (en) | 2019-12-27 | 2019-12-27 | Idle flight allocation method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111062541A true CN111062541A (en) | 2020-04-24 |
| CN111062541B CN111062541B (en) | 2023-05-26 |
Family
ID=70304144
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911378051.7A Active CN111062541B (en) | 2019-12-27 | 2019-12-27 | Idle flight allocation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111062541B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030014293A1 (en) * | 2001-07-13 | 2003-01-16 | Honeywell International Inc. | Resource allocation |
| CA2642742A1 (en) * | 2006-02-21 | 2007-08-30 | Dynamic Intelligence Inc. | Transportation scheduling system |
| CN101421753A (en) * | 2006-02-21 | 2009-04-29 | 动力智能公司 | Transportation scheduling system |
| CN101465067A (en) * | 2009-01-15 | 2009-06-24 | 北京航空航天大学 | Aid decision-making method and system for scheduling airdrome scene flight |
| CN101630440A (en) * | 2009-06-01 | 2010-01-20 | 北京交通大学 | Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof |
| US8775341B1 (en) * | 2010-10-26 | 2014-07-08 | Michael Lamport Commons | Intelligent control with hierarchical stacked neural networks |
| EP2765545A1 (en) * | 2013-02-08 | 2014-08-13 | MBDA France | Method and device for multi objective optimisation |
| CN104580407A (en) * | 2014-12-24 | 2015-04-29 | 南京邮电大学 | VANET (vehicular ad hoc network) time slot reservation method based on game theory |
| CN107025805A (en) * | 2017-04-23 | 2017-08-08 | 温州云航信息科技有限公司 | Coordinated decision system moment computational methods and correspondence system based on candidate mechanism |
| CN107194491A (en) * | 2017-04-06 | 2017-09-22 | 广东工业大学 | A kind of dynamic dispatching method based on Forecasting of Travel Time between bus passenger flow and station |
| CN108734524A (en) * | 2018-05-29 | 2018-11-02 | 广州通易科技有限公司 | A kind of shipping index computational methods based on block chain technology |
| CN109584638A (en) * | 2018-12-17 | 2019-04-05 | 中国电子科技集团公司第二十八研究所 | A kind of earlier flight number cooperative optimization method of facing area network |
| CN110417588A (en) * | 2019-07-19 | 2019-11-05 | 北京科技大学 | A kind of aviation dynamic network paths planning method based on Game with Coalitions |
-
2019
- 2019-12-27 CN CN201911378051.7A patent/CN111062541B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030014293A1 (en) * | 2001-07-13 | 2003-01-16 | Honeywell International Inc. | Resource allocation |
| CA2642742A1 (en) * | 2006-02-21 | 2007-08-30 | Dynamic Intelligence Inc. | Transportation scheduling system |
| CN101421753A (en) * | 2006-02-21 | 2009-04-29 | 动力智能公司 | Transportation scheduling system |
| CN101465067A (en) * | 2009-01-15 | 2009-06-24 | 北京航空航天大学 | Aid decision-making method and system for scheduling airdrome scene flight |
| CN101630440A (en) * | 2009-06-01 | 2010-01-20 | 北京交通大学 | Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof |
| US8775341B1 (en) * | 2010-10-26 | 2014-07-08 | Michael Lamport Commons | Intelligent control with hierarchical stacked neural networks |
| EP2765545A1 (en) * | 2013-02-08 | 2014-08-13 | MBDA France | Method and device for multi objective optimisation |
| CN104580407A (en) * | 2014-12-24 | 2015-04-29 | 南京邮电大学 | VANET (vehicular ad hoc network) time slot reservation method based on game theory |
| CN107194491A (en) * | 2017-04-06 | 2017-09-22 | 广东工业大学 | A kind of dynamic dispatching method based on Forecasting of Travel Time between bus passenger flow and station |
| CN107025805A (en) * | 2017-04-23 | 2017-08-08 | 温州云航信息科技有限公司 | Coordinated decision system moment computational methods and correspondence system based on candidate mechanism |
| CN108734524A (en) * | 2018-05-29 | 2018-11-02 | 广州通易科技有限公司 | A kind of shipping index computational methods based on block chain technology |
| CN109584638A (en) * | 2018-12-17 | 2019-04-05 | 中国电子科技集团公司第二十八研究所 | A kind of earlier flight number cooperative optimization method of facing area network |
| CN110417588A (en) * | 2019-07-19 | 2019-11-05 | 北京科技大学 | A kind of aviation dynamic network paths planning method based on Game with Coalitions |
Non-Patent Citations (4)
| Title |
|---|
| 刘丽华: "《市场机制下飞机推出时隙分配模型与算法研究》", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 崔如玉: "《飞机排班问题模型及算法研究》", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 李国政;: "航班时刻资源供给模式对民航运输市场影响分析" * |
| 金永利;: "航班时刻资源的市场化配置理论研究" * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111062541B (en) | 2023-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kasirzadeh et al. | Airline crew scheduling: models, algorithms, and data sets | |
| Eltoukhy et al. | Airline schedule planning: a review and future directions | |
| Abdelghany et al. | A proactive crew recovery decision support tool for commercial airlines during irregular operations | |
| US8260650B2 (en) | Transportation scheduling system | |
| CN104751681B (en) | Statistical learning model based gate position allocation method | |
| Filar et al. | How airlines and airports recover from schedule perturbations: a survey | |
| US7957987B2 (en) | Using software agents to schedule airline flights | |
| JP2004526258A (en) | A schedule-based management system that optimizes aircraft arrivals at airports | |
| CA2675174A1 (en) | Strategic planning and revenue management system | |
| Inniss et al. | Estimating one-parameter airport arrival capacity distributions for air traffic flow management | |
| CN111462533B (en) | Flight departure time management method and system | |
| CN105469184A (en) | Duty block time control via statistical analysis | |
| CN115081699A (en) | Flight unit scheduling method in public air transportation of large aircraft | |
| Hall | Efficient capacity allocation in a collaborative air transportation system | |
| Kozanidis | A multiobjective model for maximizing fleet availability under the presence of flight and maintenance requirements | |
| Malik et al. | Runway scheduling for Charlotte Douglas international airport | |
| CN111062541A (en) | Idle flight allocation method and system | |
| CN110751857A (en) | Opportunity constraint air traffic flow management method | |
| CN109902924A (en) | Train capacity evaluating method in a kind of military airfield single flight road | |
| Grandeau | The processes of airline operational control | |
| Séguin | 1 Canadian forces flying training school (1 CFFTS) resource allocation simulation tool | |
| Zhong et al. | Operational aircraft routing problem: Some insights in the capacitated maintenance resources | |
| Iovanella et al. | The impact of 4D trajectories on arrival delays in mixed traffic scenarios | |
| Waltenberger et al. | Implications of short scheduled ground times for European carriers | |
| Burke | Implementing and evaluating alternative airspace rationing methods |
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 |