Algorithmic Optimization And Simulation For The Gate Assignment Problem In The Hub Airport

This paper mainly gives the solution to the optimization of the gate assignment in hub airports, and also the mathematic model and the algorithm. Firstly, considering the economic effectiveness and quality of the service of the airport, this paper sets up a model of gate assignment in hub airports which reaches the maximum utilization ratio of the near gate and the minimum distance for the transfer passengers. Then an algorithm called greedy simulated annealing algorithm is designed for this model which gives the gate assignment of the aircrafts in the airport using the"first come, first serve"principle, and then uses traditional simulated annealing algorithm to optimize the result for the gate assignment of the aircrafts in transfer hour. This paper simulates the real case of Shanghai Pudong International Airport and uses the mathematic software to realize the model. Finally makes an evaluation to the model and algorithm of the gate assignment from three aspects: time effectiveness, optimization and real-time. It makes out that the assignment using the method proposed in this paper is better than the practical assignment of the airport. This method gives the valuable use for reference to the improvement of the assignment efficiency, economic effectiveness and the quality of the service, and also the real-time requirement.