Nowadays most busy international airports and their corresponding terminal areas are suffering from huge congestion issues due to the simultaneity of their arrival aircraft. The aim of this paper is to establish a new separation method using time- based-separation, speed modification during approach phases and Point Merge System (PMS) so as to ensure efficiently the traffic flow. This work took as a case study the busiest airport of Morocco, The Mohammed V International airport of Casablanca. The proposed management model offers very good results when compared with other models such as the first-come first-served (FCFS) model.

Air traffic flow becomes denser and more complex within terminal manoeuvering areas (TMAs) due to rapid growth rates in demand. Effective TMA arrival management plays a key role in the improvement of airspace capacity, flight efficiency and air traffic controller performance. This study proposes a mixed integer linear programming model for aircraft landing problems with area navigation (RNAV) route structure using three conflict resolution and sequencing techniques together: flexible route allocation, airspeed reduction and vector manoeuver. A two-step mixed integer linear programming model was developed that minimises total conflict resolution time and then total airborne delay using lexicographic goal programming. Experimental results demonstrate that the model can obtain conflict-free and time optimal aircraft trajectories for RNAV route structures.

Aircraft conflict resolution is an important part of air traffic control operations. This study presents a mixed integer linear programming model (MILP) using a space discretisation technique to deal with aircraft conflict resolutions in en-route flight operations. The purpose of space discretisation is to concentrate on only the significant points of the airspace. The model integrates the multi entry point approach with an airspeed adjustment technique in the horizontal plane. The model aims to generate conflict-free trajectories while minimising the total changes in entry points and airspeed values. A new heuristic algorithm was developed due to the complexity of the problem. The computational results demonstrated that the proposed approach resolved aircraft conflicts for 450 different traffic scenarios in less than a minute. Considerable fuel savings were achieved with no significant increase in delay or flight time compared to conventional vectoring techniques in a fixed entry point airspace structure.