抄録
We consider the over-constrained airport gate assignment problem where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. We will use greedy algorithm to solve the problem and compare it with other scheduling method. Actual and forecasted data will be simulated in the experiment. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions.
