Browse > Article
http://dx.doi.org/10.12673/jant.2015.19.2.116

Development of a Practical Algorithm for Airport Ground Movement Routing  

Yun, Seokjae (Department of Air Transport, Transportation and Logistics, Graduate School, Korea Aerospace University)
Ku, SungKwan (Department of Aviation Leisure & Industry Management, School of Aeronautical Science, Hanseo University)
Baik, Hojong (School of Air Transport, Transportation, Logistics and Air & Space Law, Korea Aerospace University)
Abstract
Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.
Keywords
Routing algorithm; Dijkstra algorithm; $A^*$ algorithm; Hybrid $A^*$ algorithm; Airport movement area;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 S. K. Ku and H. J. Baik, "Case study on safety assessment standard for A-SMGCS", The Journal of Korea Navigation Institute, Vol. 18, No. 6, pp. 562-568, Dec. 2014.   DOI
2 Airport CDM Team Munchen, Airport collaborative decision making, Deutsche Flugsicherung, Munchen, V5.0, Jul. 2009
3 Incheon international airport coporation, SMGCS plan, IIAC, Incheon, Rev 26, Mar. 2015.
4 H. Baik, Development of optimization and simulation models for the analysis of airfield operation, Ph.D. dissertation, Virginia Polytechnic Institute and State University, Blacksburg, VA, 2000.
5 R. K. Ahuja, J. B. Orlin, P. Sharma, and P. T. Sokkalingam, "A network simplex algorithm with O(n) consecutive degenerate pivots", Operation Research Letters, 30, pp. 141-148, Jan. 2002.   DOI
6 A. F. Katsaros, Development and evaluation of novel algorithms for enhanced aircraft routing on ground, Master dissertation, University of Gothenburg, Gothenburg, Sweden, 2012.
7 J. Y. Cai, G. Havas, B. Mans, A. Nerurkar, J. P. Seifert, and I. Shparlinski, "On routing in circulant graphs", in Porceeding the 5th annual international Computing and Combinatorics conference, Tokyo: Japan, pp. 360-369, Jul. 1999.
8 E. W. Dijkstra, "A note on two problems in connexion with graphs", Nemerische Mathematik, Vol. 1, Issue. 1, pp. 269-271, Oct. 2010.
9 F. S. Hussein, S. R. Douglas, V. Yannis, and S. R. Lee, "Evaluation of multicast routing algorithms for real-time communication on hight-speed networks", IEEE Journal on Selected Area in Communication, Vol. 15, No. 3, pp. 332-345, Apr. 1997.   DOI
10 P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost path", IEEE Transactions of Systems Science and Cybernetics, Vol. ssc-4, No. 2, pp. 100-107, Jul. 1968.
11 S. H. Ok, J. H. Ahn, S. Kang, and B. Moon, "A combined heuristic algorithm for preference-based shortest path search", The Institute of Electronics and Information Engineers, Vol. 47, No. 8, pp. 74-87, Aug. 2010.
12 S. Arora, "Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems", Journal of the ACM(association for computing machinery), Vol. 45, No. 5, pp. 753-782, Oct. 1998.   DOI
13 A. Stentz, "The focussed D* algorithm for real-time replanning", in Proceeding of the International Joint Conference on Artificial Intelligence, Montreal: Canada, pp. 1652-1659, 1995.
14 S. Lee, K. Jung, B. Hwang, and W. Jung, "Modified bidirectional A* algorithm for optimal car route guidance search," in Autumn Conference of Korean Society for Internet Information, Seoul: Korea, pp. 44-45, 2002.