@article{ART001914340},
author={Sang-Un, Lee},
title={A Polynomial Time Algorithm for Aircraft Landing Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2014},
volume={19},
number={9},
pages={161-168}
TY - JOUR
AU - Sang-Un, Lee
TI - A Polynomial Time Algorithm for Aircraft Landing Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2014
VL - 19
IS - 9
PB - The Korean Society Of Computer And Information
SP - 161
EP - 168
SN - 1598-849X
AB - The optimal solution ofminimumcost for aircraft landing problem(ALP) is very difficult problembecause theapproached aircraft are randomtime interval. Therefore this problemhas been applied by variousmetaheuristicmethods. This paper suggests O(ｎlogｎ) polynomial time heuristic algorithm to obtain the optimalsolution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then weapply the optimization of change the landing sequence take account of separation time and the costof landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data untilthe number of runway ｍ that the total landing cost is 0. We can be obtain the optimal solution forall of the 25 data. Especially we can be improve the known optimal solution for ｍ=1 of Airland8.
KW - Aircraft landingproblem;Target time;Cost function;Separationtime;Landingsequenceoptimization
DO -
UR -
ER -
Sang-Un, Lee. (2014). A Polynomial Time Algorithm for Aircraft Landing Problem. Journal of The Korea Society of Computer and Information, 19(9), 161-168.
Sang-Un, Lee. 2014, "A Polynomial Time Algorithm for Aircraft Landing Problem", Journal of The Korea Society of Computer and Information, vol.19, no.9 pp.161-168.
Sang-Un, Lee "A Polynomial Time Algorithm for Aircraft Landing Problem" Journal of The Korea Society of Computer and Information 19.9 pp.161-168 (2014) : 161.
Sang-Un, Lee. A Polynomial Time Algorithm for Aircraft Landing Problem. 2014; 19(9), 161-168.
Sang-Un, Lee. "A Polynomial Time Algorithm for Aircraft Landing Problem" Journal of The Korea Society of Computer and Information 19, no.9 (2014) : 161-168.
Sang-Un, Lee. A Polynomial Time Algorithm for Aircraft Landing Problem. Journal of The Korea Society of Computer and Information, 19(9), 161-168.
Sang-Un, Lee. A Polynomial Time Algorithm for Aircraft Landing Problem. Journal of The Korea Society of Computer and Information. 2014; 19(9) 161-168.
Sang-Un, Lee. A Polynomial Time Algorithm for Aircraft Landing Problem. 2014; 19(9), 161-168.
Sang-Un, Lee. "A Polynomial Time Algorithm for Aircraft Landing Problem" Journal of The Korea Society of Computer and Information 19, no.9 (2014) : 161-168.
