TÜBİTAK An Optimization Approach for Airport Ground Operations with A Shortest Path Algorithm 12 November 2015 Orhan Eroglu - TUBITAK BILGEM, Turkey Zafer Altug Sayar - TUBITAK BILGEM, Turkey Guray Yilmaz – TurAFA ASTIN, Turkey

TÜBİTAK Overview Introduction Floyd-Warshall Shortest Path Algorithm The FLOW-GRO System Conclusion Future Work

TÜBİTAK Introduction

Introduction TUBITAK, BILGEM: The Scientific and Technological Research Council of Turkey, Informatics and Information Security Research Center Department of Aeronautics  Air Traffic Control Studies Tower Simulator 3D IG Systems Ground Radar Control Ground Optimization Radar Simulator Approach/Enroute Radar Control

TÜBİTAK Introduction Ground Radar

TÜBİTAK Introduction Air traffic seems to going to have twice or three times the current density, in 2020’s [1] Ground route conflicts everywhere!  Develope new decision support systems [2] usable for controllers to manage ground traffic  Route conflicts and routing delays may occur more often when taxiing of vehicles is not performed in the shortest possible way [3]  Support human controllers by computer systems  Revise and optimize traffic control procedures and standards, improving monitoring abilities by development of new traffic surveillance and communication technologies  Harden the practices of air traffic controllers

TÜBİTAK Introduction In this study, a computer system is proposed, which generates the shortest path between two points during the taxi procedures of ground traffics

TÜBİTAK Floyd-Warshall Shortest Path Algorithm

TÜBİTAK Floyd-Warshall Shortest Path Alg. Finds shortest paths between all node pairs in a weighted graph. Easy to implement Not much challenging but proposes an appropriate application for the domain.

TÜBİTAK Floyd-Warshall Shortest Path Alg. Input:  The graph array: Holds the edge weights between directly connected nodes. Outputs:  Distance Matrix (D): Holds the distance of the shortest path between each node-pair, if exists.  Sequentiality Matrix (S): Holds the sequential relationship between nodes, i.e. it holds the last node before the terminal one, if it exists, in the shortest path between two nodes

TÜBİTAK Floyd-Warshall Shortest Path Alg. procedure [array] FloydWarshall(D, S) for k in 1 to n do for i in 1 to n do for j in 1 to n do if D[i][j] > D[i][k] + D[k][j] then D[i][j] = D[i][k] + D[k][j] S[i][j] = S[k][j] Return S

TÜBİTAK Floyd-Warshall Shortest Path Alg. Pro’s:  Easy to implement  Very suitable for the problem space (ground traffic control) since airports can be represented as weighted graphs  Can be applied for the whole airport at first rather than time of ground operations Con’s:  O( ) complexity  Number of iterations may drastically increase for huge airports with thousands of nodes

TÜBİTAK The FLOW-GRO System

TÜBİTAK The FLOW-GRO System Airports as a node-based, weighted graph [6]:  Parking positions  Aprons  Taxiway segments  Lineup areas  Runway points Detailed view of the airport graph

TÜBİTAK The FLOW-GRO System Performing the Floyd-Warshall algorithm on an airport graph:  To guarantee to find the shortest taxiway between any two airport nodes, mathematically The FLOW-GRO System has been developed  The most interesting proposal: Deciding the edge weights  Euclidean distance is the very first option  Taxiway speeds may vary Inappropriate  Our proposed weight: The minimum taxiing-time of each edge, which can be calculated by dividing the edge distance by the maximum allowed taxi speed

TÜBİTAK The FLOW-GRO System The FLOW-GRO system has been examined several times in the ATC simulator system developed by TUBITAK-BILGEM  Includes database models of 4 different airports in Turkey  Each consists of hundreds of nodes, i.e. varying speed taxiways.

TÜBİTAK Conclusion

Conclusion The study do not cope with the hardest challenges  Besides, it proposes the usage of a well-known method for a common problem in air traffic control:  Optimization of taxiway routings A simple application work of a node-based algorithm in a domain of more complex computational problems

TÜBİTAK Future Work

TÜBİTAK Future Work Inevitably, the system must perform dynamic conflict resolution in order to become more interesting  In addition to static computation of the shortest taxiways, the system may also determine whether conflict exists between different traffics dynamically It can be exploited for the sake of evaluating the ability of traffic controllers to generate the most appropriate taxiing routes over the ground movements  It may also propose the next possible shortest path for the conflicting ground traffics

TÜBİTAK References

Future Work 1.H. Erzberger, "Transforming the NAS: The next generation air traffic control system." 24th International Congress of the Aeronautical Sciences, Yokohama, Japan A. P. Sage, Decision support systems. John Wiley & Sons, Inc., J. B. Gotteland et al. "Aircraft ground traffic optimization." ATM 2001, 4th USA/Europe Air Traffic Management Research and Development Seminar E. W. Weisstein, "Floyd-Warshall Algorithm.", R W. Floyd, "Algorithm 97: shortest path." Communications of the ACM5.6: 345, A. G. Marin, "Airport management: taxi planning." Annals of Operations Research 143.1: , 2006.

TÜBİTAK Thank you…