• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.161-168
• /
• 2014

The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.