2017
DOI: 10.1016/j.tre.2016.12.001
|View full text |Cite
|
Sign up to set email alerts
|

Reducing ATFM delays through strategic flight planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(32 citation statements)
references
References 16 publications
1
31
0
Order By: Relevance
“…Hence, when valuing the current state or determining projections of air traffic development it's important to include different factors -ranging from ecologic to economic impacts (Steiner et al, 2008). Especially because their strategic planning can lead to reduction of delays and costs (Bolić et al, 2017). In that context, it can be distinguished one more airspace fragmentation type.…”
Section: Discussionmentioning
confidence: 99%
“…Hence, when valuing the current state or determining projections of air traffic development it's important to include different factors -ranging from ecologic to economic impacts (Steiner et al, 2008). Especially because their strategic planning can lead to reduction of delays and costs (Bolić et al, 2017). In that context, it can be distinguished one more airspace fragmentation type.…”
Section: Discussionmentioning
confidence: 99%
“…Aircraft rotations are considered by turnaround time constraints. Bolić et al (2017) [18] present an integer programming model for network-based flight scheduling problem. Apart from the assigning departure time to each flight, the proposed model also gives flight route decisions.…”
Section: Literature Reviewmentioning
confidence: 99%
“…(3) //set the first T imb − 1 of array to 1, which corresponds to a solution; (4) for i ⟵ 0 to T imb − 1 do (5) index[i] � 1; (6) end for (7) Store the solution according to the values of array index[ ]; (8) while has Done (index, N, T imb ) do (9) for i ⟵ 0 to N + 1 do (10) //find the first 1-0 combination and change it to 0-1 combination; (11) if index[i] � � 1 and index[i] � � 0 then (12) index[i] � 0; (13) index[i] � 1; (14) Store the solution from index[ ]; (15) //move 1 of the left of 0-1 combination to the left of array; (16) int count � 0; (17) for j ⟵ 0 to i do (18) if index[j] � � 1 then (19) index[j] � 0; (20) index[count++] � 1; (21) end if (22) end for (23) end if (24) break; (25) end for (26) end while ALGORITHM 2: 0-1 combination algorithm for COR i . where Cost g and L g are the delay cost and air traffic control load if corridor COR g uses the strategy that node u represents.…”
Section: Strategy Generation Algorithm For Each Corridor Cormentioning
confidence: 99%
“…e second way is to regulate the traffic flow by using the traffic management initiatives (TMIs) [8], such that the limited capacity can be used efficiently and the impact of unavoidable delays would be reduced [9]. And, the TMIs can be classified into two categories: (1) strategic actions, which are the strategies that taken before the aircraft has been taken off, including ground delay program [10], ground stop [11], airspace flow program [12], minute-in-trail or miles-in-trail [13], and Collaborative Trajectory Options Program [14] and (2) tactical actions, which are the strategies that taken after the aircraft is airborne, consisting of rerouting [15], speed adjustment, airborne holding [16], and fix balancing.…”
Section: Introductionmentioning
confidence: 99%