CN110826840A - Flight plan recovery method and system - Google Patents
Flight plan recovery method and system Download PDFInfo
- Publication number
- CN110826840A CN110826840A CN201910750259.0A CN201910750259A CN110826840A CN 110826840 A CN110826840 A CN 110826840A CN 201910750259 A CN201910750259 A CN 201910750259A CN 110826840 A CN110826840 A CN 110826840A
- Authority
- CN
- China
- Prior art keywords
- event
- flight
- flight plan
- simulator
- deduction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000011084 recovery Methods 0.000 title claims abstract description 41
- 230000008569 process Effects 0.000 claims abstract description 15
- 238000013138 pruning Methods 0.000 claims abstract description 14
- 230000010006 flight Effects 0.000 claims description 31
- 238000004088 simulation Methods 0.000 claims description 17
- 230000007246 mechanism Effects 0.000 claims description 13
- 230000007704 transition Effects 0.000 claims description 9
- 230000008859 change Effects 0.000 claims description 7
- 238000013461 design Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000012423 maintenance Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000011156 evaluation Methods 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000004445 quantitative analysis Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000012067 mathematical method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/067—Enterprise or organisation modelling
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a flight plan recovery method and a flight plan recovery system, which can realize more reasonable flight real-time adjustment decision. The technical scheme is as follows: initializing a simulator based on an original flight plan, and deducing flight plan events based on disturbance events; when an unplanned disturbance event occurs, compiling and adjusting a flight plan and utilizing a simulator to deduce a feasible scheme in parallel; pruning is carried out in the parallel deduction process, and deduction is terminated for infeasible schemes for deduction of simulators in parallel; and when all feasible parallel schemes are deduced, selecting a final flight adjustment scheme from the feasible parallel schemes.
Description
Technical Field
The invention relates to a simulation technology, in particular to a flight plan recovery method and a flight plan recovery system realized by using the simulation technology.
Background
In actual operation, flight schedules made by airlines need to be adjusted in real time to ensure smooth operation of the schedules due to various changes that cannot be predicted in the early stages, such as severe weather, air traffic flow control, and mechanical failure of airplanes. For example, the originally prepared flight schedule cannot be carried out according to the plan, some flights need to be delayed or even cancelled, and some flights which cannot land at the destination airport need to be reserved to other airports. These variations break the original links between the front and back flights, including the links of the aircraft, the links of the crew, and further, disrupt the maintenance schedule of the aircraft. In actual operation, an airline operation control center needs to make a reasonable flight recovery scheme in a short time to ensure that subsequent flights are smoothly performed.
In the prior art, an optimized flight recovery scheme is formulated by adopting integer programming in a mathematical method. The method comprises the following steps:
firstly, determining model parameters, including unit delay time cost (weight), flight cancellation cost (weight), interchange plane cost (weight), maintenance change cost (weight) and the like.
And secondly, establishing an integer programming model, including determining a target cost function and determining constraint conditions to be met by a scheme. The target cost comprises possible delay cost, cancellation cost, exchange airplane cost and maintenance plan change cost of each flight; and the constraint conditions to be met comprise the minimum station-passing time, the aircraft meeting airline airworthiness requirements, the unit qualification compliance and the like.
And designing a solving algorithm of the established model to meet the requirements of large calculation amount caused by large problem scale and tight real-time decision time.
And fourthly, for a specific flight recovery scene, providing a recovery scheme through calculation.
At present, the flight real-time adjustment decision problem cannot be well solved by the integer programming-based technology. Integer programming requires that weights be given between adjustments, including delaying flights, canceling flights, changing planes, etc., but the flight dispatcher is not aware of the proper weight distribution, even if the given weights ultimately result in an infeasible solution. In addition, integer programming requires that all limiting factors can be written as mathematical equations or inequalities, which does not conform to the practice of implicit limiting factors that are common in practice.
Disclosure of Invention
The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description that is presented later.
The invention aims to solve the problems and provides a flight plan recovery method and a flight plan recovery system, so that more reasonable flight real-time adjustment decision is realized.
The technical scheme of the invention is as follows: the invention discloses a flight plan recovery method, which comprises the following steps:
step 1: initializing a simulator based on an original flight plan, and deducing flight plan events based on disturbance events;
step 2: when an unplanned disturbance event occurs, compiling and adjusting a flight plan and utilizing a simulator to deduce a feasible scheme in parallel;
and step 3: pruning is carried out in the parallel deduction process, and deduction is terminated for infeasible schemes for deduction of simulators in parallel;
and 4, step 4: and when all feasible parallel schemes are deduced, selecting a final flight adjustment scheme from the feasible parallel schemes.
According to an embodiment of the flight plan recovery method of the present invention, the simulator is based on a flight plan discrete event system model G ═ (X, E, f, Г, X)0V) design, where X represents the system state space, E represents the event space, f (X, E) represents the system state transition mechanism, Г determines what is feasible under the current system state, and V represents the event time update mechanism.
According to an embodiment of the flight plan recovery method of the present invention, step 1 further includes:
when the simulator is initialized, the initial time t is set to be 0, and the system state x is initialized to be x0The initialized system state represents the initial airport of all airplanes, all airplanes are defaulted to be capable of executing flights normally in the initial stage, all flights are in a waiting execution state, and an event list arranged from near to far according to the event occurrence time under the condition of the initial state { (e)1,t1),(e2,t2),…,(en,tn)}；
Taking out a first event, and if the first event is an unplanned disturbance event, deducing according to the step 2, if the first event is an event in a flight plan, updating a system state according to the flight plan in a simulator, wherein the system state is an airplane state and a flight state corresponding to the event, updating the system time, and updating an event list based on the new system state, wherein the updating of the event list comprises deleting an infeasible event, adding a new feasible event and reordering the event list according to time sequence;
and repeating the previous step until all events occur, the event list is empty, and the simulation deduction is finished.
According to an embodiment of the flight plan recovery method of the present invention, step 2 further includes:
when an unplanned disturbance event occurs, determining a plurality of new bifurcation states according to flight dispatching rules, and firstly copying a plurality of corresponding simulators to respectively correspond to the new bifurcation states;
and the plurality of simulators continue to simulate according to the adjusted flight plan, if the subsequent events do not change the rest flight plan, the simulators are deduced according to the plan, if the rest flight plan is changed by the subsequent events, the simulators with the corresponding number are copied on the basis of the original bifurcation, a new bifurcation determined according to the flight dispatching rule is deduced, and the steps are repeated until the event lists of all the simulators are empty, and the parallel deduction is finished.
According to an embodiment of the flight plan recovery method of the present invention, the flight scheduling rule includes: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
The invention also discloses a flight plan recovery system, which comprises:
the simulator initialization module initializes the simulator based on the original flight plan and deduces flight plan events based on disturbance events;
the simulator deduction module is used for compiling and adjusting flight plans and utilizing the simulator to deduce a feasible scheme in parallel when an unplanned disturbance event occurs;
the pruning module is used for implementing pruning processing in the parallel deduction process and terminating the deduction of infeasible schemes for deduction of the simulators in parallel;
and the scheme determining module selects a final flight adjusting scheme from all the feasible parallel schemes after deduction is finished.
According to an embodiment of the flight plan recovery system of the present invention, the simulator in the system is based on a flight plan discrete event system model G ═ (X, E, f, Г, X0V) design, where X represents the system state space, E represents the event space, f (X, E) represents the system state transition mechanism, Г determines what is feasible under the current system state, and V represents the event time update mechanism.
According to an embodiment of the flight plan recovery system of the invention, the simulator initialization module is configured to perform the following processes:
when the simulator is initialized, the initial time t is set to be 0, and the system state x is initialized to be x0The initialized system state represents the initial airport of all airplanes, all airplanes are defaulted to be capable of executing flights normally in the initial stage, all flights are in a waiting execution state, and an event list arranged from near to far according to the event occurrence time under the condition of the initial state { (e)1,t1),(e2,t2),…,(en,tn)}；
Taking out a first event, and if the first event is an unplanned disturbance event, deducing according to the step 2, if the first event is an event in a flight plan, updating a system state according to the flight plan in a simulator, wherein the system state is an airplane state and a flight state corresponding to the event, updating the system time, and updating an event list based on the new system state, wherein the updating of the event list comprises deleting an infeasible event, adding a new feasible event and reordering the event list according to time sequence;
and repeating the previous step until all events occur, the event list is empty, and the simulation deduction is finished.
According to an embodiment of the flight plan recovery system of the invention, the simulator deduction module is configured to perform the following processes:
when an unplanned disturbance event occurs, determining a plurality of new bifurcation states according to flight dispatching rules, and firstly copying a plurality of corresponding simulators to respectively correspond to the new bifurcation states;
and the plurality of simulators continue to simulate according to the adjusted flight plan, if the subsequent events do not change the rest flight plan, the simulators are deduced according to the plan, if the rest flight plan is changed by the subsequent events, the simulators with the corresponding number are copied on the basis of the original bifurcation, a new bifurcation determined according to the flight dispatching rule is deduced, and the steps are repeated until the event lists of all the simulators are empty, and the parallel deduction is finished.
According to an embodiment of the flight plan recovery system of the present invention, the flight scheduling rules include: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
Compared with the prior art, the invention has the following beneficial effects: the invention integrates the rich practical experience of flight allocating personnel, such as a regulation method based on rules, into the programmed flight recovery scheme by a simulation means. On one hand, the unreasonable parameters such as weight and the like can be prevented from being configured by allocating personnel; on the other hand, the programmed scheme can reasonably consider the implicit limiting factors because of being based on practical experience. The invention adopts the simulation technology to deduce the flight execution process, and combines the flight dispatching practical experience to compile a feasible adjusted flight plan for the condition that the original plan is infeasible due to disturbance factors, and selects the best. Compared with the prior art, firstly, when the flight dispatching method is combined with flight dispatching practice rules, implicit constraint factors which are difficult to quantify are considered in the generated feasible scheme, which is difficult to achieve by the existing integer planning method. Secondly, the invention firstly deduces a feasible flight plan scheme and then determines the preferred judgment standard, the decision sequence has good adaptability, and in the worst case, a feasible scheme is provided. In contrast, in integer programming, the weight parameters in the objective function are determined first, and then the model is solved, and according to the decision sequence, under the worst condition, no solution is possible, that is, no feasible solution exists.
Drawings
The above features and advantages of the present disclosure will be better understood upon reading the detailed description of embodiments of the disclosure in conjunction with the following drawings. In the drawings, components are not necessarily drawn to scale, and components having similar relative characteristics or features may have the same or similar reference numerals.
FIG. 1 shows a decision flow diagram of an embodiment of a flight plan recovery method of the present invention.
Fig. 2 shows a schematic diagram of a simulator used in the flight plan recovery method of the present invention.
Fig. 3 shows a schematic diagram of an embodiment of the flight plan recovery system of the invention.
Detailed Description
The invention is described in detail below with reference to the figures and specific embodiments. It is noted that the aspects described below in connection with the figures and the specific embodiments are only exemplary and should not be construed as imposing any limitation on the scope of the present invention.
The invention is based on establishing a flight plan discrete event system model, G ═ X, E, f, Г, X0V). X represents a system state space, comprising a state space of each airplane and a state space of each flight, wherein the state of each airplane comprises an airplane tail number, the state of each airplane (waiting, flying and maintaining), a waiting airport and a flight executed, and the state of each flight comprises a unique number of each flight, the state of each flight (waiting for execution, executing, completing and canceling), the actual departure time and the actual arrival time. E represents an event space, a packageF (x, e) represents a system state transition mechanism that, given a current system state x and an event e that occurs, determines a new state x' to transition to, where x and e are given, the next state of the system, i.e., which aircraft are performing which flights, which aircraft are waiting, etc., depending on the flight plan, Г determines which things are feasible under the current system state0Representing the initial state of the system, i.e., flight initial planning. V represents an event time update mechanism, and the flight plan and the disturbance event determine the life of the aircraft during takeoff, landing and disturbance event, i.e. the remaining time of the departure event, and the event life calculator shown in fig. 2 is V.
FIG. 1 shows a flow diagram of one embodiment of a flight plan recovery method of the present invention. Referring to fig. 1, an implementation flow of the flight plan recovery method of the embodiment is described in detail as follows.
Step S1: the simulator is initialized and flight planning events are deduced.
As shown in fig. 1, in the beginning phase, the original flight plan and disturbance events are prepared. Initializing the simulator according to the original flight plan, wherein the internal structure of the simulator is as shown in fig. 2, and records an initial time t equal to 0, and an initialization system state x equal to x0That is, all the initial staying airports of the airplanes are defaulted to execute flights normally in the initial stage of all the airplanes, and all the flights are in a waiting execution state; and event list under initial State conditions { (e)1,t1),(e2,t2),…,(en,tn) Suppose there are n airplanes, and each airplane has only takeoff for its corresponding feasible event, e.g. (e)1,t1) Corresponding to the aircraft 1 at the time t1Taking off the event, and analogizing the events corresponding to other airplanes, and sorting the events from near to far according to the event occurrence time, wherein the sorted event list is assumed to be { (e)1,t1),(e2,t2),…,(en,tn)}. Adding the disturbance event and the upcoming moment into an event list, and sorting the disturbance event and the upcoming moment from near to far according to time. Second, the first event is fetched, and, depending on its occurrence,if the disturbance event is an unplanned disturbance event, the deduction is performed according to step S2. If the event is an event in the flight plan, the system state is updated according to the flight plan, as shown in fig. 2, that is, the aircraft state and the flight state corresponding to the event are updated, and the system time is updated. And updating the event list, deleting the infeasible events, adding the new feasible events and reordering the event list according to the time sequence based on the new system state. And finally, repeating the previous step until all events occur, the event list is empty, and the simulation deduction is finished.
Step S2: when an unplanned disturbance event occurs, combining flight scheduling practical experience, compiling and deducing a feasible adjusted flight plan.
When the flight is scheduled, constraint factors such as an airplane, a unit, maintenance and the like need to be considered, wherein some constraints are difficult to quantify, so that in practice, an airline operation scheduling department can default to form a rule to guide the flight scheduling practice. It is difficult to meet these rules with a large number of possible solutions, which are difficult for flight attendants to exhale and thus to optimize. Through a state transition mechanism, the simulation method can adopt the flight dispatching rules, and when an unplanned disturbance event occurs, the rules are called to determine the next state of the flight simulation system. When the next state of the system is determined, a plurality of maneuvers meeting the rules are branched, and therefore, the maneuvered flight plans are deduced in parallel by fully utilizing the sufficient computing power of the computer. The specific implementation mode is as follows: when an unplanned disturbance event occurs and K new bifurcation states are determined according to a deployment rule, K simulators are copied firstly, and the simulators are completely the same except that the new states are the respective bifurcation states. The K simulators continue to simulate according to the new flight plan, if the rest flight plans are not changed by the next events, the simulation is deduced according to the plans, and the simulation is carried out according to the internal flow of the simulator in the figure 2; if the rest flight plans are changed by the following events, the simulators with the corresponding number are copied on the basis of the original bifurcation, and the new bifurcation determined according to the deployment rule is deduced. And repeating the steps until the event lists of all the simulators are empty, and finishing the parallel deduction.
In the process of deducing the flight plan, a method for deducing a feasible scheme in parallel by combining with the operation scheduling rule.
One specific scheduling rule is: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
For example, flights are classified into A, B, C, D, E, F, G, H, I types based on the following rules:
a is base station → transported station → base station
B, iridocompact/Pudong airport → station of input → Pudong airport/iridocompact
C, station of delivery → station of stop → station of delivery
iridocompass/Pudong airport → warp stop → Pudong airport/iridocompass
E: transported station → station of stopping → transported station
F: iridescent bridge airport/Pudong airport → warp stop → Pudong airport/iridescent bridge airport
G: station of warp stop → station of transport → station of warp stop
H: transported terminal → overnight terminal → terminal
I: others
When a flight needs to be cancelled, based on such rules, a specific flight cancellation string is selected, and these possibilities are deduced in parallel. In another aspect, flights are classified according to grades, cancellation and delay are reduced as much as possible for important flights, the classification grades can comprise VIP, VVIP, VIP key guarantee, common and the like, and specific grade separation can be different from one airline company to another. In addition, for flights with random units and flights with online passengers, the rules can guide the simulation deduction direction, so that the finally generated scheme is more in line with the actual operation requirement.
Step S3: pruning in the process is deduced in parallel.
As the deduction proceeds, solutions corresponding to some simulators in parallel become infeasible, and for such simulators, the deduction is terminated and the decision is called pruning. Pruning reduces unnecessary consumption of computing resources.
Step S4: when all feasible parallel schemes are deduced to be finished, the method is preferred.
The preferred evaluation criteria can be based on a quantitative method, and various weights need to be defined at the moment; it may also be based on qualitative rules; or a combination of quantitative and qualitative methods. And sequencing all the feasible parallel schemes according to the selected judgment standard, wherein the first scheme is the finally selected adjusted flight plan.
In this step, the optimal method for the feasible flight plan is to generate feasible plans and then select the final adjusted flight plan from the complete feasible plans. Before making the final decision, the simulation infers a certain number of solutions that perform well under some rough evaluation criteria. And in the final decision-making process, the decision-maker picks out the most appropriate flight recovery scheme according to the determined optimization standard.
Fig. 3 illustrates the principles of an embodiment of the flight plan recovery system of the present invention. Referring to fig. 3, the system of the present embodiment includes: the system comprises a simulator initialization module, a simulator deduction module, a pruning module and a scheme determination module.
The simulator in the system is based on flight plan discrete event system model G ═ X, E, f, Г, X0X represents the system state space, including the state space of each aircraft, the state space of each flight, where the state of the aircraft includes the tail number, the state of the aircraft itself (waiting, flight, maintenance), waiting for the airport, the flight performed, the state of the flight including the unique number of the flight, the state of the flight (waiting for execution, executing, completing, canceling), the actual departure time, the actual arrival time. E represents the event space, including the departure, landing, occurrence of disturbance factors, etc. f (X, E) represents the system state transition mechanism, given the current system state X and the event E that occurs, it is decided to transition to a new state X', where X and E are given, it is decided according to the flight plan which states the next stage state of the system, i.e. which aircraft are executing which flights, which aircraft are in the waiting state, etc. Г decides which things are feasible in the current system state0Representing the initial state of the system, i.e., flight initial planning. V represents an event time update mechanism, and the flight plan and the disturbance event determine the life of the aircraft during takeoff, landing and disturbance event, i.e. the remaining time of the departure event, and the event life calculator shown in fig. 2 is V.
The simulator initialization module initializes the simulator based on the original flight plan and deduces flight plan events based on the disturbance events.
The simulator initialization module is configured to perform the following processes:
as shown in fig. 1, in the beginning phase, the original flight plan and disturbance events are prepared. Initializing the simulator according to the original flight plan, wherein the internal structure of the simulator is as shown in fig. 2, and records an initial time t equal to 0, and an initialization system state x equal to x0That is, all the initial staying airports of the airplanes are defaulted to execute flights normally in the initial stage of all the airplanes, and all the flights are in a waiting execution state; and event list under initial State conditions { (e)1,t1),(e2,t2),…,(en,tn) Suppose there are n airplanes, and each airplane has only takeoff for its corresponding feasible event, e.g. (e)1,t1) Corresponding to the aircraft 1 at the time t1Taking off the event, and analogizing the events corresponding to other airplanes, and sorting the events from near to far according to the event occurrence time, wherein the sorted event list is assumed to be { (e)1,t1),(e2,t2),…,(en,tn)}. Adding the disturbance event and the upcoming moment into an event list, and sorting the disturbance event and the upcoming moment from near to far according to time. Next, the first event is extracted, and if it is an unplanned disturbance event, it is deduced in step S2. If the event is an event in the flight plan, the system state is updated according to the flight plan, as shown in fig. 2, that is, the aircraft state and the flight state corresponding to the event are updated, and the system time is updated. And updating the event list, deleting the infeasible events, adding the new feasible events and reordering the event list according to the time sequence based on the new system state. Finally, the previous step is repeated until all eventsAll the events occur, the event list is empty, and the simulation deduction is finished.
In the simulator deduction module, when an unplanned disturbance event occurs, a flight schedule is compiled and adjusted, and a feasible scheme is deduced in parallel by using the simulator.
The simulator deduction module is configured to implement the following processes:
when an unplanned disturbance event occurs, determining a plurality of new bifurcation states according to flight dispatching rules, and firstly copying a plurality of corresponding simulators to respectively correspond to the new bifurcation states;
and the plurality of simulators continue to simulate according to the adjusted flight plan, if the subsequent events do not change the rest flight plan, the simulators are deduced according to the plan, if the rest flight plan is changed by the subsequent events, the simulators with the corresponding number are copied on the basis of the original bifurcation, a new bifurcation determined according to the flight dispatching rule is deduced, and the steps are repeated until the event lists of all the simulators are empty, and the parallel deduction is finished.
The flight scheduling rules include: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
In the pruning module, pruning processing is carried out in the parallel deduction process, and deduction is terminated for the infeasible scheme of simulator deduction in the parallel. Pruning reduces unnecessary consumption of computing resources.
And in the scheme determining module, selecting a final flight adjusting scheme from all feasible parallel schemes after deduction is finished.
The preferred evaluation criteria can be based on a quantitative method, and various weights need to be defined at the moment; it may also be based on qualitative rules; or a combination of quantitative and qualitative methods. And sequencing all the feasible parallel schemes according to the selected judgment standard, wherein the first scheme is the finally selected adjusted flight plan.
In this step, the optimal method for the feasible flight plan is to generate feasible plans and then select the final adjusted flight plan from the complete feasible plans. Before making the final decision, the simulation infers a certain number of solutions that perform well under some rough evaluation criteria. And in the final decision-making process, the decision-maker picks out the most appropriate flight recovery scheme according to the determined optimization standard.
While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of acts, it is to be understood and appreciated that the methodologies are not limited by the order of acts, as some acts may, in accordance with one or more embodiments, occur in different orders and/or concurrently with other acts from that shown and described herein or not shown and described herein, as would be understood by one skilled in the art.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software as a computer program product, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a web site, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk (disk) and disc (disc), as used herein, includes Compact Disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disk and blu-ray disc where disks (disks) usually reproduce data magnetically, while discs (discs) reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A flight plan recovery method, comprising:
step 1: initializing a simulator based on an original flight plan, and deducing flight plan events based on disturbance events;
step 2: when an unplanned disturbance event occurs, compiling and adjusting a flight plan and utilizing a simulator to deduce a feasible scheme in parallel;
and step 3: pruning is carried out in the parallel deduction process, and deduction is terminated for infeasible schemes for deduction of simulators in parallel;
and 4, step 4: and when all feasible parallel schemes are deduced, selecting a final flight adjustment scheme from the feasible parallel schemes.
2. The flight plan recovery method of claim 1, wherein the simulator is based on a flight plan discrete event system model G ═ (X, E, f, Г, X)0V) design, where X represents the system state space, E represents the event space, f (X, E) represents the system state transition mechanism, Г determines what is feasible under the current system state, and V represents the event time update mechanism.
3. The flight plan recovery method of claim 2, wherein step 1 further comprises:
when the simulator is initialized, the initial time t is set to be 0, and the system state x is initialized to be x0The initialized system state represents the initial airport of all airplanes, all airplanes are defaulted to be capable of executing flights normally in the initial stage, all flights are in a waiting execution state, and an event list arranged from near to far according to the event occurrence time under the condition of the initial state { (e)1,t1),(e2,t2),…,(en,tn)}；
Taking out a first event, and if the first event is an unplanned disturbance event, deducing according to the step 2, if the first event is an event in a flight plan, updating a system state according to the flight plan in a simulator, wherein the system state is an airplane state and a flight state corresponding to the event, updating the system time, and updating an event list based on the new system state, wherein the updating of the event list comprises deleting an infeasible event, adding a new feasible event and reordering the event list according to time sequence;
and repeating the previous step until all events occur, the event list is empty, and the simulation deduction is finished.
4. The flight plan recovery method of claim 3, wherein step 2 further comprises:
when an unplanned disturbance event occurs, determining a plurality of new bifurcation states according to flight dispatching rules, and firstly copying a plurality of corresponding simulators to respectively correspond to the new bifurcation states;
and the plurality of simulators continue to simulate according to the adjusted flight plan, if the subsequent events do not change the rest flight plan, the simulators are deduced according to the plan, if the rest flight plan is changed by the subsequent events, the simulators with the corresponding number are copied on the basis of the original bifurcation, a new bifurcation determined according to the flight dispatching rule is deduced, and the steps are repeated until the event lists of all the simulators are empty, and the parallel deduction is finished.
5. The flight plan recovery method of claim 4, wherein the flight scheduling rules include: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
6. A flight plan recovery system, comprising:
the simulator initialization module initializes the simulator based on the original flight plan and deduces flight plan events based on disturbance events;
the simulator deduction module is used for compiling and adjusting flight plans and utilizing the simulator to deduce a feasible scheme in parallel when an unplanned disturbance event occurs;
the pruning module is used for implementing pruning processing in the parallel deduction process and terminating the deduction of infeasible schemes for deduction of the simulators in parallel;
and the scheme determining module selects a final flight adjusting scheme from all the feasible parallel schemes after deduction is finished.
7. The flight plan recovery system of claim 6, wherein the simulator in the system is based on the flight plan discrete event system model G ═ (X, E, f, Г, X)0V) design, where X represents the system state space, E represents the event space, f (X, E) represents the system state transition mechanism, Г determines what is feasible under the current system state, and V represents the event time update mechanism.
8. The flight plan recovery system of claim 7, wherein the simulator initialization module is configured to perform the following:
when the simulator is initialized, the initial time t is set to be 0, and the system state x is initialized to be x0The initialized system state represents the initial airport of all airplanes, all airplanes are defaulted to be capable of executing flights normally in the initial stage, all flights are in a waiting execution state, and an event list arranged from near to far according to the event occurrence time under the condition of the initial state { (e)1,t1),(e2,t2),…,(en,tn)}；
Taking out a first event, and if the first event is an unplanned disturbance event, deducing according to the step 2, if the first event is an event in a flight plan, updating a system state according to the flight plan in a simulator, wherein the system state is an airplane state and a flight state corresponding to the event, updating the system time, and updating an event list based on the new system state, wherein the updating of the event list comprises deleting an infeasible event, adding a new feasible event and reordering the event list according to time sequence;
and repeating the previous step until all events occur, the event list is empty, and the simulation deduction is finished.
9. The flight plan recovery system of claim 8, wherein the simulator deduction module is configured to perform the following:
when an unplanned disturbance event occurs, determining a plurality of new bifurcation states according to flight dispatching rules, and firstly copying a plurality of corresponding simulators to respectively correspond to the new bifurcation states;
and the plurality of simulators continue to simulate according to the adjusted flight plan, if the subsequent events do not change the rest flight plan, the simulators are deduced according to the plan, if the rest flight plan is changed by the subsequent events, the simulators with the corresponding number are copied on the basis of the original bifurcation, a new bifurcation determined according to the flight dispatching rule is deduced, and the steps are repeated until the event lists of all the simulators are empty, and the parallel deduction is finished.
10. The flight plan recovery system of claim 9, wherein the flight booking rules comprise: when choosing to cancel a flight, a flight is not cancelled individually, but rather a series of flights are cancelled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910750259.0A CN110826840B (en) | 2019-08-14 | 2019-08-14 | Flight plan recovery method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910750259.0A CN110826840B (en) | 2019-08-14 | 2019-08-14 | Flight plan recovery method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110826840A true CN110826840A (en) | 2020-02-21 |
| CN110826840B CN110826840B (en) | 2020-07-17 |
Family
ID=69547831
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910750259.0A Active CN110826840B (en) | 2019-08-14 | 2019-08-14 | Flight plan recovery method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110826840B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353721A (en) * | 2020-03-24 | 2020-06-30 | 杭州派迩信息技术有限公司 | Flight recovery system based on flight value evaluation |
| CN112966942A (en) * | 2021-03-10 | 2021-06-15 | 携程旅游网络技术（上海）有限公司 | Method, system, device and medium for automatically adjusting flight schedule |
| CN113222533A (en) * | 2021-04-28 | 2021-08-06 | 广州民航信息技术有限公司 | Method and device for automatically initializing departure flights |
| CN114004441A (en) * | 2021-09-10 | 2022-02-01 | 宁波诺丁汉大学 | Vehicle scheduling scheme parallelization deduction calculation method |
| CN114298506A (en) * | 2021-12-17 | 2022-04-08 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Dynamic group planning deduction and adjustment method and device |
| CN114595863A (en) * | 2022-01-12 | 2022-06-07 | 杭州优迈科思信息科技有限责任公司 | Flight intelligent recovery method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218681A (en) * | 2013-03-19 | 2013-07-24 | 天津市市政工程设计研究院 | Aviation hub emergency management and control method |
| US20150023206A1 (en) * | 2013-07-16 | 2015-01-22 | Thomson Licensing | Method for selecting nodes in a network, corresponding device, computer program and non-transitory computer-readable medium |
| CN105468793A (en) * | 2016-01-20 | 2016-04-06 | 北京华如科技股份有限公司 | Automated management method for simulation model data |
| CN106529676A (en) * | 2016-10-25 | 2017-03-22 | 胡煜州 | Deductive lattice and reasoning method based on deductive lattice |
| CN108615411A (en) * | 2016-12-13 | 2018-10-02 | 北京航管科技有限公司 | a kind of method and device for realizing flight information processing |
| CN108961843A (en) * | 2018-08-22 | 2018-12-07 | 中国商用飞机有限责任公司北京民用飞机技术研究中心 | A kind of analogue system and method based on track running technology |
| CN109063225A (en) * | 2018-06-05 | 2018-12-21 | 北京交通大学 | One kind runing emulation mode towards more cargo functional areas Railway Logistics Center |
-
2019
- 2019-08-14 CN CN201910750259.0A patent/CN110826840B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218681A (en) * | 2013-03-19 | 2013-07-24 | 天津市市政工程设计研究院 | Aviation hub emergency management and control method |
| US20150023206A1 (en) * | 2013-07-16 | 2015-01-22 | Thomson Licensing | Method for selecting nodes in a network, corresponding device, computer program and non-transitory computer-readable medium |
| CN105468793A (en) * | 2016-01-20 | 2016-04-06 | 北京华如科技股份有限公司 | Automated management method for simulation model data |
| CN106529676A (en) * | 2016-10-25 | 2017-03-22 | 胡煜州 | Deductive lattice and reasoning method based on deductive lattice |
| CN108615411A (en) * | 2016-12-13 | 2018-10-02 | 北京航管科技有限公司 | a kind of method and device for realizing flight information processing |
| CN109063225A (en) * | 2018-06-05 | 2018-12-21 | 北京交通大学 | One kind runing emulation mode towards more cargo functional areas Railway Logistics Center |
| CN108961843A (en) * | 2018-08-22 | 2018-12-07 | 中国商用飞机有限责任公司北京民用飞机技术研究中心 | A kind of analogue system and method based on track running technology |
Non-Patent Citations (2)
| Title |
|---|
| 于焯: "机场航班航线调度优化管理仿真研究", 《计算机仿真》 * |
| 周语: "基于不确定因素扰动的机场大面积航班恢复规划", 《科学技术与工程》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353721A (en) * | 2020-03-24 | 2020-06-30 | 杭州派迩信息技术有限公司 | Flight recovery system based on flight value evaluation |
| CN111353721B (en) * | 2020-03-24 | 2023-08-08 | 杭州派迩信息技术有限公司 | Flight recovery system based on flight value evaluation |
| CN112966942A (en) * | 2021-03-10 | 2021-06-15 | 携程旅游网络技术（上海）有限公司 | Method, system, device and medium for automatically adjusting flight schedule |
| CN113222533A (en) * | 2021-04-28 | 2021-08-06 | 广州民航信息技术有限公司 | Method and device for automatically initializing departure flights |
| CN114004441A (en) * | 2021-09-10 | 2022-02-01 | 宁波诺丁汉大学 | Vehicle scheduling scheme parallelization deduction calculation method |
| CN114004441B (en) * | 2021-09-10 | 2024-06-07 | 宁波诺丁汉大学 | Parallelization deduction calculation method for vehicle scheduling scheme |
| CN114298506A (en) * | 2021-12-17 | 2022-04-08 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Dynamic group planning deduction and adjustment method and device |
| CN114298506B (en) * | 2021-12-17 | 2023-01-06 | 中国铁道科学研究院集团有限公司电子计算技术研究所 | Dynamic group planning deduction and adjustment method and device |
| CN114595863A (en) * | 2022-01-12 | 2022-06-07 | 杭州优迈科思信息科技有限责任公司 | Flight intelligent recovery method and system |
| CN114595863B (en) * | 2022-01-12 | 2023-12-15 | 杭州优迈科思信息科技有限责任公司 | Intelligent flight recovery method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110826840B (en) | 2020-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110826840B (en) | Flight plan recovery method and system | |
| Kasirzadeh et al. | Airline crew scheduling: models, algorithms, and data sets | |
| Hu et al. | Genetic algorithm based on receding horizon control for arrival sequencing and scheduling | |
| CN109584638B (en) | Regional network-oriented advanced flight time collaborative optimization method | |
| Zhang et al. | Optimization for gate re-assignment | |
| CN110533228B (en) | Flight recovery method considering passenger willingness | |
| Lee et al. | A multi-objective genetic algorithm for robust flight scheduling using simulation | |
| Solveling et al. | Runway operations optimization in the presence of uncertainties | |
| CN110826754B (en) | Method, device and equipment for determining target parameter value and scheduling flights | |
| CN111915046A (en) | Method and apparatus for outputting information | |
| CN105825304A (en) | Method and system for robust network planning optimization of airline flight operations | |
| CN109840610A (en) | Irregular flight aircraft path and passenger's stroke automatic recovery system and method | |
| Pyrgiotis | A stochastic and dynamic model of delay propagation within an airport network for policy analysis | |
| Brunner | Rescheduling of flights during ground delay programs with consideration of passenger and crew connections | |
| CN113643571A (en) | Airspace network optimization method based on flight normality target | |
| CN110826757B (en) | Flight scheduling method, device and equipment thereof | |
| CN110751309A (en) | Abnormal flight recovery method, electronic equipment and storage medium | |
| CN113112874A (en) | Collaborative optimization allocation method for air route time slot and height layer | |
| CN118246607A (en) | Machine position distribution method based on dynamic task graph modeling | |
| CN112862258B (en) | Limited-nature flight recovery method considering passenger preference | |
| CN110909946B (en) | Flight plan optimization method based on road transfer | |
| Şi̇mşek et al. | Resilient airline scheduling to minimize delay risks | |
| Rhodes-Leader et al. | Multi-fidelity simulation optimisation for airline disruption management | |
| JPH07285439A (en) | Device and method for preparing train diagram by genetic algorithm/neuro | |
| CN112613667A (en) | Automatic scheduling method for passenger cabin personnel |
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 | ||
| CP02 | Change in the address of a patent holder |
Address after: No.18, zone 1, 8228 Beiqing Road, Xianghuaqiao street, Qingpu District, Shanghai, 201707 Patentee after: China Eastern technology application R & D Center Co.,Ltd. Address before: No.18, zone 1, 8228 Beiqing Road, Xianghua street, Qingpu District, Shanghai, 201707 Patentee before: China Eastern technology application R & D Center Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |