CN110322078A - The flight flow control methods and computer storage medium of sector borders - Google Patents

The flight flow control methods and computer storage medium of sector borders Download PDF

Info

Publication number
CN110322078A
CN110322078A CN201910622995.8A CN201910622995A CN110322078A CN 110322078 A CN110322078 A CN 110322078A CN 201910622995 A CN201910622995 A CN 201910622995A CN 110322078 A CN110322078 A CN 110322078A
Authority
CN
China
Prior art keywords
flight
sector
node
arena
corridor mouth
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
Application number
CN201910622995.8A
Other languages
Chinese (zh)
Other versions
CN110322078B (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.)
CETC 28 Research Institute
Original Assignee
CETC 28 Research Institute
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 CETC 28 Research Institute filed Critical CETC 28 Research Institute
Priority to CN201910622995.8A priority Critical patent/CN110322078B/en
Publication of CN110322078A publication Critical patent/CN110322078A/en
Application granted granted Critical
Publication of CN110322078B publication Critical patent/CN110322078B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G5/00—Traffic control systems for aircraft, e.g. air-traffic control [ATC]
    • G08G5/003—Flight plan management

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses the flight flow control methods and computer storage medium of a kind of sector borders, method includes: according to the estimated sequencing for reaching sector time of each flight and the sector corridor mouth passed through, corresponding series of flights is generated to each corridor mouth of sector, then the series of flights of each corridor mouth is optimized, under the premise of being no more than sector capacity value, control the flight amount that each corridor mouth enters sector within each period, generation makes flight be delayed the smallest optimal stream interface driver of cost, finally, according to optimal stream interface driver, the minimum interval of trailing of march into the arena flight total amount and flight of each corridor mouth within a period is controlled.The present invention can make flight delay cost minimum, to provide safe and efficient, scientific scheme of marching into the arena for flight, improve the sector capacity level of resources utilization when sector by bad weather, significant task or other emergency events is influenced that capacity is caused to decline.

Description

The flight flow control methods and computer storage medium of sector borders
Technical field
The present invention relates to a kind of flight flow control methods and computer storage mediums, more particularly to a kind of sector borders Flight flow control methods and computer storage medium.
Background technique
With the rapid growth of air-transport industry, the schedule flight stream of China limited airspace resources supplIes and rapid growth Contradiction between amount demand becomes increasingly conspicuous, particularly, when a certain airspace unit is influenced by bad weather, occasion, airspace Capacity dynamic change causes air traffic and capacity unbalance, brings Airspace congestion and flight tardy problem, AIRLINE & AIRPORT effect Rate and service mass surface face severe challenge.To make volume of traffic demand under adverse weather conditions and capacity reach balance, flowtube The traffic management schemes that minimum flight trails interval would generally be formulated in sector borders by managing unit, to the boat of marching into the arena of each corridor mouth Class measures and flight is marched into the arena, and interval is controlled, and the appearance mobile equilibrium of sector is reached with this.In currently practical engineer application, adopt mostly The flight amount of marching into the arena of each corridor mouth is determined with equal proportion strategy or based on the flight flow demand of each corridor mouth, such Method is fairly simple, is easily achieved, but flow control policy does not comprehensively consider the flight company tardiness cost of each corridor mouth With the multi-party advantage factors such as passenger's delay cost, therefore bring sector capacity distribution unjustness, increase flight delays Cost.
Summary of the invention
Goal of the invention: the technical problem to be solved in the present invention is to provide a kind of flight flow control methods of sector borders and Computer storage medium solves the biggish defect of flight delay cost in present flow rate control method, for sector by severe Situations such as weather, significant task or other emergency events influence cause capacity to decline, generation keeps flight delay cost the smallest most Excellent stream interface driver.
Technical solution: the flight flow control methods of sector borders of the present invention, comprising the following steps:
(1) according to the estimated sequencing for reaching sector time of flight of respectively marching into the arena and the sector corridor message passed through Breath, to each corridor mouth COR of sectoriCorresponding series of flights of marching into the arena is generated, the flight of respectively marching into the arena is more than time tbIt reaches The flight of sector, wherein tbTo influence the time that sector capacity value is begun to decline due to external factor, i=1...m, m are corridor The quantity of mouth；
(2) optimal stream interface driver is formulated, the optimal stream interface driver is that the flight amount into sector is less thanPremise Under, control each corridor mouth CORiIn TPtThe interior optimal flight amount into sectorAnd minimum trail between flight is spacedWherein, T tbThe when number of segment having an impact afterwards, TPtFor the length of each period,For corresponding sector of each period Capability value, t=1...T；
(3) the optimal stream interface driver according to step (2), to each corridor mouth CORiIn tbFlight total amount of marching into the arena afterwards And the minimum interval of trailing of flight is controlled.
Further, optimal stream interface driver is formulated in step (2) specifically:
(21) use dynamic programming algorithm by total sector capacity valueIt is assigned to each corridor mouth of sector, is determined Each corridor mouth CORiIn the flight amount of always marching into the arena within T period
(22) use 0-1 combinational algorithm by flight amount of always marching into the arenaIt is assigned to T period, forms allocation plan Candidate Set Close CSi, CSiIn each candidate allocation scheme soli,g∈CSiIndicate each corridor mouth CORiIn each period TPtIt is interior to enter fan The flight amount in area, g=1... | CSi|；
(23) from allocation plan candidate collection CSiMiddle selection optimal distributing scheme solI, g∈CSi, total flight is made to be delayed generation Valence is minimum, determines each corridor mouth COR with thisiIn period TPtThe interior optimal flight amount into sector
Further, by flight amount of always marching into the arena in step (22)It is assigned to the specific steps of T period are as follows:
(221) fromT-1 gap is chosen in a gap is inserted into baffle, it willA 1 is divided into T different sets, 1 number is corresponding flight amount of marching into the arena in each set；
(222) willThe sequence of a 1 composition is denoted as seq；
(223) establishing length isArray index [], subscript is expressed as 0 and arrivesArray element index The value of [a] is that 1 expression places a baffle behind a-th 1 of sequence seq, and particularly, index [0]=1 is indicated in sequence seq The 1st number be 1 position before place a baffle；When the value of array element index [a] is 0, then do not place；
(224) the preceding T-1 element of array is set to 1, remaining element is set to 0, generates a kind of candidate allocation scheme entrance CSi；
(225) " 1-0 " combination for from left to right scanning array element value, is changed into after finding first " 1-0 " combination " 0-1 " combination, generates a kind of candidate allocation scheme and enters CSi；
(226) left side of first " 1-0 " combination owned into the left end that " 1 " is all moved to array；
(227) step (225) and step (226) are repeated, until " 1-0 " combination can not be found, obtains CSi。
Further, step (23) specifically:
(231) scheme search tree T is establisheds, tree root υsFor a dummy node, node υI, g∈V(Ts) indicate a kind of candidate point With scheme solI, g, i=1...m, g=1... | CSi|, scheme search tree TsSide include two classes: tree root υsTo corridor mouth COR1 Candidate allocation scheme node, i.e. (υs, υ1, g)∈E(Ts) and the candidate scheme of two adjacent different corridor mouths between, i.e., (υI, g, υI+1, g)∈E(Ts)；
(232) present node υ is definedcur, and initialize υcur=υs, i.e., by root vertex υsStart time as start node It goes through；
(233) along present node υcurSide continue searching next node υnxt, judge node υnxtWhether satisfaction constrains item Part 1 and 2, constraint condition 1 are node υnxtIt must be the node having not visited, constraint condition 2 is node υnxtCorresponding distribution Scheme must satisfy the capacity limit of sector, i.e.,
(234) if meeting constraint condition 1 and 2, more new variables υcurValue, i.e. υcur=υnxt, then proceed to execute step Suddenly (233) until leaf node, and calculate the flight corresponding to this path from root vertex to leaf node and are delayed cost, Save the path with minimum flight delay cost；
(235) if being unsatisfactory for constraint condition 1 or 2, a node, i.e. node υ are retracted in backtrackingcur, section is then traversed again Point υcurOther adjacent nodes, continue searching.
Computer storage medium of the present invention, is stored thereon with computer program, and the computer program is being counted Calculation machine processor realizes the flight flow control methods of the sector borders when executing.
The utility model has the advantages that the present invention is walked according to the estimated sequencing for reaching sector time of each flight and the sector passed through Lang Kou generates corresponding series of flights to each corridor mouth of sector, then optimizes to the series of flights of each corridor mouth, Under the premise of being no more than sector capacity value, the flight amount that each corridor mouth enters sector within each period is controlled, generation makes Flight is delayed the smallest optimal stream interface driver of cost, to provide safe and efficient, scientific scheme of marching into the arena for flight, improves fan Area's capacity resource utilization efficiency.
Detailed description of the invention
Fig. 1 is the method flow diagram of embodiment of the present invention；
Fig. 2 is the 0-1 combinational algorithm schematic diagram of embodiment of the present invention；
Fig. 3 is the search tree schematic diagram of embodiment of the present invention.
Specific embodiment
The method flow of embodiment of the present invention is as shown in Figure 1, comprising the following steps:
The acquisition of step 1, information, the capability value K including sector under normal operationn, corridor mouth quantity m, each walk Corridor mouth CORiCapability value under normal operationAnd bad weather starts to influence the time t of sectorb, influence When number of segment T and T period corresponding to sector capacity value
Step 2, according to respectively marching into the arena, flight expects the sector corridor mouth for reaching the sequencing of sector time and being passed through Information generates corresponding series of flights of marching into the arena to each corridor mouth of sector, and the flight of respectively marching into the arena is more than time tbIt reaches The flight of sector；
Step 3 carries out overall control to the flight of marching into the arena of each corridor mouth in the sector, obtains optimal stream interface driver, institute Stating optimal stream interface driver is to be no more than sector capacity valueUnder the premise of, control each corridor mouth CORi, i= 1...m in each period TP by adverse weather conditionst, the interior optimal flight amount for entering sector of t=1...TAnd flight Between minimum trail intervalSo that flight is delayed the smallest stream interface driver of cost；
The optimal specific generation step of stream interface driver are as follows:
Step 3.1, using the dynamic programming algorithm sector capacity value that T period is totalIt is assigned to m of sector Corridor mouth determines each corridor mouth CORi, always march into the arena flight amount of the i=1...m within T periodSpecific implementation uses Method described in application for a patent for invention application No. is 201910210567.4.
Step 3.2 is directed to each corridor mouth COR in sectori, i=1...m, using 0-1 combinational algorithm by flight amount of always marching into the arenaIt is assigned to T period, corresponding allocation plan candidate collection is denoted as CSi, i=1...m, each of them candidate allocation Scheme solI, g∈CSi, g=1... | CSi| indicate corridor mouth CORiIn each period TPt, the interior boat for entering sector of t=1...T Class's amount.
In the step 3.2, to each corridor mouth CORi, i=1...m, using 0-1 combinational algorithm by flight of always marching into the arena AmountIt is assigned to T period, the candidate collection of allocation plan is denoted as CSi, i=1...m, specific implementation are as follows:
Step 3.21, will march into the arena flight amountBe assigned to this problem of T period be abstracted as byA 1 is divided into T Different sets；Due toHave between a 1 numberA gap, so this problem can be regarded as fromA sky T-1 gap is chosen in gap is inserted into baffle, it willA 1 is divided into T different sets, and 1 number is in each set at this time Corresponding flight amount of marching into the arena.
Step 3.22 is incited somebody to actionThe sequence of a 1 composition is denoted as seq；
Step 3.23 establishes a length and isArray index [], subscript is expressed as 0 and arrivesArray member The value of plain index [a] is that 1 expression places a baffle behind a-th 1 of sequence seq, and particularly, index [0]=1 indicates to exist A baffle is placed before the position that the 1st number of sequence seq is 1；When the value of array element index [a] is 0, then do not place；
Step 3.24, initialization, are set to 1 for the preceding T-1 element of array, remaining element is set to 0；At this time by sequence Baffle is placed in seq, generates a kind of candidate allocation scheme solI, g, corresponding flight delay cost is CostI, g；
Step 3.25, from left to right scan array element value " 1-0 " combination, find first " 1-0 " combination after by its Become " 0-1 " combination；At this time by placing baffle in sequence seq, a kind of candidate allocation scheme sol is generatedI, g；
The left side of first " 1-0 " combination is owned the left end that " 1 " is all moved to array by step 3.26；
Step 3.27 repeats step 3.22-3.24, until that can not find " 1-0 " combination.Finally, corridor mouth is obtained CORiAllocation plan candidate collection remember CSi, i=1...m.
Step 3.3, using backtracking method, from each corridor mouth CORiCandidate allocation scheme set CSi, select in i=1...m Select optimal distributing scheme solI, g∈CSi, so that total flight is delayed cost minimum, corridor mouth COR determined with thisiIn period TPt, t Enter the optimal flight amount of sector in=1...T
In the step 3.3, using backtracking method, from each corridor mouth CORiAllocation plan candidate collection CSi, i= 1...m optimal distributing scheme is selected in, so that total flight is delayed cost minimum, corridor mouth COR is determined with thisiIn period TPt, t= 1...T enter the optimal flight amount of sector inInclude:
Step 3.31 establishes scheme search tree Ts, tree root υsFor a dummy node, node υI, g∈V(Ts) indicate a kind of time Select allocation plan solI, g, i=1...m, g=1... | CSi|；Scheme search tree TsSide include two classes: tree root υsTo corridor mouth COR1Candidate allocation scheme node, i.e. (υs, υ1, g)∈E(Ts) and the candidate scheme of two adjacent different corridor mouths between, i.e., (υI, g, υI+1, g)∈E(Ts)；
Step 3.32 defines present node υcur, and initialize υcur=υs, i.e., by root vertex υsIt is opened as start node Begin traversal；
Step 3.33, along present node υcurSide continue searching next node υnxt, judge node υnxtWhether meet about Beam condition 1 and 2:
Constraint condition 1: node υnxtIt must be the node having not visited；
Constraint condition 2: node υnxtCorresponding allocation plan must satisfy the capacity limit of sector, i.e.,
If step 3.34 meets constraint condition 1 and 2, more new variables υcurValue, i.e. υcur=υnxt, then proceed to hold Row step 3.33 until leaf node, and records the flight corresponding to this path from root vertex to leaf node and is delayed generation Valence saves the path with minimum flight delay cost；
If step 3.35 is unsatisfactory for constraint condition 1 or 2, a node, i.e. node υ are retracted in backtrackingcur, then again time Joint-running point υcurOther adjacent nodes, continue searching.
Step 4, according to the optimal stream interface driver, to each corridor mouth of sector within by the adverse weather conditions period The minimum interval of trailing of march into the arena flight total amount and flight controlled.
According to the method described above, it is realized and is verified using the sector of Beijing 06 as prototype construction flight stream operation data.Table 1 For each corridor mouth COR in No. 06 sectoriCapacity information under normal circumstancesAnd the flight of following six periods is marched into the arena stream Measure dataSuch as corridor mouth COR1The capacity of (southwestern approach course) under normal circumstances is 16 framves/hour, and is predicted thereafter The flight flow of marching into the arena of 6 hours is(20:00-21:00): 16 sorties；(21:00-22:00): 17 sorties；(22: 00-23:00): 10 sorties；(23:00-00:00): 19 sorties；(00:00-01:00): 5 sorties；(01:00-02: 00): 5 sorties.
1 corridor mouth of table capability value under normal circumstances and the flight of following six periods are marched into the arena flow information table
Now due to boisterous influence, it is contemplated that the capacity of No. 06 sector in Beijing following 2 hours (20:00-22:00) fromDrop toWith
The wherein specific embodiment of step 3.1 of the present invention:
Sector sector capacity value total within the period influenced by factors such as bad weathers is calculated first, i.e., Then 63 frame flights are assigned to using dynamic programming algorithm 4 corridor mouths of No. 06 sector, determined each Corridor mouth CORi, always march into the arena flight amount of the i=1...4 within 2 periods
Assuming that corridor mouth COR4Flight amount of always marching into the arena within 2 periodsWhen, then the specific reality of step 3.2 of the present invention Mode is applied, as shown in Figure 2:
Step 3.21, will march into the arena flight amountIt is assigned to this problem of T period and is abstracted as and be divided into 2 not for 31 With set；Due to there are 4 gaps between 31 numbers as, and then this problem can be regarded to 1 gap of selection from 4 gaps It is inserted into baffle, is divided into 2 different sets for 31,1 number is corresponding flight amount of marching into the arena in each set at this time.
Step 3.22 is incited somebody to actionThe sequence of a 1 composition is denoted as seq；
Step 3.23 establishes the array index [] that a length is 4, and subscript is expressed as 0 to 3, array element index The value of [a] is that 1 expression places a baffle behind a-th 1 of sequence seq, and particularly, index [0]=1 is indicated in sequence A baffle is placed before the 1st 1 of seq；When the value of array element index [a] is 0, then do not place；
Step 3.24, initialization, are set to 1 for the preceding T-1 element of array, remaining element is set to 0；At this time by sequence Baffle is placed in seq, generates a kind of candidate allocation scheme solI, g, corresponding flight delay cost is CostI, g；
Step 3.25, from left to right scan array element value " 1-0 " combination, find first " 1-0 " combination after by its Become " 0-1 " combination；At this time by placing baffle in sequence seq, a kind of candidate allocation scheme sol is generatedI, g；
The left side of first " 1-0 " combination is owned the left end that " 1 " is all moved to array by step 3.26；
Step 3.27 repeats step 3.22-3.24, until that can not find " 1-0 " combination.Finally, corridor mouth is obtained COR4Allocation plan candidate collection CS4={ sol4,1, sol4,2, sol4,3, sol4,4}
The wherein specific embodiment of step 3.3 of the present invention, as shown in Figure 3:
Step 3.31 establishes scheme search tree Ts, tree root υsFor a dummy node, node υI, g∈V(Ts) indicate a kind of time Select allocation plan solI, g, i=1...m, g=1... | CSi|；Scheme search tree TsSide include two classes: tree root υsTo corridor mouth COR1Candidate allocation scheme node, i.e. (υs, υ1, g)∈E(Ts) and the candidate scheme of two adjacent different corridor mouths between, i.e., (υI, g, υI+1, g)∈E(Ts)；
Step 3.32 defines present node υcur, and initialize υcur=υs, i.e., by root vertex υsIt is opened as start node Begin traversal；
Step 3.33, along present node υcurSide continue searching next node υnxt, judge node υnxtWhether meet about Beam condition 1 and 2:
Constraint condition 1: node υnxtIt must be the node having not visited；
Constraint condition 2: node υnxtCorresponding allocation plan must satisfy the capacity limit of sector, i.e.,
If step 3.34 meets constraint condition 1 and 2, more new variables υcurValue, i.e. υcur=υnxt, then proceed to hold Row step 3.33 until leaf node, and records the flight corresponding to this path from root vertex to leaf node and is delayed generation Valence saves the path with minimum flight delay cost；
If step 3.35 is unsatisfactory for constraint condition, a node, i.e. node υ are retracted in backtrackingcur, section is then traversed again Point υcurOther adjacent nodes, continue searching.
It is influenced by weather, it is contemplated that the capacity of No. 06 sector in Beijing following 2 hours (20:00-22:00) is from Kn=48 framves/small When drop toWithThe sector borders flight stream that present embodiment generates is trailed Headway management strategy is as shown in table 2, so that the total delay cost of flight is minimum.No. 06 sector is in 20:00- as can be seen from Table 2 The flight amount of marching into the arena of each corridor mouth drops to 10 framves/hour, 8 framves/hour, 9 framves/hour, 3 framves/small respectively during 21:00 When；During 21:00-22:00 the flight amount of marching into the arena of each corridor mouth drop to respectively 11 framves/hour, 9 framves/hour, 10 framves/ Hour, 3 framves/hour.Meanwhile the present invention is adopted using the strategy of " overall control+minimum trails interval " wherein minimum trails interval With the 50% of " equivalent trail interval ", such as march into the arena flight amount of the corridor mouth 1 in the 20:00-21:00 period is 10 framves/hour, 6 minutes framves are divided between corresponding equivalent trailing, then the flow management strategy of marching into the arena of this period is that " total amount is 10 framves/hour, most 3 minutes framves are divided between small trailing ".Therefore, it is as shown in table 2 that the flight stream ultimately generated trails headway management strategy:
Table 2 is marched into the arena flow management strategy table
The effect of optimization of method to illustrate the invention, the flow control methods that the present invention is mentioned are two different with other Flow control methods are compared, first is that the equal proportion method based on control habit, i.e., the ratio declined according to sector capacity Determine the flight amount of marching into the arena of each corridor mouth；Second is that need-based method, i.e. the flight flow demand accounting based on corridor mouth The total flow demand of sector determines the flight amount of marching into the arena of each corridor mouth with this.Table 3 gives three kinds of stream interface driver generation sides The comparing result of method, from table 3 it is observed that the capacity of (20:00-22:00) is from K when No. 06 sector future 2 is smalln=48 Frame/hour drops toWithIt is compared to the equal proportion side based on control habit Method, flight delay cost of the invention reduce 9.1%；It is compared to need-based method, flight of the invention is delayed generation Valence reduces 5.2%, experiment show effectiveness of the invention.
The contrast table of 3 three kinds of flow control methods of table
If the embodiment of the present invention is realized and when sold or used as an independent product in the form of software function module, Also it can store in a computer readable storage medium.Based on this understanding, the technical solution of the embodiment of the present invention Substantially the part that contributes to existing technology can be embodied in the form of software products in other words, the computer software Product is stored in a storage medium, including some instructions are used so that computer equipment (can be personal computer, Server or the network equipment etc.) execute all or part of each embodiment the method for the present invention.And storage above-mentioned is situated between Matter, which includes: that USB flash disk, mobile hard disk, read-only memory (ROM, Read Only Memory), magnetic or disk etc. are various, to deposit Store up the medium of program code.It is combined in this way, present example is not limited to any specific hardware and software.
Correspondingly, embodiments of the present invention additionally provide a kind of computer storage medium, it is stored thereon with computer journey Sequence.When the computer program is executed by processor, the flight flow control methods of aforementioned sector borders may be implemented.Example Such as, which is computer readable storage medium.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more, The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces The form of product.
The application is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates, Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one The step of function of being specified in a box or multiple boxes.

Claims (5)

1. a kind of flight flow control methods of sector borders, which comprises the following steps:
(1) right according to the estimated sequencing for reaching sector time of flight of respectively marching into the arena and the sector corridor mouth information passed through Each corridor mouth COR of sectoriCorresponding series of flights of marching into the arena is generated, the flight of respectively marching into the arena is more than time tbReach sector Flight, wherein tbTo influence the time that sector capacity value is begun to decline due to external factor, i=1...m, m are corridor mouth Quantity；
(2) optimal stream interface driver is formulated, the optimal stream interface driver is that the flight amount into sector is less thanUnder the premise of, control Make each corridor mouth CORiIn TPtThe interior optimal flight amount into sectorAnd minimum trail between flight is spacedIts In, T tbThe when number of segment having an impact afterwards, TPtFor the length of each period,For corresponding sector capacity value of each period, t =1...T；
(3) the optimal stream interface driver according to step (2), to each corridor mouth CORiIn tbAfterwards march into the arena flight total amount and The minimum interval of trailing of flight is controlled.
2. the flight flow control methods of sector borders according to claim 1, which is characterized in that formulated in step (2) Optimal stream interface driver specifically:
(21) use dynamic programming algorithm by total sector capacity valueIt is assigned to each corridor mouth of sector, is determined each Corridor mouth CORiIn the flight amount of always marching into the arena being in a period
(22) use 0-1 combinational algorithm by flight amount of always marching into the arenaIt is assigned to T period, forms allocation plan candidate collection CSi, CSiIn each candidate allocation scheme solI, g∈CSiIndicate each corridor mouth CORiIn each period TPtThe interior boat into sector Class's amount, g=1... | CSi|；
(23) from allocation plan candidate collection CSiMiddle selection optimal distributing scheme solI, g∈CSi, total flight is made to be delayed cost most It is small, each corridor mouth COR is determined with thisiIn period TPtThe interior optimal flight amount into sector
3. the flight flow control methods of sector borders according to claim 2, which is characterized in that will be total in step (22) It marches into the arena flight amountIt is assigned to the specific steps of T period are as follows:
(221) fromT-1 gap is chosen in a gap is inserted into baffle, it willA 1 is divided into T different sets, each 1 number is corresponding flight amount of marching into the arena in set；
(222) willThe sequence of a 1 composition is denoted as seq；
(223) establishing length isArray index [], subscript is expressed as 0 and arrivesArray element index's [a] Value is that 1 expression places a baffle behind a-th 1 of sequence seq, and particularly, index [0]=1 is indicated the 1st of sequence seq A number is one baffle of placement before 1 position；When the value of array element index [a] is 0, then do not place；
(224) the preceding T-1 element of array is set to 1, remaining element is set to 0, generates a kind of candidate allocation scheme and enters CSi；
(225) " 1-0 " combination for from left to right scanning array element value, is changed into " 0-1 " after finding first " 1-0 " combination Combination generates a kind of candidate allocation scheme and enters CSi；
(226) left side of first " 1-0 " combination owned into the left end that " 1 " is all moved to array；
(227) step (225) and step (226) are repeated, until " 1-0 " combination can not be found, obtains CSi。
4. the flight flow control methods of sector borders according to claim 2, which is characterized in that step (23) is specific Are as follows:
(231) scheme search tree T is establisheds, tree root vsFor a dummy node, node vI, g∈V(Ts) indicate a kind of candidate allocation side Case solI, g, i=1...m, g=1... | CSi|, scheme search tree TsSide include two classes: tree root vsTo corridor mouth COR1Time Select allocation plan node, i.e. (vs, v1, g)∈E(Ts) and the candidate scheme of two adjacent different corridor mouths between, i.e. (vI, g, cI+1, g)∈E(Ts)；
(232) present node v is definedcur, and initialize vcur=vs, i.e., by root vertex vsIt is begun stepping through as start node；
(233) along present node vcurSide continue searching next node vnxt, judge node vnxtWhether constraint condition 1 is met With 2, constraint condition 1 is node vnxtIt must be the node having not visited, constraint condition 2 is node vnxtCorresponding allocation plan It must satisfy the capacity limit of sector, i.e.,
(234) if meeting constraint condition 1 and 2, more new variables vcurValue, i.e. vcur=vnxt, then proceed to execute step (233), it until leaf node, and calculates the flight corresponding to this path from root vertex to leaf node and is delayed cost, protect Deposit the path with minimum flight delay cost；
(235) if being unsatisfactory for constraint condition 1 or 2, a node, i.e. node v are retracted in backtrackingcur, then traverse node again vcurOther adjacent nodes, continue searching.
5. a kind of computer storage medium, is stored thereon with computer program, it is characterised in that: the computer program is being counted Claims 1-4 described in any item methods are realized when calculation machine processor executes.
CN201910622995.8A 2019-07-11 2019-07-11 Sector boundary flight flow control method and computer storage medium Active CN110322078B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910622995.8A CN110322078B (en) 2019-07-11 2019-07-11 Sector boundary flight flow control method and computer storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910622995.8A CN110322078B (en) 2019-07-11 2019-07-11 Sector boundary flight flow control method and computer storage medium

Publications (2)

Publication Number Publication Date
CN110322078A true CN110322078A (en) 2019-10-11
CN110322078B CN110322078B (en) 2022-03-25

Family

ID=68121895

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910622995.8A Active CN110322078B (en) 2019-07-11 2019-07-11 Sector boundary flight flow control method and computer storage medium

Country Status (1)

Country Link
CN (1) CN110322078B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111613097A (en) * 2020-06-04 2020-09-01 成都民航空管科技发展有限公司 Method and system for avoiding label of air traffic control automation system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110251781A1 (en) * 2010-04-09 2011-10-13 Metron Aviation Inc. Method and system for flight substitution and reroute
US20160232792A1 (en) * 2015-02-06 2016-08-11 Izak Jan van Cruyningen UAV Inspection Flight Segment Planning
US9678507B1 (en) * 2015-06-25 2017-06-13 Latitude Engineering, LLC Autonomous infrastructure element survey systems and methods using UAV fleet deployment
CN107248324A (en) * 2017-08-12 2017-10-13 温州云航信息科技有限公司 The flight Support Resource dispatching management information system and method for linkage coordinated decision system
KR20180085536A (en) * 2017-01-19 2018-07-27 한국항공우주산업 주식회사 Standard flight data method for aircraft management
CN108846596A (en) * 2018-08-29 2018-11-20 南京航空航天大学 Interval approach control policy calculation method is trailed in termination environment at times
CN109949617A (en) * 2019-03-20 2019-06-28 中国电子科技集团公司第二十八研究所 A kind of flight based on Dynamic Programming is marched into the arena flow management strategy generation method
CN109979245A (en) * 2017-12-28 2019-07-05 北京航空航天大学 Flight flow control method and apparatus

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110251781A1 (en) * 2010-04-09 2011-10-13 Metron Aviation Inc. Method and system for flight substitution and reroute
US20160232792A1 (en) * 2015-02-06 2016-08-11 Izak Jan van Cruyningen UAV Inspection Flight Segment Planning
US9678507B1 (en) * 2015-06-25 2017-06-13 Latitude Engineering, LLC Autonomous infrastructure element survey systems and methods using UAV fleet deployment
KR20180085536A (en) * 2017-01-19 2018-07-27 한국항공우주산업 주식회사 Standard flight data method for aircraft management
CN107248324A (en) * 2017-08-12 2017-10-13 温州云航信息科技有限公司 The flight Support Resource dispatching management information system and method for linkage coordinated decision system
CN109979245A (en) * 2017-12-28 2019-07-05 北京航空航天大学 Flight flow control method and apparatus
CN108846596A (en) * 2018-08-29 2018-11-20 南京航空航天大学 Interval approach control policy calculation method is trailed in termination environment at times
CN109949617A (en) * 2019-03-20 2019-06-28 中国电子科技集团公司第二十八研究所 A kind of flight based on Dynamic Programming is marched into the arena flow management strategy generation method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
A.HUNTER ETAL.: "Robust And Practical Traffic Flow Management Optimization Algorithm For Near-Term Implementation", 《14TH AIAA AVIATION TECHNOLOGY, INTEGRATION, AND OPERATIONS CONFERENCE》 *
孙樊荣 等: "基于扇区负荷约束的管制移交间隔多目标优化模型", 《南京航空航天大学学报》 *
黄吉波: "基于延误分配的多机场终端区航班排序模型", 《指挥信息系统与技术》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111613097A (en) * 2020-06-04 2020-09-01 成都民航空管科技发展有限公司 Method and system for avoiding label of air traffic control automation system
CN111613097B (en) * 2020-06-04 2021-08-27 成都民航空管科技发展有限公司 Method and system for avoiding label of air traffic control automation system

Also Published As

Publication number Publication date
CN110322078B (en) 2022-03-25

Similar Documents

Publication Publication Date Title
Hu et al. Receding horizon control for aircraft arrival sequencing and scheduling
Cruciol et al. Reward functions for learning to control in air traffic flow management
Van der Hurk et al. Passenger advice and rolling stock rescheduling under uncertainty for disruption management
Murali et al. Modeling strategies for effectively routing freight trains through complex networks
Coles et al. Cost-sensitive concurrent planning under duration uncertainty for service-level agreements
CN111191843B (en) Airport delay prediction method based on time sequence network propagation dynamics equation
CN104580447A (en) Spatio-temporal data service scheduling method based on access heat
CN110119399B (en) Business process optimization method based on machine learning
CN107622699A (en) All the period of time spatial domain conflict probe and solution desorption method based on sequential
JP2015201006A (en) Dynamic fleet routing
Dotoli et al. A Decision Support System for real-time rescheduling of railways
CN109949617A (en) A kind of flight based on Dynamic Programming is marched into the arena flow management strategy generation method
Shakibayifar et al. A multi-objective decision support system for real-time train rescheduling
CN107483355B (en) Data center-oriented online scene low-bandwidth overhead traffic scheduling scheme
Liu et al. RFID: Towards low latency and reliable DAG task scheduling over dynamic vehicular clouds
CN116307542A (en) Port entering sequencing method based on multi-metering point constraint and electronic terminal
CN110322078A (en) The flight flow control methods and computer storage medium of sector borders
Li et al. Efficient adaptive matching for real-time city express delivery
Schettini et al. Demand-driven timetabling for a metro corridor using a short-turning acceleration strategy
Liu et al. GA-DRL: Graph Neural Network-Augmented Deep Reinforcement Learning for DAG Task Scheduling over Dynamic Vehicular Clouds
CN106533979A (en) Network updating method and device
Haehn et al. Probabilistic simulation of a railway timetable
JP2015141550A (en) Construction schedule creation system and construction schedule creation method
Ingolotti et al. New heuristics to solve the “CSOP” railway timetabling problem
CN110069708A (en) A kind of promotion effect predictor method, device, medium and equipment promoted across 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
CB02 Change of applicant information

Address after: 210046 No.1, Lingshan South Road, Qixia District, Nanjing City, Jiangsu Province

Applicant after: THE 28TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY Group Corp.

Address before: 210002 No.1, alfalfa Garden East Street, Qinhuai District, Nanjing City, Jiangsu Province

Applicant before: THE 28TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY Group Corp.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant