CN111047144B - Flight task ring generation method and device for scheduling of unit - Google Patents

Flight task ring generation method and device for scheduling of unit Download PDF

Info

Publication number
CN111047144B
CN111047144B CN201911129011.9A CN201911129011A CN111047144B CN 111047144 B CN111047144 B CN 111047144B CN 201911129011 A CN201911129011 A CN 201911129011A CN 111047144 B CN111047144 B CN 111047144B
Authority
CN
China
Prior art keywords
flight
subset
task ring
ring
flights
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
CN201911129011.9A
Other languages
Chinese (zh)
Other versions
CN111047144A (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.)
Shanghai Shanshu Network Technology Co ltd
Shanshu Science And Technology Beijing Co ltd
Shenzhen Shanzhi Technology Co Ltd
Original Assignee
Shanghai Shanshu Network Technology Co ltd
Shanshu Science And Technology Beijing Co ltd
Shenzhen Shanzhi Technology 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 Shanghai Shanshu Network Technology Co ltd, Shanshu Science And Technology Beijing Co ltd, Shenzhen Shanzhi Technology Co Ltd filed Critical Shanghai Shanshu Network Technology Co ltd
Priority to CN201911129011.9A priority Critical patent/CN111047144B/en
Publication of CN111047144A publication Critical patent/CN111047144A/en
Application granted granted Critical
Publication of CN111047144B publication Critical patent/CN111047144B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/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/06316—Sequencing of tasks or work
    • 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
    • G06Q50/40—

Abstract

The invention relates to the technical field of flight unit scheduling, in particular to a flight task ring generation method and device for unit scheduling. The method comprises the following steps: step 1: acquiring a flight set A generated by participating in a flight task ring; step 2: connecting the flights in the flight set pairwise to generate a flight connection set; and step 3: and taking the maximum efficiency values of all flight connecting lines in the flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, inputting the flight connecting line set into the mixed integer linear programming model, and obtaining a legal flight task ring set R. The invention connects flights pairwise to build a flight connection set, then uses the maximum efficiency values of all flight connections in a flight task ring as a target function to build a mixed integer linear programming model, and finally uses the mixed integer linear programming model to efficiently and accurately obtain a legal flight task ring set.

Description

Flight task ring generation method and device for scheduling of unit
Technical Field
The invention relates to the technical field of flight unit scheduling, in particular to a flight task ring generation method and device for unit scheduling.
Background
Generally, an airline company connects the flight tasks of an airplane end to end according to a flight plan to form a ring task string, which is also called a flight task ring. Each flight mission loop is executed by a complete unit, and the flight mission loop must be started from a base and finally returned to the base to meet the rest requirements of the crew, and some indexes of pilots and crews of each unit, such as the total duration of a single-day duty period, the total duration of a single-day flight time, the duration of a rest period and the like, need to strictly comply with civil aviation related regulations such as CCAR-121-R5 regulations and the like. And the reasonable component flight task ring can improve the scheduling efficiency and accuracy of the unit and reduce the operation cost.
But typically airlines want to obtain a shift result of half a month or more at a time, which typically involves hundreds of airplanes and tens of thousands of flights. In the period, the possibility of forming flight connecting lines and task rings is extremely high, the number of variables reaches millions, and each flight task ring also needs to strictly meet relevant regulations of civil aviation, cannot be calculated in an exhaustive mode, and is more difficult to solve a good result in an effective time.
Therefore, an efficient and accurate flight mission loop generation scheme is needed.
Disclosure of Invention
The invention aims to provide a flight task ring generation method and a flight task ring generation device for scheduling of a unit, and aims to solve the problem that the efficiency and the accuracy of the existing flight task ring generation scheme are not high.
The embodiment of the invention provides the following scheme:
in a first aspect, an embodiment of the present invention provides a flight task ring generation method for scheduling a unit, including:
step 1: acquiring a flight set A generated by participating in a flight task ring;
step 2: connecting the flights in the flight set pairwise to generate a flight connection set;
and step 3: and taking the maximum efficiency values of all flight connecting lines in the flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, and inputting the flight connecting line set into the mixed integer linear programming model to obtain a legal flight task ring set R.
In a possible embodiment, the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
step 3.1: inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
step 3.2: dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
step 3.3: inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000031
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000032
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000033
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjFlight connection formed by connectionSetting an efficiency weight of the line; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000034
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000041
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000042
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000043
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, the mixed integer linear programming model comprises a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into a second mixed integer linear programming model to obtain a legal flight task ring set R;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000044
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000051
wherein A isikAnd AjkAll flights in the flight set A located in a flight task ring k;
Figure BDA0002277749190000052
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection; when flight AikConnecting back flight AjkWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000053
get 1, otherwise
Figure BDA0002277749190000054
Taking 0;
Figure BDA0002277749190000055
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmkThe flights in the flight subset B which are positioned in a flight task ring k; c is a flight subset of the flight set A with the starting station as the base, CnkThe flights in the flight subset C which are positioned in a flight task ring k; d is the flight setIn HeA, a subset of flights whose arrival stations are bases, DlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, further comprising:
and 4, step 4: inputting the legal flight task ring set R into a mixed integer linear fraction planning model to obtain a final legal flight task ring set;
an objective function M of the mixed integer linear fraction programming model3The expression of (a) is:
Figure BDA0002277749190000056
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000061
wherein R isp、RqAnd RrAll flight task rings in the legal flight task ring set R;
Figure BDA0002277749190000062
for flight task ring RpBackward and flight task ring RqSetting an efficiency weight for splicing; when the ring R is matched with the flight taskpWith flight task ring RqWhen the splicing treatment is carried out,
Figure BDA0002277749190000063
get 1, otherwise
Figure BDA0002277749190000064
Take 0.
In a possible embodiment, before step 3.3, the following steps are further included:
step 3.2.1: updating the constraint conditions of the first mixed integer linear programming model according to the flight task rings in the first legal flight task ring subset, and establishing a new first mixed integer linear programming model;
step 3.2.2: inputting the first legal flight task ring subset into the new first mixed integer linear programming model to obtain a new first flight task ring subset; dividing the new first flight task ring set into a new first legal flight task ring subset and a new first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring; and taking the first legal flight task ring subset as the first legal flight task ring subset, adding the flight task ring in the new first illegal flight task ring subset into the first illegal flight task ring subset, and updating the first illegal flight task ring subset.
In a possible embodiment, before step 3, removing the illegal flight connection from the set of flight connections;
the illegal flight connection comprises the condition that the accumulated time length of the illegal flight connection exceeds the maximum accumulated time length of a flight task ring and/or the interval time between flights at the front end and the rear end of the illegal flight connection is less than the minimum interval time of the flights.
In a possible embodiment, before step 3, the flight links used to generate the flight mission ring of the fixed itinerary are removed from the set of flight links.
In a second aspect, an embodiment of the present invention provides a flight task ring generation apparatus for scheduling a unit, including:
the flight connecting line generating module is used for connecting the flights in the flight set A pairwise to generate a flight connecting line set;
the fixed route flight task ring generation module is used for generating a fixed route flight task ring according to the flight connection set;
the flight connecting line filtering module is used for removing illegal flight connecting lines and flight connecting lines of a flight task ring used for generating a fixed route from the flight connecting line set;
the flight task ring generating module is used for obtaining a legal flight task ring R by using a mixed integer linear programming model;
the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000081
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000082
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000083
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000084
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000091
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000092
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000093
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkFor the flight task located in the flight subset DFlights in ring k.
In a third aspect, an embodiment of the present invention provides an intelligent whiteboard screenshot file management apparatus, including:
a memory for storing a computer program;
a processor for executing the computer program to implement the steps of the flight mission ring generation method for crew scheduling according to any one of the above first aspects.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the steps of the flight task ring generation method for crew shift according to any one of the above first aspects.
Compared with the prior art, the invention has the following advantages and beneficial effects:
according to the invention, according to the flight set generated by participating in the flight task ring, the flights are connected in pairs to form the flight connection set, then the maximum efficiency values of all flight connections in the flight task ring are used as the target function to form a mixed integer linear programming model, and finally the mixed integer linear programming model is used for efficiently and accurately obtaining the legal flight task ring set.
Further, the invention provides a flight mission ring generation algorithm comprising two mixed integer linear programming models. The first mixed integer linear programming model only has two dimensions (namely flights at the front end and the rear end of a flight connecting line), so that the selection of the constraint condition is relatively simple, and the first flight task ring set of the optimal solution is conveniently and quickly calculated. However, because the objective function is set simply, the first flight task ring set inevitably includes longer flight task rings exceeding the maximum accumulated time of the flight task rings, and the invention also uses a second mixed integer linear programming model of three dimensions (namely, flights at the front end and the rear end of a flight connecting line and flight task rings to which the flights belong) to split the longer flight task rings, thereby further improving the overall calculation speed while ensuring the accuracy of the construction of the flight task rings.
Further, the invention provides a flight mission ring generation algorithm comprising a mixed integer linear programming model. The second mixed integer linear programming model has three dimensions, namely flights at the front end and the rear end of a flight connecting line and flight task rings to which the flights belong, and by using the three dimensions, stricter constraint conditions can be constructed, so that the finally output optimal solution does not contain longer aviation task rings exceeding the maximum accumulated time of the flight task rings, and the accuracy of constructing the flight task rings is further improved.
Furthermore, the invention also comprises a post-processing step, wherein the shorter flight task rings in the flight task ring set R are spliced two by two to form a longer aviation task ring with higher efficiency and without exceeding the maximum accumulated time of the flight task rings, so that the accuracy and the rationality of the construction of the flight task rings are further improved.
Furthermore, the iterative process is added between the two mixed integer linear programming models, the constraint conditions of the first mixed integer linear programming model are updated through the analysis of the first legal flight task ring subset, the first legal flight task ring subset is optimized again through the updated first mixed integer linear programming model, and the originally generated first legal flight task ring subset and the first illegal flight task ring subset are replaced according to the output optimal solution, so that the rationality and the quality of the first legal flight task ring subset are improved, the number of the first illegal flight task rings is increased, and the accuracy and the rationality of the flight task ring construction are finally improved.
Furthermore, before flight connection data are input into the mixed integer linear programming model, the flight connection data are screened and analyzed, some non-compliant flight connections are filtered, the calculation amount of the model is reduced, and the accuracy and the speed of flight task ring building are further improved.
Furthermore, the invention considers that some fixed lines exist in the current international flight task ring, and the flight lines of the lines are known and fixed in a certain time, so that the invention removes the flight connecting lines of the flight task ring for establishing the fixed lines before inputting the flight connecting line data into the mixed integer linear programming model, reduces the computation of the model and further improves the accuracy and the speed of establishing the flight task ring.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present specification, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a possible embodiment of a flight mission ring generation method for scheduling a crew according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a hardware structure of a possible computer device according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a hardware structure of a possible computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, rather than all embodiments, and all other embodiments obtained by those skilled in the art based on the embodiments of the present invention belong to the scope of protection of the embodiments of the present invention.
The embodiment of the invention provides a flight task ring generation method for scheduling a unit, which comprises the following steps:
step 1: acquiring a flight set A generated by participating in a flight task ring;
step 2: connecting the flights in the flight set pairwise to generate a flight connection set;
and step 3: and taking the maximum efficiency values of all flight connecting lines in the flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, and inputting the flight connecting line set into the mixed integer linear programming model to obtain a legal flight task ring set R.
Specifically, in the embodiment of the present invention, by calling flight data of an airline company, a flight set a may be obtained, and information such as a departure/landing airport, a departure/landing time, and a flight time of an initial data flight included in flights in the flight set a may be obtained, so that data such as a start station, an arrival station, and an overall duration of the flights may be obtained from the flights.
Specifically, the flight connection in the embodiment of the present invention is a connection between two flights, and a flight connection set is generated by traversing all flights in the flight set a.
Specifically, in the embodiment of the present invention, the maximum efficiency values of all flight links in a flight task ring are used as the objective function of the mixed integer linear programming model, the efficiency of the flight links needs to be preset by comprehensively considering the conditions of the distance between the two flight departure and landing airports, the interval duration, the setting of the connected set, and the like, for example, the landing airport of flight a is the same as the departure airport of flight B, and the set does not need to be set, so the efficiency of the flight link between flight a and flight B is higher, if the arrival time of flight a is shorter or longer than the departure time of flight B, the efficiency of the flight link between flight a and flight B is lower, in practical applications, the efficiency value of the flight link can be set according to needs, and certainly, in order to take the efficiency value as a negative value, the behavior of the flight link is excited in a reverse direction, so when the sum of the efficiency values of the flight links in a certain flight task, then the flight mission ring would also be the optimal flight mission ring.
According to the flight set generated by participating in the flight task ring, the flights are connected pairwise to form the flight connection set, then the maximum efficiency values of all flight connections in the flight task ring are used as target functions to form a mixed integer linear programming model, and finally the mixed integer linear programming model is used for efficiently and accurately obtaining the legal flight task ring set.
In a possible embodiment, the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
step 3.1: inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
step 3.2: dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
step 3.3: inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
specifically, the accumulated time of the flight task ring comprises the accumulated flight time of the flight task ring and the accumulated duty time of the flight task ring; the maximum accumulated time of the flight task ring comprises the maximum accumulated flight time and the maximum accumulated duty time; the fact that the accumulated time of the flight task ring does not exceed the maximum accumulated time of the flight task ring means that the accumulated flight time of the flight task ring does not exceed the maximum accumulated flight time and the accumulated on-duty time of the flight task ring does not exceed the maximum accumulated on-duty time.
The accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000141
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000142
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000143
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000144
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000151
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000152
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000153
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
Specifically, in the embodiment of the present invention, the flight connection line is regarded as a directed graph with a connection direction, and the constraint condition of the mixed integer linear programming model is constructed by using the entrance and exit degrees of the flight.
In particular, constraints
Figure BDA0002277749190000154
Meaning that the sum of the outgoing of any flight in the subset of flights a relative to other flights equals the sum of the incoming of that flight relative to other flights, i.e., the incoming and outgoing of any flight in the subset of flights a is balanced.
In particular, constraints
Figure BDA0002277749190000155
The meaning of (1) is that the sum of the outgoing degree of any flight whose departure station and arrival station are not bases in the flight set A relative to other flights is 1, namely the flight can only be connected with one other flight backwards.
In particular, constraints
Figure BDA0002277749190000156
The meaning of (1) is that the sum of the incomes of the flights of which the departure station and the arrival station are not bases in the flight set A relative to other flights is 1, namely the flight is only connected with one other flight forwards.
In particular, constraints
Figure BDA0002277749190000161
The meaning of (1) is that the sum of the outbound of the flight whose departure station is the base in the flight set A relative to other flights is 1, i.e. the flight can only connect one other flight backwards.
In particular, constraints
Figure BDA0002277749190000162
The meaning of (1) is that the sum of the incomes of any flight with the arrival station as the base in the flight set A relative to other flights is 1, i.e. the flight can only be connected with one other flight forward.
In particular, constraints
Figure BDA0002277749190000163
The meaning of (1) is that the sum of the incomes of any flight with the arrival station as the base in the flight set A relative to other flights is 1, i.e. the flight can only be connected with one other flight forward.
In particular, constraints
Figure BDA0002277749190000164
Meaning that the sum of the outgoing of any flight relative to other flights in the flight mission ring k is equal to the sum of the incoming of that flight relative to other flights, i.e., the incoming and outgoing of any flight in the flight mission ring k are balanced.
In particular, constraints
Figure BDA0002277749190000165
The meaning of (1) is that the summation of the duration time of all flight connecting lines in the flight task ring k does not exceed the maximum accumulated time length of the flight task ring, and the maximum accumulated time length of the flight task ring is manually set and generally does not exceed 4 days.
In particular, constraints
Figure BDA0002277749190000166
The meaning of (1) is that the sum of the outgoing degree of any flight whose departure station and arrival station are not bases in the flight task ring k relative to other flights is 1, namely the flight can only be connected with one other flight backwards.
In particular toOf (2) constraint conditions
Figure BDA0002277749190000167
The meaning of (1) is that the sum of the incoming degree of the flight of which any departure station and arrival station in the flight task ring k are not bases relative to other flights is 1, namely the flight is only connected with one other flight forwards.
In particular, constraints
Figure BDA0002277749190000168
The meaning of (1) is that the sum of the outgoing degree of the flight with the base as any starting station in the flight task ring k relative to other flights is 1, namely the flight can only be connected with one other flight backwards.
In particular, constraints
Figure BDA0002277749190000171
The meaning of (1) is that the sum of the incomes of the flight with the base as any starting station in the flight task ring k relative to other flights is 0, namely the flight is not connected with other flights forwards.
In particular, constraints
Figure BDA0002277749190000172
The meaning of (1) is that the sum of the incomes of any flight with the arrival station as the base in the flight task ring k relative to other flights is 1, namely the flight is connected with only one other flight forwards.
In particular, constraints
Figure BDA0002277749190000173
The meaning of (1) is that the sum of the outgoing degree of any flight with the arrival station as the base in the flight task ring k relative to other flights is 0, namely the flight is not connected with other flights backwards.
The embodiment of the invention provides a flight task ring generation algorithm comprising two mixed integer linear programming models. The first mixed integer linear programming model only has two dimensions (namely flights at the front end and the rear end of a flight connecting line), so that the selection of the constraint condition is relatively simple, and the first flight task ring set of the optimal solution is conveniently and quickly calculated. However, because the objective function is set simply, the first flight task ring set inevitably includes longer flight task rings exceeding the maximum accumulated time of the flight task rings, and the invention also uses a second mixed integer linear programming model of three dimensions (namely, flights at the front end and the rear end of a flight connecting line and flight task rings to which the flights belong) to split the longer flight task rings, thereby further improving the overall calculation speed while ensuring the accuracy of the construction of the flight task rings.
In a possible embodiment, the mixed integer linear programming model comprises a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into a second mixed integer linear programming model to obtain a legal flight task ring set R;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000174
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000181
wherein A isikAnd AjkAll flights in the flight set A located in a flight task ring k;
Figure BDA0002277749190000182
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection; when flight AikConnecting back flight AjkWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000183
get 1, otherwise
Figure BDA0002277749190000184
Taking 0;
Figure BDA0002277749190000185
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmkThe flights in the flight subset B which are positioned in a flight task ring k; c is a flight subset of the flight set A with the starting station as the base, CnkThe flights in the flight subset C which are positioned in a flight task ring k; d is a subset of flights in the flight set A whose arrival station is the base, DlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
The embodiment of the invention provides a flight task ring generation algorithm comprising a mixed integer linear programming model. The second mixed integer linear programming model has three dimensions, namely flights at the front end and the rear end of a flight connecting line and flight task rings to which the flights belong, and by using the three dimensions, stricter constraint conditions can be constructed, so that the finally output optimal solution does not contain longer aviation task rings exceeding the maximum accumulated time of the flight task rings, and the accuracy of constructing the flight task rings is further improved.
In a possible embodiment, further comprising:
and 4, step 4: inputting the legal flight task ring set R into a mixed integer linear fraction planning model to obtain a final legal flight task ring set;
an objective function M of the mixed integer linear fraction programming model3The expression of (a) is:
Figure BDA0002277749190000191
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000192
wherein R isp、RqAnd RrAll flight task rings in the legal flight task ring set R;
Figure BDA0002277749190000193
for flight task ring RpWith flight task ring RqSetting an efficiency weight for splicing; when the ring R is matched with the flight taskpBackward and flight task ring RqWhen the splicing treatment is carried out,
Figure BDA0002277749190000194
get 1, otherwise
Figure BDA0002277749190000195
Take 0.
Specifically, in the embodiment of the present invention, it is considered that the generated legal flight task ring set R includes some too short airline task rings, for example, an airline task ring having a total accumulated time length of only one day or less, and the efficiency of the task ring in actual operation is very low, which will consume a large amount of operation cost, and the embodiment of the present invention picks up and splices the shorter airline task ring with other airline task rings.
In particular, the flight mission ring RpWith flight task ring RqThe splicing process of (2) generally comprises the steps of splitting two flight task rings, and reforming a new flight task ring according to the take-off and landing time and the take-off and landing place of the flight.
In particular, the method comprises the following steps of,
Figure BDA0002277749190000196
may be negative to negatively excite the effect of certain splicing behaviors.
In particular, constraints
Figure BDA0002277749190000197
The meaning of (1) is that one airline task ring can only participate in one splicing processing at most, and simultaneously, only two airline task rings can be targeted in the splicing processing process.
In particular, constraints
Figure BDA0002277749190000201
The meaning of (1) is that one airline task ring can only participate in splicing processing once at most forward.
In particular, constraints
Figure BDA0002277749190000202
The meaning of (1) is that one airline task ring can only participate in splicing processing at most once backwards.
The embodiment of the invention also comprises a post-processing step, wherein the shorter flight task rings in the flight task ring set R are spliced two by two to form a longer aviation task ring with higher efficiency and without exceeding the maximum accumulated time of the flight task rings, so that the accuracy and the rationality of the construction of the flight task rings are further improved.
In a possible embodiment, before step 3.3, the following steps are further included:
step 3.2.1: updating the constraint conditions of the first mixed integer linear programming model according to the flight task rings in the first legal flight task ring subset, and establishing a new first mixed integer linear programming model;
step 3.2.2: inputting the first legal flight task ring subset into the new first mixed integer linear programming model to obtain a new first flight task ring subset; dividing the new first flight task ring set into a new first legal flight task ring subset and a new first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring; and taking the first legal flight task ring subset as the first legal flight task ring subset, adding the flight task ring in the new first illegal flight task ring subset into the first illegal flight task ring subset, and updating the first illegal flight task ring subset.
Specifically, by analyzing whether the flight task rings in the first legal subset of flight task rings meet civil aviation management requirements, the defect of the constraint condition of the current first mixed integer linear programming model can be determined, for example, if the influence of a set flight on the overall efficiency is not considered, a new condition is added to the constraint condition again, so that the constraint condition of the first mixed integer linear programming model is updated, and a new first mixed integer linear programming model is established.
The embodiment of the invention adds an iterative process between two mixed integer linear programming models, updates the constraint condition of the first mixed integer linear programming model through the analysis of the first legal flight task ring subset, optimizes the first legal flight task ring subset by using the updated first mixed integer linear programming model, and replaces the originally generated first legal flight task ring subset and first illegal flight task ring subset according to the output optimal solution so as to improve the rationality and quality of the first legal flight task ring subset, increase the number of the first illegal flight task rings and finally improve the accuracy and rationality of the flight task ring construction.
In a possible embodiment, before step 3, removing the illegal flight connection from the set of flight connections;
the illegal flight connection comprises the condition that the accumulated time length of the illegal flight connection exceeds the maximum accumulated time length of a flight task ring and/or the interval time between flights at the front end and the rear end of the illegal flight connection is less than the minimum interval time of the flights.
According to the embodiment of the invention, before flight connection data is input into the mixed integer linear programming model, the flight connection data is screened and analyzed, some non-compliant flight connections are filtered, the calculation amount of the model is reduced, and the accuracy and the speed of flight task ring building are further improved.
In a possible embodiment, before step 3, the flight links used to generate the flight mission ring of the fixed itinerary are removed from the set of flight links.
The embodiment of the invention considers that some fixed lines exist in the current international flight task ring, and the flight lines of the lines are known and fixed in a certain time, so that the flight connecting lines of the flight task ring for establishing the fixed lines are removed before the flight connecting line data is input into the mixed integer linear programming model, the calculation amount of the model is reduced, and the accuracy and the speed of establishing the flight task ring are further improved.
Based on the same inventive concept as the method, the embodiment of the invention also provides a flight task ring generation device for scheduling the unit, which comprises the following steps:
the flight connecting line generating module is used for connecting the flights in the flight set A pairwise to generate a flight connecting line set;
the fixed route flight task ring generation module is used for generating a fixed route flight task ring according to the flight connection set;
the flight connecting line filtering module is used for removing illegal flight connecting lines and flight connecting lines of a flight task ring used for generating a fixed route from the flight connecting line set;
the flight task ring generating module is used for obtaining a legal flight task ring R by using a mixed integer linear programming model;
the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000231
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000232
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000233
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000234
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000241
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000242
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000243
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
Referring to fig. 2, fig. 2 is a schematic diagram of an embodiment of a computer apparatus according to the present invention, including a memory 110, a processor 120, and a computer program 111 stored in the memory 120 and running on the processor 120, where the processor 120 executes the computer program 111 to implement the following steps:
step 1: acquiring a flight set A generated by participating in a flight task ring;
step 2: connecting the flights in the flight set pairwise to generate a flight connection set;
and step 3: and taking the maximum efficiency values of all flight connecting lines in the flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, and inputting the flight connecting line set into the mixed integer linear programming model to obtain a legal flight task ring set R.
In a possible embodiment, the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
step 3.1: inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
step 3.2: dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
step 3.3: inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000251
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000261
wherein A isiAnd AjAre all said flightFlights in set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000262
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000263
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000264
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000271
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000272
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkFor flights located in the subset of flights CFlights in task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, the mixed integer linear programming model comprises a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into a second mixed integer linear programming model to obtain a legal flight task ring set R;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000273
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000274
wherein A isikAnd AjkAll flights in the flight set A located in a flight task ring k;
Figure BDA0002277749190000275
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection; when flight AikConnecting back flight AjkWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000281
get 1, otherwise
Figure BDA0002277749190000282
Taking 0;
Figure BDA0002277749190000283
for flight AikBeginning to flight AjkThe duration of the end; t is maximum flight mission ringAccumulating the time length; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmkThe flights in the flight subset B which are positioned in a flight task ring k; c is a flight subset of the flight set A with the starting station as the base, CnkThe flights in the flight subset C which are positioned in a flight task ring k; d is a subset of flights in the flight set A whose arrival station is the base, DlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, further comprising:
and 4, step 4: inputting the legal flight task ring set R into a mixed integer linear fraction planning model to obtain a final legal flight task ring set;
an objective function M of the mixed integer linear fraction programming model3The expression of (a) is:
Figure BDA0002277749190000284
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000285
wherein R isp、RqAnd RrAll flight task rings in the legal flight task ring set R;
Figure BDA0002277749190000286
for flight task ring RpWith flight task ring RqSetting an efficiency weight for splicing; when the ring R is matched with the flight taskpBackward and flight task ring RqWhen the splicing treatment is carried out,
Figure BDA0002277749190000287
get 1, otherwise
Figure BDA0002277749190000288
Take 0.
In a possible embodiment, before step 3.3, the following steps are further included:
step 3.2.1: updating the constraint conditions of the first mixed integer linear programming model according to the flight task rings in the first legal flight task ring subset, and establishing a new first mixed integer linear programming model;
step 3.2.2: inputting the first legal flight task ring subset into the new first mixed integer linear programming model to obtain a new first flight task ring subset; dividing the new first flight task ring set into a new first legal flight task ring subset and a new first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring; and taking the first legal flight task ring subset as the first legal flight task ring subset, adding the flight task ring in the new first illegal flight task ring subset into the first illegal flight task ring subset, and updating the first illegal flight task ring subset.
In a possible embodiment, before step 3, removing the illegal flight connection from the set of flight connections;
the illegal flight connection comprises the condition that the accumulated time length of the illegal flight connection exceeds the maximum accumulated time length of a flight task ring and/or the interval time between flights at the front end and the rear end of the illegal flight connection is less than the minimum interval time of the flights.
In a possible embodiment, before step 3, the flight links used to generate the flight mission ring of the fixed itinerary are removed from the set of flight links.
Referring to fig. 3, fig. 3 is a schematic diagram of an embodiment of a computer-readable storage medium according to the present invention, wherein a computer program 211 is stored on the computer-readable storage medium, and when the computer program 211 is executed by a processor, the following steps are implemented:
step 1: acquiring a flight set A generated by participating in a flight task ring;
step 2: connecting the flights in the flight set pairwise to generate a flight connection set;
and step 3: and taking the maximum efficiency values of all flight connecting lines in the flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, and inputting the flight connecting line set into the mixed integer linear programming model to obtain a legal flight task ring set R.
In a possible embodiment, the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
step 3.1: inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
step 3.2: dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
step 3.3: inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure BDA0002277749190000301
the constraints of the first mixed integer linear programming model include:
Figure BDA0002277749190000311
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000312
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000313
the constraints of the second mixed integer linear programming model include:
Figure BDA0002277749190000314
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure BDA0002277749190000321
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure BDA0002277749190000322
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, the mixed integer linear programming model comprises a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into a second mixed integer linear programming model to obtain a legal flight task ring set R;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure BDA0002277749190000323
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000324
wherein A isikAnd AjkAll flights in the flight set A located in a flight task ring k;
Figure BDA0002277749190000325
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection; when flight AikConnecting back flight AjkWhen the temperature of the water is higher than the set temperature,
Figure BDA0002277749190000331
get 1, otherwise
Figure BDA0002277749190000332
Taking 0;
Figure BDA0002277749190000333
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmkThe flights in the flight subset B which are positioned in a flight task ring k; c is a flight subset of the flight set A with the starting station as the base, CnkThe flights in the flight subset C which are positioned in a flight task ring k; d is a subset of flights in the flight set A whose arrival station is the base, DlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
In a possible embodiment, further comprising:
and 4, step 4: inputting the legal flight task ring set R into a mixed integer linear fraction planning model to obtain a final legal flight task ring set;
an objective function M of the mixed integer linear fraction programming model3The expression of (a) is:
Figure BDA0002277749190000334
the constraints of the mixed integer linear programming model include:
Figure BDA0002277749190000335
wherein R isp、RqAnd RrAll flight task rings in the legal flight task ring set R;
Figure BDA0002277749190000336
for flight task ring RpWith flight task ring RqSetting effect of performing splicing processingA rate value; when the ring R is matched with the flight taskpBackward and flight task ring RqWhen the splicing treatment is carried out,
Figure BDA0002277749190000337
get 1, otherwise
Figure BDA0002277749190000338
Take 0.
In a possible embodiment, before step 3.3, the following steps are further included:
step 3.2.1: updating the constraint conditions of the first mixed integer linear programming model according to the flight task rings in the first legal flight task ring subset, and establishing a new first mixed integer linear programming model;
step 3.2.2: inputting the first legal flight task ring subset into the new first mixed integer linear programming model to obtain a new first flight task ring subset; dividing the new first flight task ring set into a new first legal flight task ring subset and a new first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring; and taking the first legal flight task ring subset as the first legal flight task ring subset, adding the flight task ring in the new first illegal flight task ring subset into the first illegal flight task ring subset, and updating the first illegal flight task ring subset.
In a possible embodiment, before step 3, removing the illegal flight connection from the set of flight connections;
the illegal flight connection comprises the condition that the accumulated time length of the illegal flight connection exceeds the maximum accumulated time length of a flight task ring and/or the interval time between flights at the front end and the rear end of the illegal flight connection is less than the minimum interval time of the flights.
In a possible embodiment, before step 3, the flight links used to generate the flight mission ring of the fixed itinerary are removed from the set of flight links.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (modules, systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (8)

1. A flight task ring generation method for scheduling of a unit is characterized by comprising the following steps:
step 1: acquiring a flight set A generated by participating in a flight task ring;
step 2: connecting the flights in the flight set pairwise to generate a flight connection set;
and step 3: taking the maximum efficiency values of all flight connecting lines in a flight task ring as an objective function, constructing constraint conditions according to the outgoing degree and the incoming degree of the flight connecting lines, establishing a mixed integer linear programming model, and inputting the flight connecting line set into the mixed integer linear programming model to obtain a legal flight task ring set R;
when the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model, the method for obtaining the legal flight task ring set R comprises the following steps:
step 3.1: inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
step 3.2: dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
step 3.3: inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure FDA0002696548370000021
the constraints of the first mixed integer linear programming model include:
Figure FDA0002696548370000022
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure FDA0002696548370000023
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
a purpose of the second mixed integer linear programming modelScalar function M2The expression of (a) is:
Figure FDA0002696548370000024
the constraints of the second mixed integer linear programming model include:
Figure FDA0002696548370000031
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure FDA0002696548370000032
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure FDA0002696548370000033
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkThe flights in the flight subset B which are positioned in a flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in a flight task ring k;
when the mixed integer linear programming model comprises a second mixed integer linear programming model, the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into a second mixed integer linear programming model to obtain a legal flight task ring set R;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure FDA0002696548370000034
the constraints of the mixed integer linear programming model include:
Figure FDA0002696548370000041
wherein A isikAnd AjkAll flights in the flight set A located in a flight task ring k;
Figure FDA0002696548370000042
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection; when flight AikConnecting back flight AjkWhen the temperature of the water is higher than the set temperature,
Figure FDA0002696548370000043
get 1, otherwise
Figure FDA0002696548370000044
Taking 0;
Figure FDA0002696548370000045
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmkThe flights in the flight subset B which are positioned in a flight task ring k; c is a flight subset of the flight set A with the starting station as the base, CnkThe flights in the flight subset C which are positioned in a flight task ring k; d is a subset of flights in the flight set A whose arrival station is the base, DlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
2. The flight mission ring generation method according to claim 1, further comprising:
and 4, step 4: inputting the legal flight task ring set R into a mixed integer linear fraction planning model to obtain a final legal flight task ring set;
an objective function M of the mixed integer linear fraction programming model3The expression of (a) is:
Figure FDA0002696548370000046
the constraints of the mixed integer linear programming model include:
Figure FDA0002696548370000051
wherein R isp、RqAnd RrAll flight task rings in the legal flight task ring set R;
Figure FDA0002696548370000052
for flight task ring RpBackward and flight task ring RqSetting an efficiency weight for splicing; when the ring R is matched with the flight taskpWith flight task ring RqWhen the splicing treatment is carried out,
Figure FDA0002696548370000053
get 1, otherwise
Figure FDA0002696548370000054
Take 0.
3. A flight mission ring generation method according to claim 1, characterized by further comprising, before the step 3.3, the steps of:
step 3.2.1: updating the constraint conditions of the first mixed integer linear programming model according to the flight task rings in the first legal flight task ring subset, and establishing a new first mixed integer linear programming model;
step 3.2.2: inputting the first legal flight task ring subset into the new first mixed integer linear programming model to obtain a new first flight task ring subset; dividing the new first flight task ring set into a new first legal flight task ring subset and a new first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring; and taking the first legal flight task ring subset as the first legal flight task ring subset, adding the flight task ring in the new first illegal flight task ring subset into the first illegal flight task ring subset, and updating the first illegal flight task ring subset.
4. The flight mission loop generation method of claim 1, wherein prior to step 3, the illegal flight links are removed from the set of flight links;
the illegal flight connection comprises the condition that the accumulated time length of the illegal flight connection exceeds the maximum accumulated time length of a flight task ring and/or the interval time between flights at the front end and the rear end of the illegal flight connection is less than the minimum interval time of the flights.
5. The method according to claim 1, wherein, before the step 3, the flight link used for generating the flight task ring of the fixed route is removed from the flight link set.
6. A flight mission ring generation apparatus for scheduling a unit, comprising:
the flight connecting line generating module is used for connecting the flights in the flight set A pairwise to generate a flight connecting line set;
the fixed route flight task ring generation module is used for generating a fixed route flight task ring according to the flight connection set;
the flight connecting line filtering module is used for removing illegal flight connecting lines and flight connecting lines of a flight task ring used for generating a fixed route from the flight connecting line set;
the flight task ring generating module is used for obtaining a legal flight task ring set R by using a mixed integer linear programming model;
the mixed integer linear programming model comprises a first mixed integer linear programming model and a second mixed integer linear programming model;
the method for obtaining the legal flight task ring set R comprises the following steps:
inputting the flight connecting line set into the first mixed integer linear programming model to obtain a first flight task ring set;
dividing the first flight task ring set into a first legal flight task ring subset and a first illegal flight task ring subset according to the maximum accumulated duration of the flight task ring;
inputting the first illegal flight task ring subset into the second mixed integer linear programming model to obtain a second flight task ring set;
the legal flight task ring set R comprises flight task rings in the first legal flight task ring subset and the second legal flight task ring set;
the accumulated time of the flight task rings in the first legal flight task ring subset does not exceed the maximum accumulated time of the flight task rings;
the accumulated time of the flight task rings in the first illegal flight task ring subset exceeds the maximum accumulated time of the flight task rings;
an objective function M of the first mixed integer linear programming model1The expression of (a) is:
Figure FDA0002696548370000071
the constraints of the first mixed integer linear programming model include:
Figure FDA0002696548370000072
wherein A isiAnd AjAll flights in the flight set A; when flight AiConnecting back flight AjWhen the temperature of the water is higher than the set temperature,
Figure FDA0002696548370000073
get 1, otherwise XijTaking 0; omegaijFor flight AiWith flight AjSetting an efficiency weight value of a flight line formed by connection; b is a flight subset of the flight set A, wherein the departure station and the arrival station are not bases, and BmFor flights in the subset of flights B; c is a flight subset of the flight set A with the starting station as the base, CnFor flights in the subset of flights C; d is a subset of flights in the flight set A whose arrival station is the base, DlFor flights in the subset of flights D;
an objective function M of the second mixed integer linear programming model2The expression of (a) is:
Figure FDA0002696548370000074
the constraints of the second mixed integer linear programming model include:
Figure FDA0002696548370000081
wherein A isikAnd AjkAll flights in the flight subset A located in a flight task ring k;
Figure FDA0002696548370000082
for flight AikWith flight AjkSetting an efficiency weight value of a flight line formed by connection;
Figure FDA0002696548370000083
for flight AikBeginning to flight AjkThe duration of the end; t is the maximum accumulated time of the flight mission ring; b ismkFor the flightFlights in subset B that lie in flight task ring k; cnkThe flights in the flight subset C which are positioned in a flight task ring k; dlkThe flights in the flight subset D which are positioned in the flight task ring k are selected.
7. A computer device, comprising:
a memory for storing a computer program;
a processor for executing the computer program to carry out the steps of the method of any one of claims 1 to 5.
8. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, is adapted to carry out the steps of the method of any one of claims 1 to 5.
CN201911129011.9A 2019-11-18 2019-11-18 Flight task ring generation method and device for scheduling of unit Active CN111047144B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911129011.9A CN111047144B (en) 2019-11-18 2019-11-18 Flight task ring generation method and device for scheduling of unit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911129011.9A CN111047144B (en) 2019-11-18 2019-11-18 Flight task ring generation method and device for scheduling of unit

Publications (2)

Publication Number Publication Date
CN111047144A CN111047144A (en) 2020-04-21
CN111047144B true CN111047144B (en) 2020-12-22

Family

ID=70231955

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911129011.9A Active CN111047144B (en) 2019-11-18 2019-11-18 Flight task ring generation method and device for scheduling of unit

Country Status (1)

Country Link
CN (1) CN111047144B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112418620A (en) * 2020-11-11 2021-02-26 悠桦林信息科技(上海)有限公司 Automatic scheduling system for machine group members

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101477649A (en) * 2008-12-31 2009-07-08 中山大学 Air flight planning method based on particle swarm algorithm
CN102097014A (en) * 2011-02-14 2011-06-15 北京民航中天科技有限责任公司 Flight ground support service commanding and dispatching system
CN103198369A (en) * 2012-01-06 2013-07-10 上海杰之能信息科技有限公司 Method and device of automatic schedule information processing of bullet train daily maintenance schedule

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080215406A1 (en) * 2007-03-01 2008-09-04 Julian Pachon Scheduling Resources for Airline Flights
US20090288091A1 (en) * 2008-05-15 2009-11-19 Nikolaos Papadakos Method and System Integrating Task Assignment and Resources Scheduling
CN107578141B (en) * 2017-07-25 2022-02-08 南京航空航天大学 Airport runway allocation decision-making method based on fuzzy hierarchical analysis and evidence theory

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101477649A (en) * 2008-12-31 2009-07-08 中山大学 Air flight planning method based on particle swarm algorithm
CN102097014A (en) * 2011-02-14 2011-06-15 北京民航中天科技有限责任公司 Flight ground support service commanding and dispatching system
CN103198369A (en) * 2012-01-06 2013-07-10 上海杰之能信息科技有限公司 Method and device of automatic schedule information processing of bullet train daily maintenance schedule

Also Published As

Publication number Publication date
CN111047144A (en) 2020-04-21

Similar Documents

Publication Publication Date Title
Saddoune et al. Integrated airline crew pairing and crew assignment by dynamic constraint aggregation
Maher Solving the integrated airline recovery problem using column-and-row generation
Ruiz et al. Strategic de-confliction in the presence of a large number of 4D trajectories using a causal modeling approach
US6651046B1 (en) Optimizing apparatus, optimizing method, and storage medium
Jin et al. An effective hybrid honey bee mating optimization algorithm for integrated process planning and scheduling problems
Jin et al. A multi-objective memetic algorithm for integrated process planning and scheduling
CN111047144B (en) Flight task ring generation method and device for scheduling of unit
CN111784047B (en) Seasonal factor calculation method and related device
Kovalev et al. Conceptual basis for digitalization of specifications of transport and technological cycles of agricultural UAVs
Gabteni et al. Combining column generation and constraint programming to solve the tail assignment problem
CN110471287A (en) A kind of real-time scheduling method and system of more rail Shuttling trolleys
Massacci et al. Assessing a requirements evolution approach: Empirical studies in the air traffic management domain
Shah et al. Optimization of Sukhoi Su-30MKM maintenance planning for maximum operational readiness
Liu et al. A method for flight test subject allocation on multiple test aircrafts based on improved genetic algorithm
CN114547391A (en) Message auditing method and device
Ahuja et al. A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Scales et al. The managed readiness simulator: a force readiness model
Mokhtarpour et al. Application of a clustering technique in identifying the “best” System of Systems (SoS) during development
Medvedev et al. The development of a simulation model for assessing the ci/cd pipeline quality in the development of information systems based on a multi-agent approach
Novianingsih Flight re-timing models to improve the robustness of airline schedules
Dávid et al. A model and fast heuristics for the multiple depot bus rescheduling problem
Yfantis et al. Iterative medium-term production scheduling of an industrial formulation plant
Shafipour-Omrani et al. A Fuzzy Crew Rostering Model Based on Crew Preferences and Seniorities considering Training Courses: A Robust Optimization Approach
CN112380205B (en) Automatic feature generation method and system of distributed architecture
CN115081802B (en) Method and device for generating passenger task set, corresponding electronic equipment and storage medium

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20200819

Address after: 100102 202A-12, 2nd floor, Lize Zhongyuan 106 Building, Chaoyang District, Beijing

Applicant after: SHANSHU SCIENCE AND TECHNOLOGY (BEIJING) Co.,Ltd.

Applicant after: SHANGHAI SHANSHU NETWORK TECHNOLOGY Co.,Ltd.

Applicant after: Shenzhen Shanzhi Technology Co.,Ltd.

Address before: 100102 202A-12, 2nd floor, Lize Zhongyuan 106 Building, Chaoyang District, Beijing

Applicant before: SHANSHU SCIENCE AND TECHNOLOGY (BEIJING) Co.,Ltd.

Applicant before: SHANGHAI SHANSHU NETWORK TECHNOLOGY Co.,Ltd.

Applicant before: SHANSHU SCIENCE AND TECHNOLOGY (SUZHOU) Co.,Ltd.

Applicant before: Shenzhen Shanzhi Technology Co.,Ltd.

GR01 Patent grant
GR01 Patent grant