A Ripple Spreading Algorithm for Free-Flight Route Optimization in Dynamical Airspace

To resolve the problem of insufficient air routes in the near future, the concept of free flight gives a new solution that all aircraft are allowed to fly their optimal routes. This promising approach would improve the current economic, environmental and safety problems of civil aviation operations. In this paper, a ripple spreading algorithm is proposed for optimizing the aircraft free-flight route in a dynamical airspace. First, the problem description and a mathematical model are presented. Moving adverse weather areas, restricted zones, and time-variant airflow characteristics are taken into account in the airspace. Second, a ripple spreading algorithm adapted to a dynamically weighted network is introduced. The optimal flight route can be achieved by a single run of this efficient method. Finally, a numerical experiment is performed to show the effectiveness of the reported method in optimizing the free-flight route in a given complex dynamical airspace.