Aircraft sequencing and scheduling within terminal airspaces has become more complicated due to increased air traffic demand and airspace complexity. A stochastic mixed-integer linear programming model is proposed to handle aircraft sequencing and scheduling problems using the simulated annealing algorithm. The proposed model allows for proper aircraft sequencing considering wind direction uncertainties, which are critical in the decision-making process. The proposed model aims to minimise total aircraft delay for a runway airport serving mixed operations. To test the stochastic model, an appropriate number of scenarios were generated for different air traffic demand rates. The results indicate that the stochastic model reduces the total aircraft delay considerably when compared with the deterministic approach.
1 April 2019 in Journal of Advanced Transportation
This study proposes a two-step solution approach for aircraft conflict resolution and fuel consumption due to resolution maneuver occurring in free-route airspace. This model aims to provide a mathematical basis for a decision-support system that is used during the pretactical conflict resolution in air traffic management. Mathematical model of the first step presents alternative entry points on both sides of existing sector entry points to minimize delays by directing aircraft to the most convenient entry points. The second step suggests a vector deflection maneuver to minimize extra fuel consumption caused by conflict resolution. GAMS/CPLEX solver is used to solve the first step of the model but the solution is not produced in a reasonable time. To obtain feasible solutions, genetic algorithm and tabu search algorithms are implemented in the first step. Small size test problems are generated to evaluate the metaheuristic algorithms, and results are compared with GAMS/CPLEX solver solutions. According to this comparison, both metaheuristics algorithms produce near optimal solutions in a reasonably short time. The proposed approach has made significant improvements for airborne delays and extra fuel consumption caused by aircraft conflicts resolution in large-scaled airspaces.
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.
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.
7 February 2022 in Transportation Research Record: Journal of the Transportation Research Board
This study considers the terminal traffic flow problem and aims to minimize the total fuel consumed in extended terminal maneuvering areas (E-TMA) using a mixed-integer linear programming model. To reveal the benefits of the E-TMA concept, the exact solution solver is selected to determine optimal aircraft sequencing. Furthermore, the proposed model applies separation and sequencing maneuvers, including the point merge system (PMS), vector maneuvers (VM), and en route speed reduction maneuvers. An innovative mathematical model is presented for this problem. In this study, the proposed model is compared with two other approaches. The first uses VM and PMS without changing the initial sequencing. The second utilizes the VM and PMS maneuvers. Unlike the first approach, it searches for the optimum aircraft arrival sequencing. The results demonstrate that the proposed model could reduce total fuel consumption by 9.45% and 1.95% compared with the other two approaches.