• Title/Summary/Keyword: Landing sequence optimization

Search Result 2, Processing Time 0.015 seconds

A Polynomial Time Algorithm for Aircraft Landing Problem (항공기 착륙 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.161-168
    • /
    • 2014
  • The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.

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.