CN111062541B - Idle flight allocation method and system - Google Patents
Idle flight allocation method and system Download PDFInfo
- Publication number
- CN111062541B CN111062541B CN201911378051.7A CN201911378051A CN111062541B CN 111062541 B CN111062541 B CN 111062541B CN 201911378051 A CN201911378051 A CN 201911378051A CN 111062541 B CN111062541 B CN 111062541B
- Authority
- CN
- China
- Prior art keywords
- idle
- route
- flight
- time
- aircraft
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Aviation & Aerospace Engineering (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
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 alliance member, maximizing benefits as a game target, and performing games through a preset alliance game model; and acquiring the number of the idle aircrafts, and distributing the idle aircrafts to the idle flight time in each idle route according to the game result and the number of the idle aircrafts. According to the invention, the league games are introduced into the idle flight allocation process, the idle airlines are used as league members, and game is carried out with the aim of maximizing the benefits, so that the game result with the maximized benefits can be obtained, the game result is realized independently of manual experience, then, the idle airlines are allocated to each idle airline according to the game result, and the flight allocation scheme with the maximized benefits can be obtained, so that the overall benefits of airlines are 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
Currently, flight schemes are mainly planned based on manual experience, and each airline company has a certain number of flight times, however, each airline company cannot arrange the flight schemes at all flight times due to factors such as the number of aircrafts, the load factor, the income and the like.
When the flight is idle, the flight is usually manually allocated, and the allocation method depends on manual experience and cannot maximize the benefit.
Disclosure of Invention
The invention aims to solve the technical problem of providing an idle flight allocation method and system aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
an idle flight allocation method, comprising:
determining at least two idle routes and idle flight time in each idle route;
taking each idle route as a alliance member, maximizing benefits as a game target, and performing games through a preset alliance game model;
and acquiring the number of the idle aircrafts, and distributing the idle aircrafts to idle flight time in each idle route according to a game result and the number of the idle aircrafts.
The beneficial effects of the invention are as follows: according to the invention, the league games are introduced into the idle flight allocation process, the idle airlines are used as league members, and game is carried out with the aim of maximizing the benefits, so that the game result with the maximized benefits can be obtained, the game result is realized independently of manual experience, then, the idle airlines are allocated to each idle airline according to the game result, and the flight allocation scheme with the maximized benefits can be obtained, so that the overall benefits of airlines are improved.
The other technical scheme for solving the technical problems is as follows:
an idle flight allocation 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 route as a alliance member, maximizing the benefits as game targets and performing games through a preset alliance game model;
the flight allocation unit is used for acquiring the number of the idle aircrafts and allocating the idle aircrafts to the idle flight time in each idle route according to the game result and the number of the idle aircrafts.
According to the invention, the alliance game is introduced into the idle flight allocation process, the information of the idle airlines is read from the airlines data platform through the information reading unit, the information processing unit takes the idle airlines as alliance members, and plays the game with the aim of maximizing the profits, so that the game result with maximized profits can be obtained, the game is realized independently of manual experience, then the flight allocation unit allocates the idle airlines to each idle airline according to the game result, and the flight allocation scheme with maximized profits can be obtained, so that the overall profits of airlines are improved.
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 of an embodiment of an idle flight allocation method according to the present invention;
FIG. 2 is a schematic diagram of a repetitive flight according to another embodiment of the present invention;
FIG. 3 is a block diagram of an embodiment of an idle flight distribution system according to the present invention.
Detailed Description
The principles and features of the present invention are described below with reference to the drawings, the illustrated embodiments are provided for illustration only and are not intended to limit the scope of the present invention.
As shown in fig. 1, a flow chart is provided for an embodiment of a method for allocating idle flights according to the present invention, where the method is applicable to allocation of idle flights, and includes:
s1, determining at least two idle routes and idle flight time in each idle route.
It should be noted that, the idle route refers to a route including idle flight time, and no matter how many idle flight time is included, the route may be used as an idle route as long as the route includes idle flight time, and a person skilled in the art can understand that the determination of the idle flight time is performed within a certain date, for example, may be within 1 year, 1 month, 1 week, etc., and the selected time scale may be different, which may be set by a person skilled in the art according to actual needs.
The idle flight time refers to a time when a flight plan is not arranged, but the airline company has a right of use for the flight time. For example, for an airport, take-off time of the airport may be divided at a certain time interval, for example, take-off time may be 15 points, 30 points, 15 points, 45 points, etc., which indicates that the use rights of the airlines to these times, and specific take-off time needs to be uniformly scheduled by the tower, which is not described herein.
That is, the current flight time allocation method only focuses on the flight time, i.e. whether the aircraft takes off or lands at the flight time, but does not focus on where the aircraft takes off, and the origin and arrival waypoints are connected with the corresponding airports by the airlines, so that the idle flight time is not easy to allocate.
The invention divides the idle flight time by the idle route, which is convenient for subsequent game and flight allocation. For example, assuming that an airline has three routes A, B and C, and that on a given day, for example, between x-month x-day x-y-month y-day, two routes a and B have idle flight times, that is, flight times for which no flight plan is scheduled, two routes a and B may be taken as idle routes, for example, a may be: a-month a-day, b-month b-day, and c-month c-day of the year a, b-month b-day, and c-month c-day.
S2, taking each idle route as a alliance member, maximizing benefits as a game target, and performing games through a preset alliance game model.
An example of a coalition gaming model is given below.
Wherein i= {1,2, …, n } is a set of n federation members, S i Is the set formed by all subsets of I that contain the ith coalition member, |s| is the set S i The number of elements contained in the matrix, ω (|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 that member i makes in his participating collaboration s, i.e., the expected revenue generated. The sum of such cooperations is (|s| -1) |! (n- |s|) is-! The way in which each occurs, and therefore the probability of each occurrence is ω (|s|).
S3, obtaining the number of the idle aircrafts, and distributing the idle aircrafts to the idle flight time in each idle route according to the game result and the number of the idle aircrafts.
This is specifically described below with an example.
For example, assuming 2 idle routes, a first idle route having 5 scheduled flight times and a second idle route having 3 scheduled flight times, the result is a first idle route of 3 and a second idle route of 1 when the number of flights for the 2 idle routes is 3:1 after the 2 idle routes are gambed. Then the aircraft for each route is scheduled in that proportion, assuming that there are 4 idle aircraft, then 3 out of the 5 schedulable idle flight times for the first idle route are selected, the flight plan is scheduled, and 1 out of the 3 schedulable idle flight times for the second idle route are selected, the flight plan is scheduled.
It should be noted that, the idle flight time may be selected in a random manner, or may be selected according to the time sequence of the idle flight time.
According to 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 aim of maximizing the benefits, the game result with the maximized benefits can be obtained, the game is realized independently of manual experience, then the idle airlines are allocated to each idle airline according to the game result, and the flight allocation scheme with the maximized benefits can be obtained, so that the overall benefits of the airlines are improved.
Optionally, in some embodiments, it may further include:
judging whether a first idle route exists or not, wherein the number of idle flight time of the first idle route is smaller than the number of idle planes distributed for the first idle route;
when a first idle route exists, redundant idle planes distributed for the first idle route are distributed to the rest idle routes according to a first game result;
it should be understood that the rest of the idle routes refer to rest of the idle routes except the first idle route among all of the idle routes.
The first game result is a game result after the first idle route is removed.
The following is a specific example.
Assuming that the number of idle flight times of the idle route A is 3, the number of idle flight times of the idle route B is 4, the number of idle flight times of the idle route C is 2, the game result is that 6 planes are allocated for the idle route A, 2 planes are allocated for the idle route B, and 1 plane is allocated for the idle route C, then the idle route B can directly select 2 idle flight times from the 4 idle flight times to allocate the plane plan, and the idle route C can directly select 1 idle flight time from the 2 idle flight times to allocate the plane plan.
For the idle route A, the number of the idle aircrafts allocated to the idle route A is larger than the number of idle flight time, so that the resource waste is obviously caused, and 3 aircrafts can be allocated to the idle route A preferentially, so that the requirement of all idle flight time is met.
For the remaining 3 aircraft, the remaining idle routes may be assigned. From the above example, the ratio of the game results of the idle route a, the idle route B and the idle route C is 6:2:1, and the ratio of the first game result after the idle route a is excluded is 2:1, so that more 3 aircraft can be allocated to the idle route B and the idle route C according to the ratio of 2:1, thereby ensuring the overall utilization rate of the idle flight time.
In this embodiment, by monitoring the idle routes of which the number of allocated idle aircrafts is greater than that of idle flight time, when the first idle route occurs, the allocation scheme of the idle aircrafts is timely adjusted, so that the overall utilization rate of the idle flight time can be improved on the premise of meeting the maximization of benefits.
Optionally, in some embodiments, it may further include:
judging whether a second idle route exists or not, wherein the number of idle flight time of the second idle route is larger than the number of idle planes distributed for the second idle route;
when the 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 the idle aircrafts according to the judgment result, and reallocating the idle aircrafts for the idle flight time in each idle route according to the game result and the updated number of the idle aircrafts;
the first idle airplane is any one of idle airplanes distributed for the second idle route according to the game result and the number of idle airplanes.
It should be noted that, the repeated flight refers to a flight plan of the next idle flight after the aircraft completes the flight plan of the current idle flight time.
The usage time refers to the time between when the aircraft executes the current flight plan and when the next flight plan can be executed, and may generally include the round trip time for the aircraft to execute the flight plan, the service time, and other preparation times, which may be reserved for crew preparation times and other emergencies, and the like.
For example, assuming that the available flights of the idle route a are 3, but the game result is to allocate 2 airplanes for the idle route a, then assuming that a certain airplane can continue to be used after performing the flight plan return and overhauling, the airplane can continue to perform the flight plan, thereby saving the number of airplanes, assuming that 10 airplanes are available before, the number of idle airplanes can now be counted by 11 airplanes, that is, the number of idle airplanes is increased by one, so that the overall utilization of the idle route is improved by using the least number of airplanes.
Further describing the following description with reference to the accompanying drawings, as shown in fig. 2, an exemplary repetitive flight schematic is provided, assuming that for the idle route a, the starting point is A1, the arrival point is A2, taking the starting point as A1 as an example, and 3 idle flight times, respectively, are 5 months, 7 days, 16 days, 5 months, 8 days, 7 days, and 5 months, 9 days, 14, and assuming that the use time of the idle aircraft a for the idle route a is 1 day, it can be seen that for the idle flight time of 5 months, 8 days, 7, the idle aircraft a cannot continue to execute the flight task, but for the idle flight time of 5 months, 9 days, 14, the idle aircraft a can continue to execute the flight task, and then the 2 idle aircraft allocated for the idle route a can be served as the idle aircraft a, which is equivalent to adding one to the total number of idle aircraft, so as to enable more idle aircraft to be put into use, and to reduce the idle flight time on the whole.
Optionally, in some embodiments, determining whether the first idle aircraft is capable of repeatedly flying 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 times in the second idle route;
judging whether the service time of the first idle airplane is smaller than the time difference, if so, judging that the first idle airplane can repeatedly fly on the second idle route, otherwise, judging that the first idle airplane cannot repeatedly fly on the second idle route.
Continuing with the example shown in FIG. 2, for the 3 idle flights shown in FIG. 2, the time difference between any two idle flights is 15 hours, 31 hours and 46 hours, respectively, and the aircraft use time is 1 day, i.e., 24 hours, then it is determined that the idle aircraft a can fly repeatedly. The first flight schedule was 5 months 7 days 16 and 5 months 9 days 14, and was two flights because the time difference between them was 46 hours, which is greater than the use time of the aircraft by 24 hours; the second flight schedule was 5 month 8 day 7 and 5 month 9 day 14, which were two flights, as the time difference between them was 31 hours, which was greater than 24 hours of use of the aircraft.
For another example, assuming that 3 idle flights are 5 months 7 days 16 hours, 5 months 7 days 18 hours, and 5 months 8 days 14 hours, respectively, then the time difference between any two idle flights may be 2 hours, 20 hours, and 22 hours, respectively, that are less than 24 hours of use of the aircraft, then a conclusion may be drawn that the first idle aircraft cannot fly repeatedly 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 service time of the aircraft.
Preferably, when there is a time difference greater than the usage time of the first idle aircraft, 2 idle route moments corresponding to the time difference are obtained and calculated, and when any two time differences have the same idle route moment, one of the time differences is removed.
For example, continuing to take the example shown in fig. 2 for a total of 2 time differences greater than 24 hours, 31 hours and 46 hours, respectively, then by reverse derivation, 31 hours of idle route time can be obtained at 5 months 8 days 7 hours and 5 months 9 days 14 hours; the idle route time of 46 hours is 5 months 7 days 16 and 5 months 9 days 14.
When the two time differences exist at the same idle route time of 5 months and 9 days 14, the increase of the number of idle aircrafts caused by the two time differences is not overlapped, that is, the idle aircrafts a can only select the first flight plan or the second flight plan and cannot be selected at the same time.
And the specific selection of which idle flight time can be set according to actual requirements.
According to the preferred embodiment, whether any two time differences have the same idle route time is judged, so that the flight plans which cannot be executed simultaneously are eliminated, the practicability of the method is further improved, and the method has the advantage of high processing efficiency.
Optionally, in some embodiments, determining whether the first idle aircraft is capable of repeating the flight before 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 service time of the first idle airplane according to the expected delay time.
It should be appreciated that the expected delay time may be determined empirically by hand, or may be calculated as an average of historical delay times for the aircraft.
It is to be noted that the expected delay time may be calculated within the use time.
According to the method and the device, the historical delay time is considered in the service time of the airplane, so that the robustness of the method and the device can be further improved, and the error of the subsequent idle airplane distribution plan caused by the delay of the airplane is avoided.
It is to be understood that in some embodiments, some or all of the alternatives described in the various embodiments above may be included.
As shown in fig. 3, a structural framework diagram is provided for an embodiment of an idle flight allocation system of the present invention, which is suitable for allocation of 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 route as a alliance member, maximizing the benefits as game targets, and performing games through a preset alliance game model;
the flight allocation unit 3 is used for obtaining the number of the idle aircrafts and allocating the idle aircrafts to the idle flight time in each idle route according to the game result and the number of the idle aircrafts.
In the embodiment, the information of the idle airlines is read from the airlines data platform through the information reading unit 1 in the process of introducing the alliance game into the idle airlines distribution, the information processing unit 2 takes the idle airlines as alliance members to game with the aim of maximizing the profits, the game result of maximizing the profits can be obtained, the game is realized independently of manual experience, then the idle airlines are distributed to each idle airline by the flight distribution unit 3 according to the game result, and the flight distribution scheme of maximizing the profits can be obtained, so that the overall profits of airlines are improved.
Optionally, in some embodiments, it may further include:
a first judging unit 4, configured to judge whether a first idle route exists, where the number of idle flight time of the first idle route is smaller than the number of idle aircraft allocated for the first idle route;
the flight allocation unit 3 is further configured to allocate, when the first idle route exists, redundant idle planes allocated for the first idle route to the remaining idle routes according to the first game result;
the first game result is a game result after the first idle route is removed.
Optionally, in some embodiments, it may further include:
a second judging unit 5, configured to judge whether a second idle route exists, where the number of idle flight time of the second idle route is greater than the number of idle aircraft allocated for the second idle route; when the 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 allocation unit 3 is further configured to update the number of idle aircrafts according to the determination result, and reallocate the idle aircrafts for the idle flight time in each idle route according to the game result and the updated number of idle aircrafts;
the first idle airplane is any one of idle airplanes distributed for the second idle route according to the game result and the number of idle airplanes.
Optionally, in some embodiments, the second determining unit 5 may be specifically configured to obtain a time difference between any two idle flight times in the second idle route; judging whether the service time of the first idle airplane is smaller than the time difference, if so, judging that the first idle airplane can repeatedly fly on the second idle route, otherwise, judging that the first idle airplane cannot repeatedly fly on the second idle route.
Optionally, in some embodiments, the information reading unit 1 may be further configured to obtain a historical delay time of the first idle aircraft;
the information processing unit 2 is further used for determining the expected delay time of the first idle aircraft according to the historical delay time; and updating the usage time of the first idle aircraft according to the expected delay time.
It is to be understood that in some embodiments, some or all of the alternatives described in the various embodiments above may be included.
It should be noted that, the foregoing embodiments are product embodiments corresponding to the previous method embodiments, and the description of each optional implementation manner in the product embodiments may refer to the corresponding description in the foregoing method embodiments, which is not repeated herein.
The reader will appreciate that in the description of this specification, a description of terms "one embodiment," "some embodiments," "examples," "specific examples," 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, schematic representations of the above terms are not necessarily directed 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, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the method embodiments described above are merely illustrative, e.g., the division of steps is merely a logical function division, and there may be additional divisions of actual implementation, e.g., multiple steps may be combined or integrated into another step, or some features may be omitted or not performed.
The present invention is not limited to the above embodiments, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the present invention, and these modifications and substitutions are intended to be included in the scope of the present invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.
Claims (8)
1. An idle flight allocation method, comprising:
determining at least two idle routes and idle flight time in each idle route;
taking each idle route as a alliance member, maximizing benefits as a game target, and performing games through a preset alliance game model;
acquiring the number of idle aircrafts, and distributing the idle aircrafts for idle flight time in each idle route according to a game result and the number of idle aircrafts;
wherein, still include:
judging whether a first idle route exists or not, wherein the number of idle flight time of the first idle route is smaller than the number of idle planes distributed for the first idle route;
when the first idle route exists, redundant idle planes distributed for the first idle route are distributed to the rest idle routes according to a first game result;
the first game result is a game result after the first idle route is removed.
2. The idle flight allocation method of claim 1, further comprising:
judging whether a second idle route exists, wherein the number of idle flight time of the second idle route is larger than the number of idle planes distributed for the second idle route;
when the 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 the idle aircrafts according to the judgment result, and reassigning the idle aircrafts for the idle flight time in each idle route according to the game result and the updated number of the idle aircrafts;
the first idle airplane is any one of idle airplanes distributed for the second idle route according to the game result and the number of the idle airplanes.
3. The method for allocating idle flights according to claim 2, wherein determining whether a first idle aircraft is capable of repeatedly flying on the second idle route according to a usage time of the first idle aircraft comprises:
acquiring the time difference between any two idle flight moments in the second idle route;
judging whether the service time of the first idle airplane is smaller than the time difference, if so, judging that the first idle airplane can repeatedly fly on the second idle route, otherwise, judging that the first idle airplane cannot repeatedly fly on the second idle route.
4. The method of claim 2, wherein determining whether a first idle aircraft is capable of repeating flights before the second idle aircraft based on a time of use of the first idle aircraft further comprises:
acquiring the 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.
5. 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 route as a alliance member, maximizing the benefits as game targets and performing games through a preset alliance game model;
the flight allocation unit is used for acquiring the number of the idle aircrafts and allocating the idle aircrafts to the idle flight time in each idle route according to the game result and the number of the idle aircrafts;
wherein, still include:
the first judging unit is used for judging whether a first idle route exists or not, and the number of idle flight time of the first idle route is smaller than the number of idle planes distributed for the first idle route;
the flight allocation unit is further used for allocating redundant idle planes allocated to the first idle route to other idle routes according to a first game result when the first idle route exists;
the first game result is a game result after the first idle route is removed.
6. The idle flight distribution system of claim 5, further comprising:
the second judging unit is used for judging whether a second idle route exists or not, and the number of idle flight time of the second idle route is larger than the number of idle planes distributed for the second idle route; when the 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 is also used for updating the number of the idle aircrafts according to the judgment result, and redistributing the idle aircrafts for the idle flight time in each idle route according to the game result and the updated number of the idle aircrafts;
the first idle airplane is any one of idle airplanes distributed for the second idle route according to the game result and the number of the idle airplanes.
7. The idle flight allocation system according to claim 6, wherein the second judging unit is specifically configured to obtain a time difference between any two idle flight times in the second idle route; judging whether the service time of the first idle airplane is smaller than the time difference, if so, judging that the first idle airplane can repeatedly fly on the second idle route, otherwise, judging that the first idle airplane cannot repeatedly fly on the second idle route.
8. The idle flight allocation system of claim 6, wherein the information reading unit is further configured to obtain a historical delay time of the first idle aircraft;
the information processing unit is also used for determining the expected delay time of the first idle airplane according to the historical delay time; and updating the use 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 CN111062541A (en) | 2020-04-24 |
| CN111062541B true 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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6954931B2 (en) * | 2001-07-13 | 2005-10-11 | Honeywell International, Inc. | Resource allocation |
| CN101465067B (en) * | 2009-01-15 | 2011-03-30 | 北京航空航天大学 | Aid decision-making method and system for scheduling airdrome scene flight |
| CN101630440B (en) * | 2009-06-01 | 2011-03-16 | 北京交通大学 | Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof |
| CN104580407B (en) * | 2014-12-24 | 2018-03-13 | 南京邮电大学 | A kind of vehicle self-organizing 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 |
| CN107025805B (en) * | 2017-04-23 | 2022-09-13 | 温州云航信息科技有限公司 | Time calculation method of cooperative decision system based on candidate mechanism and corresponding system |
| CN108734524A (en) * | 2018-05-29 | 2018-11-02 | 广州通易科技有限公司 | A kind of shipping index computational methods based on block chain technology |
| CN109584638B (en) * | 2018-12-17 | 2021-11-02 | 中国电子科技集团公司第二十八研究所 | Regional network-oriented advanced flight time collaborative optimization method |
| CN110417588B (en) * | 2019-07-19 | 2020-10-20 | 北京科技大学 | Aviation dynamic network path planning method based on alliance game |
-
2019
- 2019-12-27 CN CN201911378051.7A patent/CN111062541B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
Non-Patent Citations (2)
| Title |
|---|
| 李国政 ; .航班时刻资源供给模式对民航运输市场影响分析.管理现代化.2012,(第03期),全文. * |
| 金永利 ; .航班时刻资源的市场化配置理论研究.经济问题探索.2009,(第05期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111062541A (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pellegrini et al. | SOSTA: An effective model for the Simultaneous Optimisation of airport SloT Allocation | |
| CN103426331B (en) | Multi-airport collaborative delivery system flight sorting and decision making method | |
| CN104751681B (en) | Statistical learning model based gate position allocation method | |
| US7957987B2 (en) | Using software agents to schedule airline flights | |
| JP2004526258A (en) | A schedule-based management system that optimizes aircraft arrivals at airports | |
| Inniss et al. | Estimating one-parameter airport arrival capacity distributions for air traffic flow management | |
| CN111462533B (en) | Flight departure time management method and system | |
| US20220284534A1 (en) | Tracing-based passenger protection method and apparatus, and check-in system | |
| CN113112874B (en) | Collaborative optimization allocation method for air route time slot and height layer | |
| CN115081699A (en) | Flight unit scheduling method in public air transportation of large aircraft | |
| CN105469184A (en) | Duty block time control via statistical analysis | |
| CN106447215A (en) | Method for pre-distributing aircraft berths in airport | |
| CN107341620B (en) | BADA fuel consumption rate-based method for calculating delay cost of incoming flights in short-term weather | |
| CN109902924B (en) | Military airport single runway training capacity evaluation method | |
| Terrab et al. | Dynamic strategic and tactical air traffic flow control | |
| CN111062541B (en) | Idle flight allocation method and system | |
| CN112651673A (en) | Resource planning method and related equipment | |
| Verma et al. | Tactical surface metering procedures and information needs for charlotte douglas international airport | |
| Malik et al. | Runway scheduling for Charlotte Douglas international airport | |
| Veatch et al. | Feeding the bottleneck: airport congestion during relief operations | |
| CN109598985A (en) | Air route resources co-allocation method | |
| Sherali et al. | An air force crew allocation and scheduling problem | |
| Verma et al. | Evaluation of a tactical surface metering tool for Charlotte Douglas international airport via human-in-the-loop simulation | |
| García et al. | Airline re-fleeting managing revenues and maintenance operations | |
| Bae et al. | Modified mixed integer linear program for airport departure scheduling |
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 |