Central East Pacific Flight Routing

Abstract

In this article the authors discuss possible advantages over user-preferred routing experienced by fixed Central East Pacific (CEP) routes for air traffic control (ATC) applications. Specifically, the authors assessed the time savings, fuel savings, and airspace complexity implications that might result in transitioning from structured CEP routes to user-preferred routes. A dynamic programming algorithm using wind-optimization and minimum travel-time was developed and tested using wind-optimal and nominal simulation routing for a period of five days. The complexity measures employed include two measures of time-varying airspace complexity, fuel savings, and time savings. Through the simulation testing, researchers found a high level of density variation. Correlations between wind-optimal routing and nominal routing were found with variations in flight density in time-varying complexity measures. Benefits from the proposed algorithm for this route include time savings of 4.8-9.9 minutes per flight and 192-347 kg fuel per flight.