Runway Scheduling with Holding Pattern and Service Priority

In this paper, we have studied a scheduling problem associated with air-traffic control, in which a set of aircrafts are about to land on a single runway. The objectives are to maximize the minimum time elapsed between any two consecutive landings, minimize the 107108 maximum number of times a plane enters a holding time, likewise including the priority of aircraft landings. We use the mixed integer three dimensional problem formulation that allows us to solve large instances of the general problem. Our numerical results validated the effectiveness of the proposed method.

[1]  Alexandre M. Bayen,et al.  Real-time discrete control law synthesis for hybrid systems using MILP: application to congested airspace , 2003, Proceedings of the 2003 American Control Conference, 2003..

[2]  Jiawei Zhang,et al.  An approximation algorithm for scheduling aircraft with holding time , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[3]  Pascal Brisset,et al.  Slot allocation in Air Traffic Flow Management , 2000 .

[4]  Philippe Baptiste,et al.  Runway sequencing with holding patterns , 2008, Eur. J. Oper. Res..

[5]  Alexandre M. Bayen,et al.  MILP formulation and polynomial time algorithm for an aircraft scheduling problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6]  Shin Ishii,et al.  Constrained neural approaches to quadratic assignment problems , 1998, Neural Networks.