CN111178755B - Optimization method and system for idle flight time - Google Patents

Optimization method and system for idle flight time Download PDF

Info

Publication number
CN111178755B
CN111178755B CN201911381466.XA CN201911381466A CN111178755B CN 111178755 B CN111178755 B CN 111178755B CN 201911381466 A CN201911381466 A CN 201911381466A CN 111178755 B CN111178755 B CN 111178755B
Authority
CN
China
Prior art keywords
flight
idle
available
flights
matching
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911381466.XA
Other languages
Chinese (zh)
Other versions
CN111178755A (en
Inventor
许宏江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hainan Taimei Airlines Co ltd
Original Assignee
Hainan Taimei Airlines Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hainan Taimei Airlines Co ltd filed Critical Hainan Taimei Airlines Co ltd
Priority to CN201911381466.XA priority Critical patent/CN111178755B/en
Publication of CN111178755A publication Critical patent/CN111178755A/en
Application granted granted Critical
Publication of CN111178755B publication Critical patent/CN111178755B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/109Time management, e.g. calendars, reminders, meetings or time accounting
    • G06Q10/1093Calendar-based scheduling for persons or groups
    • G06Q10/1097Task assignment
    • G06Q50/40

Abstract

The invention discloses an optimization method and system for idle flight time, and relates to the technical field of flight time management. The method comprises the following steps: acquiring an optimization request of an idle flight time, wherein the optimization request comprises flight information of the idle flight time; matching available flights from the route data platform by taking the flight information as a matching condition; and optimizing the idle flight time according to the matched available flights. The invention is suitable for optimizing the idle flight time, avoids the participation of manual subjective experience, provides objective basis for optimizing the idle flight time, objectively reflects the available condition of the current flight time according to the available condition of the available flight, optimizes the idle flight time according to the available condition, and can improve the utilization rate of the idle flight.

Description

Optimization method and system for idle flight time
Technical Field
The invention relates to the technical field of flight time management, in particular to an optimization method and system for idle flight time.
Background
At present, 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 the influence of factors such as the number of aircrafts, the load factor, the income and the like, so that a certain number of idle flight times can be generated.
For idle flight time, flights are usually arranged according to the actual situation of the airline company, the idle flight time is frequently generated, the optimized flight time is adjusted according to manual experience, the idle flight is avoided, the optimization mode depends on the manual subjective experience, and the optimization result is not reliable enough.
Disclosure of Invention
The invention aims to solve the technical problem of providing an optimization method and system for idle flight time aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
an optimization method for idle flight time, comprising:
acquiring an optimization request of an idle flight time, wherein the optimization request comprises flight information of the idle flight time;
matching available flights from the route data platform by taking the flight information as a matching condition;
and optimizing the idle flight time according to the matched available flights.
The beneficial effects of the invention are as follows: according to the optimization method provided by the invention, the available flights are matched according to the flight information, and then the idle flight time is optimized according to the available flights, the optimization decision depends on the matched available flights, so that the participation of manual subjective experience is avoided, an objective basis is provided for optimizing the idle flight time, the available condition of the current flight time is objectively reflected by the available flight condition, and the idle flight time is optimized according to the available condition, so that the utilization rate of the idle flights can be improved.
The other technical scheme for solving the technical problems is as follows:
an optimization system for idle flight time, comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring an optimization request of idle flight time, and the optimization request comprises flight information of the idle flight time;
the matching unit is used for matching available flights from the route data platform by taking the flight information as a matching condition;
and the optimizing unit is used for optimizing the idle flight time according to the matched available flights.
According to the optimization system provided by the invention, the acquisition unit acquires the optimization request, the matching unit matches the available flights according to the flight information, the optimization unit optimizes the idle flight time according to the available flights, the decision of the optimization depends on the matched available flights, the participation of artificial subjective experience is avoided, objective basis is provided for optimizing the idle flight time, the available conditions of the current flight time are objectively reflected by the available flight conditions, and accordingly, the idle flight time is optimized, so that the utilization rate of the idle flights can be 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 optimization method for idle flight time according to the present invention;
FIG. 2 is a schematic diagram of timing interactions provided by other embodiments of the method for optimizing idle flight time of the present invention;
FIG. 3 is a schematic diagram of a structural framework provided by an embodiment of an optimization system for idle flight time.
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 an optimization method for idle flight time according to the present invention, where the optimization method includes:
s1, acquiring an optimization request of an idle flight time, wherein the optimization request comprises flight information of the idle flight time.
An idle flight time is understood to mean a time when no flight plan is scheduled, but the airline has access to that flight time. For example, for an airport, take-off time of the airport is divided at a certain time interval, and then different airlines are allowed to use, for example, take-off time can be 15 minutes, 30 minutes, 45 minutes, etc., which indicates that the airlines have to use the time, and specific take-off time needs to be uniformly scheduled by a tower, and will not be described herein. These flight times are related to airport busyness and runway usage, so that it is easy to have a situation where a particular number of flight times are idle too many and a portion of flight times are crowded.
The flight information may include: departure point, arrival point, departure time, arrival time, airplane type, etc., which flight information is specifically used as a matching condition can be selected according to the actual demands of users.
S2, matching available flights from the route data platform by taking the flight information as a matching condition.
It should be understood that available flights refer to idle flights that do not perform a flight mission, typically flights of other airlines, for example, if airline a has a flight time of an airport but is idle, when it is desired to optimize the idle flight time, an optimization request may be issued to the optimization system provided by the present invention, if a departure time a is a matching condition, all flights with a departure time a may be matched in the airline data platform, including all idle flights of airlines except for airline a, and if airline B has a flight that is idle, i.e., an aircraft may be used to perform a flight plan, and the departure time a may be one of available flights.
It should be noted that, the route data platform stores route basic information in a nationwide range, for example, may include information such as a planned flight, an initial departure point, a transit stop point, a quotation, a model, and the like, and also includes information such as a real-time status of each flight, for example, a passenger seat rate, whether to be idle, or whether to execute a flight plan, and the like. The route data platform can realize the acquisition of route information and flight information by accessing the control system of each airport and an airline company.
Alternatively, it should be appreciated that the airline may also actively publish the unused capacity information to the airline data platform, e.g., airline B may publish the remaining capacity information to the airline data platform in addition to the aircraft for which the flight plan has been planned, so that other airlines having unused flight times can match, thereby fully utilizing the remaining capacity, i.e., excluding the unused aircraft for which the flight plan has been planned.
It should be understood that for flight information such as a departure point, an arrival point, and an adaptive aircraft, it may be matched by an industry-universal airport three-code of the departure point, for example, assuming that the departure point is Beijing, and assuming that the departure point is Beijing, then the airport three-code is PEK, and the PEK may be used as a feature value, and available flights with a feature value of PEK may be matched from the route data platform.
For flight information such as departure time and arrival time, the time can be converted into a numerical value, the numerical value is taken as a characteristic value for matching, for example, the departure time is taken as a matching condition, the departure time is assumed to be 19 points 05 minutes, the numerical value can be directly converted, the conversion mode can be selected according to the actual requirement of a user, for convenience of explanation, the simplest conversion mode is taken as an example, the 19 points 05 minutes can be directly converted into the numerical value 1905, and then available flights with the characteristic value of the departure time being 1905 can be searched in a data platform.
Note that, one piece of flight information may be selected as the matching condition, or more than one piece of flight information may be selected as the matching condition, and the following description will be given by taking the case of simultaneously selecting the departure point and the arrival point as the matching condition.
Assuming that the departure point is Beijing and the departure time is 19:05, according to the above description, there are 2 characteristic values for matching, namely PEK and 1905, and then available flights can be matched in the airline data platform through the characteristic value of PEK first, and assuming that 20 available flights are matched, the 20 available flights can be used as a preliminary matching result. Then, the feature value is further matched in the 20 available flights through 1905, so as to obtain a final matching result.
And S3, optimizing the idle flight time according to the matched available flights.
It should be noted that the available flight situation objectively reflects the available situation of the current flight time, so that those skilled in the art can optimize the idle flight time according to the actual situation, and several optional optimization methods are given below.
For example, the idle flight time may be optimized by the number of available flights matched. When the number of matched available flights is large, the flight time is busy, and the reason for idle occurrence can be a sporadic factor, so that optimization does not need to be adjusted. If the number of the matched available flights is small, the flight time is idle, and idle is easy to occur, the flight time can be optimized, the flight time can be changed, the flight time can be cancelled or transferred to other airlines, and the utilization rate of idle flights is improved, so that loss is avoided.
For example, the idle flight time may be optimized according to the difference term of the matched available flights, if the matching condition does not include the departure time, the difference term of all the matched available flights is the departure time, and the rest of the flight information is the same or similar, and then all the available flights may be started according to the departure time of all the available flights, for example, if all the available flights are started at the morning and the limited flight time is afternoon, it is indicated that the flights started at the afternoon are few, which is not beneficial to limiting the utilization of the flight time, the flight time may be changed to the morning, so that the flight time is convenient to rent to other airlines for use, and the utilization of the idle flight is improved.
Those skilled in the art may select other optimization modes according to actual requirements, which will not be described in detail herein.
According to the optimization method provided by the embodiment, the available flights are matched according to the flight information, and then the idle flight time is optimized according to the available flights, the optimization decision depends on the matched available flights, so that participation of manual subjective experience is avoided, objective basis is provided for optimizing the idle flight time, the available conditions of the current flight time are objectively reflected by the conditions of the available flights, and accordingly, the idle flight time is optimized, and the objectivity and accuracy of optimization can be improved.
Optionally, in some embodiments, optimizing the idle flight time according to the matched available flights specifically includes:
when the number of the matched available flights is smaller than a preset value, updating the idle flight time according to a first preset time interval;
updating flight information according to the updated idle flight time;
using the updated flight information as a matching condition, and matching available flights again from the route data platform;
when the number of the available flights matched again is smaller than the preset value, updating the idle flight time again according to a second preset time interval;
wherein the second preset time interval is greater than the first preset time interval.
It should be appreciated that the preset value, the first preset time interval, and the second preset time interval may be set according to actual needs of the user, and the number of available flights matched is not 0.
For example, the first preset time interval may be 5 minutes and the second preset time interval may be 10 minutes.
Preferably, the score of the idle flight time may be updated according to a first preset time interval, and the time of the idle flight time may be updated according to the first preset time interval. For example, assuming that the idle flight time is 11 points 30 minutes, the first preset interval may be 10 minutes, and the second preset interval may be 1, then when the number of available flights matched is less than the preset value, the idle flight time may be updated to 11 points 20 minutes or 11 points 40 minutes; assuming 11 points 20 points for the first update, when the number of available flights that are again matched is less than the preset value, the idle flight time may be updated to 10 points 20 points or 12 points 20 points.
It should be appreciated that when the idle flight time is updated, the departure time and arrival time in the flight information will also change, and thus a corresponding update is required, for example, if the idle flight time is updated from point 11 to point 30 to point 11 to point 40, then the corresponding departure time and arrival time will ideally also increase by 10, and depending on the departure and arrival points, there may be an adjustment to the departure time and arrival time, for example, if the adjusted arrival time is arranged for the runway reaching the point, then an adaptive adjustment is required.
In this embodiment, the idle flight time is adjusted and optimized by two time intervals with different scales, and if the adjustment effect is not obvious after the idle flight time is adjusted and optimized by the time interval with a small scale, the idle flight time can be adjusted and optimized continuously by the time interval with a large scale, so as to ensure the optimized effect.
Preferably, a plurality of preset time intervals may be set, and the optimization of the idle flight time is repeated until the number of available flights matched is equal to or greater than a preset value.
The idle flight time is circularly optimized by setting a plurality of preset time intervals, so that the situation that the number of the matched available flights is reduced after optimization is prevented, the optimization of the idle flight time can be guaranteed to be forward optimization, the obtained optimization result can be guaranteed to meet expectations, and the practicability of the method is further improved.
Optionally, in some embodiments, matching available flights from the route data platform using the flight information as a matching condition, further includes:
and when the available flights are not matched, expanding the value range of preset parameters in the flight information, taking the flight information with the expanded value range as a matching condition, and matching the available flights again from the route data platform until at least one available flight is matched.
When the flight information is character data, such as a departure point, arrival point, model, etc., the expansion of the value range can be achieved by expanding the range of the departure point or the model. For example, assuming that a certain idle flight time does not match an available flight, the distance from the departure point a may be extended, set to other waypoints within 10km, and assuming that there are bc two waypoints, the matching may be continued with b and c two waypoints as the departure points.
For another example, if a certain idle flight time does not match an available flight, the range of models may be expanded, and if the model is the empty passenger a320, the models may be expanded to a310 to a330, and matching may be performed using a310, a320, and a330 as matching conditions.
It should be appreciated that when an available flight is not matched, information of successful unmatched can be returned, the user can manually select the expanded range, and assuming that the model is the air passenger a320, the user can manually select the model of the boeing as the matching condition.
When the flight information is numerical data, such as departure time and arrival time, the numerical range may be directly expanded, for example, assuming that the departure time is 18:00, the characteristic value may be 1800, and may be directly expanded to 1800-1805, that is, 1800, 1801, 1802, 1803, 1804 and 1805 are used as matching conditions, and available flights are matched again from the route data platform until at least one available flight is matched.
In the implementation, the value of the flight information is enlarged, so that at least one available flight can be guaranteed to be matched, and the subsequent analysis of idle flight time and the sorting and screening of the available flights are facilitated.
Optionally, in some embodiments, before matching the available flights from the airline data platform, further comprising:
setting available identifiers for all flights in the route data platform;
when the first flight is idle, judging whether the first flight is an available flight according to the matching identification;
wherein the first flight is any one flight in the route data platform.
It should be noted that, the matching identifier is used for judging whether to add one flight to the idle flight pool after the flight is idle, and is used for matching the idle flight time, for example, the matching identifier can be divided into 1 and 0, when 1 is set, the flight is idle, then the matching system of the air route platform is automatically entered, and the matching is performed according to the air route information; when the set is 0, it indicates that the flight does not want to match, and when the flight is idle, the matching system of the airline platform is not entered, and the flight may be reserved or important. The following is a description with reference to fig. 2.
As shown in fig. 2, an exemplary time-series interaction schematic is shown, where the airline data platform 20 is a centralized data platform, which is connected to the organic terminal 30 and the user terminal 10, where the airport terminal 30 provides the airline data platform 20 with real-time information of flights, and the user terminal 10 can initiate an optimization request, view flight data, and so on.
After the airline creates the flight data record, it can be marked by the matching identifier and then sent to the airline data platform 20 through the client 10. The route data platform 20 exchanges data with the airport terminal 30, monitors the service condition of each flight, and judges whether the idle flight is added into the matching pool through the matching identification when the flight is idle.
Assuming that the airline a has an idle flight time, the number of idle times of the flight time is too large through experience judgment, so that the airline a wants to optimize and change the idle flight time, and therefore, an optimization request is sent to the airline data platform 20 through the client 10. After receiving the optimization request, the route data platform 20 matches available flights from the matching pool according to the matching condition, performs optimization adjustment on idle flight time according to the matching result, and sends the adjusted result to the client 10 of the airline company a.
One possible scenario is that if the airline a wants to rent the idle flight time, after receiving the request, the route data platform 20 may send the matched available flights to the client 10 of the airline a for the airline a to choose, so as to complete pairing between the idle flight and the idle flight time, and improve the utilization rate of the idle flight.
In this embodiment, the idle flights are judged and distinguished by matching the identification, so that the judging efficiency can be improved, and the management of the flight data is facilitated.
Optionally, in some embodiments, further comprising:
setting screening conditions;
screening the matched available flights according to screening conditions;
and sorting the screened available flights.
When an airline company wants to rent idle flights to use by an airline data platform, the available flights matched with the idle flights of other airline companies can be screened and ordered by screening conditions.
The screening conditions may include, among others, the amount paid by other airlines at the time of using the idle flight, the average delay rate of the airlines, whether or not the airlines are on a low-cost basis, and the like.
For example, when a plurality of available flights are matched, the available flights can be screened through the delay rate, flights of airlines with delay rates higher than a certain value can be removed, and the available flights can be sorted according to the amount of paid money, and the best available flights can be ranked in the front through screening conditions, so that the selection of users is facilitated.
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 schematic structural framework provided for an embodiment of the optimization system for idle flight time according to the present invention, the optimization system includes:
the acquisition unit 1 is used for acquiring an optimization request of idle flight time, wherein the optimization request contains flight information of the idle flight time;
the matching unit 2 is used for matching available flights from the route data platform by taking the flight information as a matching condition;
and the optimizing unit 3 is used for optimizing the idle flight time according to the matched available flights.
According to the optimizing system provided by the embodiment, the acquiring unit 1 acquires the optimizing request, the matching unit 2 matches the available flights according to the flight information, the optimizing unit 3 optimizes the idle flight time according to the available flights, the decision of the optimization depends on the matched available flights, participation of artificial subjective experience is avoided, objective basis is provided for optimizing the idle flight time, the situation of the available flights objectively reflects the available situation of the current flight time, and accordingly the idle flight time is optimized, so that the objectivity and accuracy of the optimization can be improved.
Optionally, in some embodiments, the optimizing unit 3 is specifically configured to update the idle flight time according to the first preset time interval when the number of available flights matched is smaller than a preset value; updating flight information according to the updated idle flight time;
the matching unit 2 is further used for matching available flights again from the route data platform by taking the updated flight information as a matching condition; when the number of the available flights matched again is smaller than the preset value, updating the idle flight time again according to a second preset time interval;
wherein the second preset time interval is greater than the first preset time interval.
Optionally, in some embodiments, the matching unit 2 is further configured to, when the available flights are not matched, expand a value range of a preset parameter in the flight information, and re-match the available flights from the airline data platform until at least one available flight is matched with the flight information with the expanded value range as a matching condition.
Optionally, in some embodiments, further comprising:
the identification unit is used for setting available identifications for all flights in the route data platform; when the first flight is idle, judging whether the first flight is an available flight according to the matching identification;
wherein the first flight is any one flight in the route data platform.
Optionally, in some embodiments, further comprising:
a screening unit for setting screening conditions; screening the matched available flights according to screening conditions; and sorting the screened available flights.
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. A method for optimizing idle flight time, comprising:
acquiring an optimization request of an idle flight time, wherein the optimization request comprises flight information of the idle flight time;
matching available flights from the route data platform by taking the flight information as a matching condition;
optimizing the idle flight time according to the matched available flights;
optimizing the idle flight time according to the matched available flights, specifically including:
when the number of the matched available flights is smaller than a preset value, updating the idle flight time according to a first preset time interval;
updating the flight information according to the updated idle flight time;
re-matching available flights from the route data platform by taking the updated flight information as a matching condition;
when the number of the available flights matched again is smaller than the preset value, updating the idle flight time again according to a second preset time interval;
wherein the second preset time interval is greater than the first preset time interval.
2. The method of optimizing idle flight time of claim 1, wherein matching available flights from an airline data platform using the flight information as a matching condition, further comprising:
and when the available flights are not matched, expanding the value range of the preset parameters in the flight information, and using the flight information with the expanded value range as a matching condition, and matching the available flights again from the route data platform until at least one available flight is matched.
3. The method of optimizing idle flight time according to claim 1 or 2, further comprising, prior to matching available flights from the airline data platform:
setting available identifiers for all flights in the route data platform;
when a first flight is idle, judging whether the first flight is an available flight according to a matching identification;
wherein the first flight is any one flight in the route data platform.
4. The optimization method of idle flight time according to claim 1 or 2, further comprising:
setting screening conditions;
screening the matched available flights according to the screening conditions;
and sorting the screened available flights.
5. An optimization system for idle flight time, comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring an optimization request of idle flight time, and the optimization request comprises flight information of the idle flight time;
the matching unit is used for matching available flights from the route data platform by taking the flight information as a matching condition;
the optimizing unit is used for optimizing the idle flight time according to the matched available flights;
the optimizing unit is specifically configured to update the idle flight time according to a first preset time interval when the number of the matched available flights is smaller than a preset value; updating the flight information according to the updated idle flight time;
the matching unit is also used for matching available flights again from the route data platform by taking the updated flight information as a matching condition; when the number of the available flights matched again is smaller than the preset value, updating the idle flight time again according to a second preset time interval;
wherein the second preset time interval is greater than the first preset time interval.
6. The optimization system of idle flight time according to claim 5, wherein the matching unit is further configured to expand a value range of a preset parameter in the flight information when an available flight is not matched, and re-match the available flight from the route data platform until at least one available flight is matched, using the flight information with the expanded value range as a matching condition.
7. The optimization system for idle flight time of claim 5 or 6, further comprising:
the identification unit is used for setting available identifications for all flights in the route data platform; when a first flight is idle, judging whether the first flight is an available flight according to a matching identification;
wherein the first flight is any one flight in the route data platform.
8. The optimization system for idle flight time of claim 5 or 6, further comprising:
a screening unit for setting screening conditions; screening the matched available flights according to the screening conditions; and sorting the screened available flights.
CN201911381466.XA 2019-12-27 2019-12-27 Optimization method and system for idle flight time Active CN111178755B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911381466.XA CN111178755B (en) 2019-12-27 2019-12-27 Optimization method and system for idle flight time

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911381466.XA CN111178755B (en) 2019-12-27 2019-12-27 Optimization method and system for idle flight time

Publications (2)

Publication Number Publication Date
CN111178755A CN111178755A (en) 2020-05-19
CN111178755B true CN111178755B (en) 2023-06-13

Family

ID=70650446

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911381466.XA Active CN111178755B (en) 2019-12-27 2019-12-27 Optimization method and system for idle flight time

Country Status (1)

Country Link
CN (1) CN111178755B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107730187A (en) * 2017-11-17 2018-02-23 黄光乾 A kind of method of the country/international airline logistics transportation
CN109874111A (en) * 2017-12-05 2019-06-11 中兴通讯股份有限公司 Dispatching method, the method, apparatus and storage medium for sending information
CN110020745A (en) * 2019-01-09 2019-07-16 天津市市政工程设计研究院 Real-time large aerospace hinge parking lot scale forecast method based on flight schedule

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080201183A1 (en) * 2007-02-20 2008-08-21 Lockheed Martin Corporation Multi objective national airspace flight path optimization
CN105160944B (en) * 2015-08-31 2017-07-07 中国电子科技集团公司第二十八研究所 A kind of air route Resource dynamic allocation instrument and its implementation
CN107248323A (en) * 2017-08-12 2017-10-13 温州云航信息科技有限公司 Link flight number transposing systems flight Support Resource dispatching management information system and method
CN107749195A (en) * 2017-10-30 2018-03-02 如东信息技术服务(上海)有限公司 A kind of more airport and terminal area flight ordering systems
US20190340550A1 (en) * 2018-05-07 2019-11-07 Walmart Apollo, Llc Customized labor demand allocation system
CN109059928B (en) * 2018-08-28 2021-04-20 武汉理工大学 Air route exchange system under routing condition
CN109740871B (en) * 2018-12-18 2023-04-07 温州云航信息科技有限公司 Flight time slot resource utilization method based on buffer mechanism and corresponding system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107730187A (en) * 2017-11-17 2018-02-23 黄光乾 A kind of method of the country/international airline logistics transportation
CN109874111A (en) * 2017-12-05 2019-06-11 中兴通讯股份有限公司 Dispatching method, the method, apparatus and storage medium for sending information
CN110020745A (en) * 2019-01-09 2019-07-16 天津市市政工程设计研究院 Real-time large aerospace hinge parking lot scale forecast method based on flight schedule

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张勰;刘宏志;赵嶷飞.基于优先级的航班到达调度算法.科学技术与工程.2013,(33),全文. *
焦新龙;刘雪莲;王任祥;赵亚鹏.国际班轮运输航线配船优化模型与蚁群算法.交通运输工程学报.2013,(06),全文. *

Also Published As

Publication number Publication date
CN111178755A (en) 2020-05-19

Similar Documents

Publication Publication Date Title
CN111915046B (en) Method and device for outputting information
CN109584638B (en) Regional network-oriented advanced flight time collaborative optimization method
US7957987B2 (en) Using software agents to schedule airline flights
Wang et al. Frequency and aircraft size dynamics in a concentrated growth market: The case of the Chinese domestic market
CN111462533B (en) Flight departure time management method and system
CN109741638B (en) Integrated collaborative operation method for entering and leaving field management system
EP1188137A1 (en) Air traffic management system
CN110298604B (en) Flight plan generation method and device
CN111798079A (en) Flight adjustment method and device, electronic equipment and storage medium
CN115081699A (en) Flight unit scheduling method in public air transportation of large aircraft
CN112200438A (en) Flight seat adjusting method and device
CN110826757A (en) Flight scheduling method, device and equipment
CN111178755B (en) Optimization method and system for idle flight time
CN109979245B (en) Flight flow regulation and control method and device
JP2006523874A (en) Method for ordering landing aircraft
CN102595345A (en) Notification system for civil aviation passenger boarding gates based on short messages and method thereof
CN115049100B (en) Airport resource allocation optimization method, device and equipment and readable storage medium
CN1662915A (en) Method for loading flight schedule modifications
CN111950859B (en) Dynamic adaptation method and device for aviation communication data chain and storage medium
CN114943461A (en) Dynamic allocation method for supplies on airplane
KR101012333B1 (en) Method for loading flight schedule modifications
CN113222532A (en) Method and device for automatically modifying flight time of departure flight
CN110942240B (en) Information processing method, system, terminal and storage medium
CN114037232A (en) Online distribution method and device for home maintenance orders and terminal equipment
CN108986557B (en) Many-to-many flight time exchange system and method

Legal Events

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