The aviation industry has rapidly developed in recent years. Due to the increased number of flight operations, managing air traffic has become essential. The air traffic management system aims to reduce the air traffic control workload and use existing resources more efficiently. This study proposed a new mixed integer linear programming model to minimise the total fuel consumption during taxi operations for the runway assignment problem, comparing the actual Istanbul Airport runway assignment data. The average taxi times are calculated using the 30,000-flight operations data for each arrival and departure taxi route. Also, 47 different aircraft types are obtained using the data for the fuel consumption calculation. The International Civil. Aviation Organisation (IACO) aircraft engine emissions databank provides the fuel consumption values for each aircraft according to engine type. This approach allows our model to calculate more realistic fuel consumption for taxi operations, as each aircraft engine type has a different fuel consumption value. The proposed model is implemented at Istanbul Airport, the busiest airport in Turkey, where multiple parallel runway operations are applied. The results showed that the proposed model reduced total fuel consumption for taxi operations between 6.6% and 14.4% compared to the actual Istanbul Airport runway assignment data.

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.