Abstract: It is important to reduce transfer time in hub airports with real-time gate assignment. However, the gate assignment problem (GAP) is an NP-hard problem, and traditional heuristic algorithms do not provide satisfactory solutions. We propose a new simulated annealing algorithm integrated with a sorting strategy to resolve the GAP. An initial solution is obtained through sorting each gate preference value and flight load factor. An optimal solution is then obtained using the traditional simulated annealing algorithm. Case studies show the simulated annealing algorithm with a prior sorting process can provide better results than the traditional simulated annealing algorithm. Computation efficiency is also better than CPLEX with an acceptable convergence rate. The proposed algorithm provides a new ways to resolve the GAP in hub airports.

Key words: hub airport, gate assignment problem, simulated annealing integrated with sorting approach, CPLEX