ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Constraint Satisfaction Problem (CSP) Based Implementation of Scheduling Aircraft at Runway

Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 3)

Publication Date:

Authors : ; ; ; ;

Page : 271-280

Keywords : CSP; Scheduling; Runway; Aircraft;

Source : Downloadexternal Find it from : Google Scholarexternal


The aim of this Paper is to implement a Constraint Satisfaction Problem (CSP) based solution for scheduling departure sequence of Aircraft at runways. Airports are getting more and more congested as they are operating a large number of Aircrafts at limited number of available runways. This is one of the most constraining factors encountered recently. A number of approaches are used to tackle this situation at major Airports. A possibility to alleviate this congestion is to assist controllers in the planning and scheduling process of aircraft. The prototype presented in this paper is aimed to offer such assistance in the establishment of an optimal departure schedule and the planning of initial climb phases for departing aircraft. In this paper, first the operational problem of departure management is addressed by describing briefly current practice and identifying the role of departure planning at airports. Second, a mapping of the departure management problem to constraint satisfaction is described. Third, the prototype is described in detail and an example solution is presented. Finally, some conclusions are drawn. C++ and Linux are used as an implementation environment.

Last modified: 2014-04-02 01:28:20