| As China’s national income continues to rise and the e-commerce and logistics industries continue to develop,the public’s propensity for air transportation is increasing,which has led to increasing pressure on airports to stop flights in the course of daily operations.On the other hand,in case of emergencies such as local wars,highly contagious epidemics,etc.,mass suspensions will occur,and in such cases the problem faced by the airport will change to one of planning the parking of a large number of non-missioned aircraft on the apron.Based on the above-mentioned scenarios,this paper classifies two types of airport situations,i.e.,normal and emergency or special situations,and then investigates the gate assignment problem and apron planning problem that need to be solved in these two situations respectively.The main research work of this paper is as follows.First,this paper investigates the gate assignment problem based on multi-objective programming in the normal situation.In this paper,a gate assignment model with multi-objective programming is constructed based on the flight ground operation process.After that,this paper introduces the greedy algorithm,thread pool and tabu structure supporting dynamic tabu length in the tabu search algorithm,and then designs an improved tabu search algorithm to solve the model.Finally,this paper designs experiments based on the flight plans and gate resources provided by the airport,and analyzes the superiority of the algorithm on the basis of verifying the effectiveness of the algorithm.Then,this paper explores the apron planning problem based on two-dimensional knapsack packing that arises in emergency or special situations.This paper provides a planning strategy for parking aircraft on large aprons with the goal of maximizing total revenue.This strategy plans the parking location for each aircraft by taking into account factors such as the safety distances for each type of aircraft and the taxiing modes used by the aircraft when taxiing on the ground.To address the problem,this paper establishes an apron planning model and designs a two-stage planning algorithm to solve it based on dynamic programming and left-bottom filling algorithms.Finally,this paper uses some common civil aircraft types as arithmetic examples to verify the effectiveness of the proposed method through experiments.The numerical simulation shows that the two models constructed and the two algorithms designed in this paper can effectively solve the gate assignment problem in the normal situation and the apron planning problem in the emergency or special situation,and achieve good solution results. |
