2020
DOI: 10.1007/s11067-020-09508-3
|View full text |Cite
|
Sign up to set email alerts
|

Delay, Throughput and Emission Tradeoffs in Airport Runway Scheduling with Uncertainty Considerations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 42 publications
0
8
0
Order By: Relevance
“…However, a closer examination of the TMA reveals that complexity in the approach paths is not the only likely cause of congestion and arrival delay. In fact, the efficiency of arrival (or departure) sequencing at intersections or close to the runway also plays a key role in the intensity of the bottleneck effect experienced [75,76]. This situation is naturally set up as a waiting line that several studies have analyzed using the classical queuing model.…”
Section: A Existing Approaches To Arrival Traffic Modelingmentioning
confidence: 99%
“…However, a closer examination of the TMA reveals that complexity in the approach paths is not the only likely cause of congestion and arrival delay. In fact, the efficiency of arrival (or departure) sequencing at intersections or close to the runway also plays a key role in the intensity of the bottleneck effect experienced [75,76]. This situation is naturally set up as a waiting line that several studies have analyzed using the classical queuing model.…”
Section: A Existing Approaches To Arrival Traffic Modelingmentioning
confidence: 99%
“…To solve ASSP and TTFP, CPLEX solver ( 15 20 ), dynamic programming ( 2126 ), and the branch and bound algorithm ( 2729 ) have been applied as exact solution algorithms. In addition, several meta-heuristic algorithms have been implemented, such as the tabu search ( 16 , 27 , 30 , 31 ), simulated annealing ( 14 ), ( 3235 ), ant colony optimization ( 3638 ), the evolutionary algorithm ( 39 46 ), scatter search ( 47 ), particle swarm optimization ( 48 , 49 ), artificial bee colony ( 50 ), and artificial immune system ( 51 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Single-attribute dispatch strategies are generally simple and applicable. The common singleattribute dispatch strategies include: Nearest-workstation-First (NWF) [32], Nearest-Vehicle-First (NVF) [33], Longest-Idle-Vehicle (LIV) [34], First-Come-First-Served (FCFS) [35,36] and Shortest-Travel-Time-First (STTF) [4]. NWF is the dispatch strategy initiated by AGVs, and the idle AGVs search for the nearest workstation to perform tasks.…”
Section: Single-attribute Strategiesmentioning
confidence: 99%