• Title/Summary/Keyword: aircraft sequencing

Search Result 5, Processing Time 0.018 seconds

Probabilistic Model for Air Traffic Controller Sequencing Strategy (항공교통관제사의 항공기 합류순서결정에 대한 확률적 예측모형 개발)

  • Kim, Minji;Hong, Sungkwon;Lee, Keumjin
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.22 no.3
    • /
    • pp.8-14
    • /
    • 2014
  • Arrival management is a tool which provides efficient flow of traffic and reduces ATC workload by determining aircraft's sequence and schedules while they are in cruise phase. As a decision support tool, arrival management should advise on air traffic control service based on the understanding of human factor of its user, air traffic controller. This paper proposed a prediction model for air traffic controller sequencing strategy by analyzing the historical trajectory data. Statistical analysis is used to find how air traffic controller decides the sequence of aircraft based on the speed difference and the airspace entering time difference of aircraft. Logistic regression was applied for the proposed model and its performance was demonstrated through the comparison of the real operational data.

Effective simulation-based optimization algorithm for the aircraft runway scheduling problem

  • Wided, Ali;Fatima, Bouakkaz
    • Advances in aircraft and spacecraft science
    • /
    • v.9 no.4
    • /
    • pp.335-347
    • /
    • 2022
  • Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

Prediction Model with a Logistic Regression of Sequencing Two Arrival Flows (합류하는 두 항공기간 도착순서 결정에 대한 로지스틱회귀 예측 모형)

  • Jung, Soyeon;Lee, Keumjin
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.23 no.4
    • /
    • pp.42-48
    • /
    • 2015
  • This paper has its purpose on constructing a prediction model of the arrival sequencing strategy which reflects the actual sequencing patterns of air traffic controllers. As the first step, we analyzed a pair-wise sequencing of two aircraft entering TMA from different entering points. Based on the historical trajectory data, several traffic factors such as time, speed and traffic density were examined for the model. With statistically significant factors, we constructed a prediction model of arrival sequencing through a binary logistic regression analysis. With the estimated coefficients, the performance of the model was conducted through a cross validation.

A Development of Arrival Scheduling and Advisory Generation Algorithms based on Point-Merge Procedure (Point-Merge 절차를 이용한 도착 스케줄링 및 조언 정보 생성 알고리즘 개발)

  • Hong, Sungkweon;Kim, Soyeun;Jeon, Daekeun;Eun, Yeonju;Oh, Eun-Mi
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.25 no.3
    • /
    • pp.44-50
    • /
    • 2017
  • This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

Air-traffic dispatching scheduling in terminal airspace (공항접근영역 항공교통 Dispatching 스케줄링 연구)

  • Jeong, Sun-Jo;Cho, Doo-Hyun;Choi, Han-Lim
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.11
    • /
    • pp.973-980
    • /
    • 2016
  • An air traffic management (ATM) has been studied in a variety of fields to utilize an air traffic capacity efficiently and solve a congested air traffic situation due to an increment of an air traffic demand. In this paper, an air traffic management, which is related with controlling and determining the sequencing of an aircraft approaching to an airport, in terminal control area is studied. This paper focuses on scheduling algorithms with a given problem for the air traffic management with operational constraints, such as a space separation, an overtaking on the same air-route, and a route merge point (a scheduling point). For a real-time calculation, the presented algorithms focus on dispatching heuristic rules which are able to assign tasks in a fast time period with an adequate performance, which can be demonstrated as a proper and realistic scheduling algorithm. A simulation result is presented to illustrate the validity and applicability of the proposed algorithm. Each scheduling rule is analyzed on the same static and dynamic air traffic flow scenario with the ATM Monte-Carlo simulation.