Solving the Aircraft Sequencing Problem Using Concurrent Constraint Programming

In this paper we describe an application that solves the problem of aircraft sequencing in airports using a single runway. In this problem, the air traffic controller must compute a landing (take off) time for each plane in the horizon or airport. The cost is associated with the difference between the plane preferred time (for landing or taking off) and the time assigned to it. There is also a minimum separation time between planes that must be respected to avoid accidents. We have implemented an application using Mozart with finite domain constraints, GUIs to interact with the user, and a propagator with a simple, but very helpful operation to cut domains. The basis of the application is the engine that implements the model of the problem; it is easily extensible through the implementation of new distributors. This paper shows how the powerful features of Mozart could be exploited to implement practical applications.