Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem Air_Traffic_Flow_Management — Constraint detection

The airspace is divided into a set of $ m $ sectors $ S$ . These sectors are traversed by $ n $ flights $ F$ for a given day of traffic . Each flight $ f_i $ has an expected take-off time and a travel plan which is a sequence of sectors $ s_i $ . The travel plan specifies when the flight $ f_i $ is expected to enter the sector $ s _ -LCB- ij -RSB- $ in terms of the expected time-over $ eto _ -LCB- i , j -RCB- $ . This travel plan is strict and does not allow delays or speed-ups when the flight plan is airborne . Certain sectors are subject to regulations that limit the number of flights that can enter these sectors during each hour within a given time period . This time period is divided into successive intervals of one hour length and thus several capacity constraints are obtained for each regulated sector . The k-th capacity constraint for sector $ s_j $ is specified by a capacity $ c _ -LCB- jk -RCB- $ and a time period $ -LSB- s _ -LCB- jk -RCB- , e _ -LCB- jk -RCB- -RRB- $ . The constraint is satisfied if the number of flights entering the sector $ s_j $ during the interval -LSB- sj , k , ej , k -RRB- is smaller than or equal to $ c _ -LCB- j , k -RCB- $ . The set $ F_j $ denotes the set of flights that enter the sector $ s_j $ : $ \ | \ -LCB- i \ in F_j | s _ -LCB- jk -RCB- \ le d_i + eto _ -LCB- ij -RCB- \ le e _ -LCB- jk -RCB- \ | \ le c _ -LCB- jk -RCB- $ . A slot allocation policy assigns a non-negative delay di to each flight $ f_i $ such that all capacity constraints are satisfied . Negative delays due to departures ahead of schedule are not allowed . The total delay of a slot allocation policy is the sum of the $ d_i $ 's for all flights $ f_i $ . Policies with smaller total delay are preferred .

Problem Air_Traffic_Flow_Management — Detection of the decisions and objects to be modeled

The airspace is divided into a set of $ m $ sectors $ S$ . These sectors are traversed by $ n $ flights $ F$ for a given day of traffic . Each flight $ f_i $ has an expected take-off time and a travel plan which is a sequence of sectors $ s_i $ . The travel plan specifies when the flight $ f_i $ is expected to enter the sector $ s _ -LCB- ij -RSB- $ in terms of the expected time-over $ eto _ -LCB- i , j -RCB- $ . This travel plan is strict and does not allow delays or speed-ups when the flight plan is airborne . Certain sectors are subject to regulations that limit the number of flights that can enter these sectors during each hour within a given time period . This time period is divided into successive intervals of one hour length and thus several capacity constraints are obtained for each regulated sector . The k-th capacity constraint for sector $ s_j $ is specified by a capacity $ c _ -LCB- jk -RCB- $ and a time period $ -LSB- s _ -LCB- jk -RCB- , e _ -LCB- jk -RCB- -RRB- $ . The constraint is satisfied if the number of flights entering the sector $ s_j $ during the interval -LSB- sj , k , ej , k -RRB- is smaller than or equal to $ c _ -LCB- j , k -RCB- $ . The set $ F_j $ denotes the set of flights that enter the sector $ s_j $ : $ \ | \ -LCB- i \ in F_j | s _ -LCB- jk -RCB- \ le d_i + eto _ -LCB- ij -RCB- \ le e _ -LCB- jk -RCB- \ | \ le c _ -LCB- jk -RCB- $ . A slot allocation policy assigns a non-negative delay di to each flight $ f_i $ such that all capacity constraints are satisfied . Negative delays due to departures ahead of schedule are not allowed . The total delay of a slot allocation policy is the sum of the $ d_i $ 's for all flights $ f_i $ . Policies with smaller total delay are preferred .

Back to list