A Weight-Based Graph Coloring Approach to Airport Gate Assignment Problem

A graph coloring model of airport gate assignment problem (AGAP) is constructed in this paper, and a kind of new time slot algorithm is used to find out the conflict sets of all the flights. By considering both the type and time conflict of a flight comprehensively, a new criterion for measuring the difficulty of a flight is put forward which can be used to compute the difficulty coefficients of each flight to be assigned. And after that all these flights will be sorted in descending order by their difficulty coefficients before assigning them to available gates. Finally, experimental results on the stochastic data sets demonstrate the effectiveness of the algorithm put forward in this paper.