MILP formulation and polynomial time algorithm for an aircraft scheduling problem

This paper presents a polynomial time algorithm used for solving a mixed integer linear program (MILP) formulation of a scheduling problem applicable to air traffic control. We first relate the general MILP (which we believe to be NP-hard) to the air traffic control problem, which consists of performing maneuver assignments to achieve scheduling constraints for airport arrival traffic. This MILP can be solved with CPLEX, yet there is no guarantee on the running time. We show that a specific case of this air traffic control problem, which is of interest in its own right, may be solved using an exact polynomial-time algorithm. The case of interest consists of finding the largest achievable time separation between aircraft upon arrival, compatible with airspace restrictions and aircraft performance. Our algorithm transforms the problem to a single machine scheduling problem, and then embeds its solution into a bisection algorithm. We establish the polynomial complexity of the resulting algorithm by proving an algebraic property of its optimal solution. We compare the running times of CPLEX and our algorithm for 1800 cases with up to 20 aircraft. The results show numerical evidence of the guaranteed running time of our algorithm, by contrast with CPLEX whose average performance is good, but also shows a significant number of instances with unpredictably large computational time. We perform 8100 additional runs of our algorithm with up to 100 aircraft, to numerically confirm the predicted worst case running time of our algorithm.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Jacques Carlier.  Problemes d'ordonnancement à durées égales , 1981 .

[4]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[5]  Heinz Erzberger,et al.  Design of Center-TRACON Automation System , 1993 .

[6]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[7]  H. P. Williams,et al.  Computational logic and integer programming , 1996 .

[8]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[9]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[10]  Alberto Bemporad,et al.  Piecewise linear optimal controllers for hybrid systems , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[11]  Kapil Sheth,et al.  FACET: Future ATM Concepts Evaluation Tool , 2001 .

[12]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[13]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[14]  Jonathan P. How,et al.  Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming , 2002 .

[15]  Eric Feron,et al.  Conflict-Free Conformance to En Route Flow Rate Constraints , 2002 .

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[17]  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..

[18]  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).