Latest revision as of 08:08, 2 February 2021

Abstract

ce capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

Original document

The different versions of the original document can be found in:

• http://www.aviationsystemsdivision.arc.nasa.gov/publications/2010/Ng_ATIO2010_final.pdf

• http://arc.aiaa.org/doi/pdf/10.2514/6.2010-9113,

http://dx.doi.org/10.2514/6.2010-9113

• https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/20110008163.pdf,

https://ntrs.nasa.gov/search.jsp?R=20110008163,

https://arc.aiaa.org/doi/pdf/10.2514/6.2010-9113,

https://repository.exst.jaxa.jp/dspace/handle/a-is/248165,

https://academic.microsoft.com/#/detail/2031908049