Determination of the Departure Sequence Under Holding Area Queue Interchanges in an Airport

Please enable javascript in your browser.

Taherkhani, Hamed | 2009

1028 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 40017 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Kianfar, Farhad
Abstract:
In this thesis departure programming are studied in general state and takeoff programming studied in special state. Departure programming consists of several parts that decisions for each part may influence in the other parts. Because of unforeseen delays this problem is a dynamic problem. Holding area is a part that overtaking operations performance before takeoff. An initial sequence obtained from ground controller. A heuristic algorithm that used in this thesis is a hybrid of constraint satisfaction and dynamic programming for minimizing sum of the total delays. The performance of the heuristic algorithm is compared with tabu search algorithm. The result shows that the proposed algorithm has a superior performance compared to the tabu search
Keywords:
Airports ; Scheduling ; Runways ; Dynamic Algorithm ; Runway Controller ; Constraint Satisfaction