Exact and Heuristic Algorithms for Runway Scheduling

Malik, Waqar; Jung, Yoon

doi:10.2514/6.2016-4072

Cited by 6 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Optimization goals are changed gradually from single to multiple [15]. They are no more simply time delay or economic loss.…”

Section: Discussionmentioning

confidence: 99%

A Review for Aircraft Landing Problem

Wang

2018

MATEC Web Conf.

View full text Add to dashboard Cite

Abstract. Substantial increase in the amount of civil aviation traffic and other factors have led to frequent congestion and adverse effects in terminal area. Therefore, the landing sequence of aircrafts need to be managed so as to reduce adverse effects. This type of problem is called Aircraft Landing Problem (ALP), and is an optimization problem. In this paper, the current situation of ALP research is analysed. The specific process of landing is described, and the existing research problems are classified. At the same time, on the aspect of optimization, this paper discusses the optimization processing of ALP, including the establishment of optimization model and the design of optimization algorithm. In the last, the future research trend of ALP is proposed as conclusions.

show abstract

“…Optimization goals are changed gradually from single to multiple [15]. They are no more simply time delay or economic loss.…”

Section: Discussionmentioning

confidence: 99%

A Review for Aircraft Landing Problem

Wang

2018

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…The runway scheduling problem has been studied in various ways. In particular, many common solution techniques used for job-shop scheduling problems, such as dynamic programming 9,11,20,22 , heuristics 24 , as well as Mixed Integer Linear Programming (MILP)-based optimization model 3,4,13,8,10 , were applied to runway scheduling problems. Ref.…”

Section: B Runway Scheduling Problemmentioning

confidence: 99%

Optimization of Airport Surface Traffic: A Case-study of Incheon International Airport

Eun

Jeon

Lee

et al. 2017

17th AIAA Aviation Technology, Integration, and Operations Conference

Self Cite

View full text Add to dashboard Cite

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILPbased optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

show abstract

“…With a time limit of 15 seconds, the tabu search heuristic outperforms the two MILP models. Malik and Jung () proposed one exact and two heuristic algorithms to solve the ATP, and they conclude that heuristics are more suitable than the exact approach to produce good‐quality solutions in a relatively short computation time. D'Ariano et al.…”

Section: Introductionmentioning

confidence: 99%

Optimization of departure runway scheduling incorporating arrival crossings

Sbihi

Delahaye

2019

Int Trans Operational Res

View full text Add to dashboard Cite

The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two Integer Linear Programming (ILP) models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first-come-first-served rule. Moreover, SA has sufficiently small computation time for real-time deployment.

show abstract

Exact and Heuristic Algorithms for Runway Scheduling

Cited by 6 publications

References 18 publications

A Review for Aircraft Landing Problem

A Review for Aircraft Landing Problem

Optimization of Airport Surface Traffic: A Case-study of Incheon International Airport

Optimization of departure runway scheduling incorporating arrival crossings

Contact Info

Product

Resources

About