Optimized Route Capability (ORC) Intelligent Offloading of Congested Arrival Routes

The Optimized Route Capability (ORC) concept is designed to enable intelligent offloading of congested arrival routes. When ORC predicts arrival route congestion as projected excess arrival meter fix delay, automation offers decision support to traffic managers by identifying candidate flights to strategically reroute to alternate meter fixes and alleviate the congestion. This concept was applied to a model of arrival operations into Houston International Airport. An arrival rush from the Northeast was simulated in fast-time to analyze ORC algorithm behavior. The results demonstrate how strategically rerouting a few flights to alternate meter fixes not only has the potential to manage meter fix delay (and possibly the need for traffic management initiatives applied upstream), but may also increase airport capacity utilization and reduce total flight delay

Multiobjective Tactical Planning under Uncertainty for Air Traffic Flow and Capacity Management

We investigate a method to deal with congestion of sectors and delays in the tactical phase of air traffic flow and capacity management. It relies on temporal objectives given for every point of the flight plans and shared among the controllers in order to create a collaborative environment. This would enhance the transition from the network view of the flow management to the local view of air traffic control. Uncertainty is modeled at the trajectory level with temporal information on the boundary points of the crossed sectors and then, we infer the probabilistic occupancy count. Therefore, we can model the accuracy of the trajectory prediction in the optimization process in order to fix some safety margins. On the one hand, more accurate is our prediction; more efficient will be the proposed solutions, because of the tighter safety margins. On the other hand, when uncertainty is not negligible, the proposed solutions will be more robust to disruptions. Furthermore, a multiobjective algorithm is used to find the tradeoff between the delays and congestion, which are antagonist in airspace with high traffic density. The flow management position can choose manually, or automatically with a preference-based algorithm, the adequate solution. This method is tested against two instances, one with 10 flights and 5 sectors and one with 300 flights and 16 sectors.Comment: IEEE Congress on Evolutionary Computation (2013). arXiv admin note: substantial text overlap with arXiv:1309.391

A Perspective on NASA Ames Air Traffic Management Research

This paper describes past and present air-traffic-management research at NASA Ames Research Center. The descriptions emerge from the perspective of a technical manager who supervised the majority of this research for the last four years. Past research contributions built a foundation for calculating accurate flight trajectories to enable efficient airspace management in time. That foundation led to two predominant research activities that continue to this day - one in automatically separating aircraft and the other in optimizing traffic flows. Today s national airspace uses many of the applications resulting from research at Ames. These applications include the nationwide deployment of the Traffic Management Advisor, new procedures enabling continuous descent arrivals, cooperation with industry to permit more direct flights to downstream way-points, a surface management system in use by two cargo carriers, and software to evaluate how well flights conform to national traffic management initiatives. The paper concludes with suggestions for prioritized research in the upcoming years. These priorities include: enabling more first-look operational evaluations, improving conflict detection and resolution for climbing or descending aircraft, and focusing additional attention on the underpinning safety critical items such as a reliable datalink

Impact of Tactical and Strategic Weather Avoidance on Separation Assurance

The ability to keep flights away from weather hazards while maintaining aircraft-to-aircraft separation is critically important. The Advanced Airspace Concept is an automation concept that implements a ground-based strategic conflict resolution algorithm for management of aircraft separation. The impact of dynamic and uncertain weather avoidance on this concept is investigated. A strategic weather rerouting system is integrated with the Advanced Airspace Concept, which also provides a tactical weather avoidance algorithm, in a fast time simulation of the Air Transportation System. Strategic weather rerouting is used to plan routes around weather in the 20 minute to two-hour time horizon. To address forecast uncertainty, flight routes are revised at 15 minute intervals. Tactical weather avoidance is used for short term trajectory adjustments (30 minute planning horizon) that are updated every minute to address any weather conflicts (instances where aircraft are predicted to pass through weather cells) that are left unresolved by strategic weather rerouting. The fast time simulation is used to assess the impact of tactical weather avoidance on the performance of automated conflict resolution as well as the impact of strategic weather rerouting on both conflict resolution and tactical weather avoidance. The results demonstrate that both tactical weather avoidance and strategic weather rerouting increase the algorithm complexity required to find aircraft conflict resolutions. Results also demonstrate that tactical weather avoidance is prone to higher airborne delay than strategic weather rerouting. Adding strategic weather rerouting to tactical weather avoidance reduces total airborne delays for the reported scenario by 18% and reduces the number of remaining weather violations by 13%. Finally, two features are identified that have proven important for strategic weather rerouting to realize these benefits; namely, the ability to revise reroutes and the use of maneuvers that start far ahead of encountering a weather cell when rerouting around weather

Timing of Train Disposition: Towards Early Passenger Rerouting in Case of Delays

Passenger-friendly train disposition is a challenging, highly complex online optimization problem with uncertain and incomplete information about future delays. In this paper we focus on the timing within the disposition process. We introduce three different classification schemes to predict as early as possible the status of a transfer: whether it will almost surely break, is so critically delayed that it requires manual disposition, or can be regarded as only slightly uncertain or as being safe. The three approaches use lower bounds on travel times, historical distributions of delay data, and fuzzy logic, respectively. In experiments with real delay data we achieve an excellent classification rate. Furthermore, using realistic passenger flows we observe that there is a significant potential to reduce the passenger delay if an early rerouting strategy is applied

Structure and Simulation Evaluation of an Integrated Real-Time Rescheduling System for Railway Networks

A critical problem faced by railways is how to increase capacity without investing heavily in infrastructure and impacting on schedule reliability. One way of increasing capacity is to reduce the buffer time added to timetables. Buffer time is used to reduce the impact of train delays on overall network reliability. While reducing buffer times can increase capacity, it also means that small delays to a single train can propagate quickly through the system causing knock-on delays to trains impacted by the delayed train. The Swiss Federal Railways (SBB) and Swiss Federal Institute of Technology (ETH) are researching a new approach for real-time train rescheduling that could enable buffer times to be reduced without impacting schedule reliability. This approach is based on the idea that if trains can be efficiently rescheduled to address delays, then less buffer time is needed to maintain the same level of system schedule reliability. The proposed approach combines a rescheduling algorithm with very accurate train operations (using a driver-machine interface). This paper describes the proposed approach, some system characteristics that improve its efficiency, and results of a microscopic simulation completed to help show the effectiveness of this new approach. The results demonstrate that the proposed integrated real-time rescheduling system enables capacity to be increased and may reduce knock-on delays. The results also clearly showed the importance of accurate train operations on the rescheduling system's effectivenes

Truck Activity Pattern Classification Using Anonymous Mobile Sensor Data

To construct, operate, and maintain a transportation system that supports the efficient movement of freight, transportation agencies must understand economic drivers of freight flow. This is a challenge since freight movement data available to transportation agencies is typically void of commodity and industry information, factors that tie freight movements to underlying economic conditions. With recent advances in the resolution and availability of big data from Global Positioning Systems (GPS), it may be possible to fill this critical freight data gap. However, there is a need for methodological approaches to enable usage of this data for freight planning and operations. To address this methodological need, we use advanced machine-learning techniques and spatial analyses to classify trucks by industry based on activity patterns derived from large streams of truck GPS data. The major components are: (1) derivation of truck activity patterns from anonymous GPS traces, (2) development of a classification model to distinguish trucks by industry, and (3) estimation of a spatio-temporal regression model to capture rerouting behavior of trucks. First, we developed a K-means unsupervised clustering algorithm to find unique and representative daily activity patterns from GPS data. For a statewide GPS data sample, we are able to reduce over 300,000 daily patterns to a representative six patterns, thus enabling easier calibration and validation of the travel forecasting models that rely on detailed activity patterns. Next, we developed a Random Forest supervised machine learning model to classify truck daily activity patterns by industry served. The model predicts five distinct industry classes, i.e., farm products, manufacturing, chemicals, mining, and miscellaneous mixed, with 90% accuracy, filling a critical gap in our ability to tie truck movements to industry served. This ultimately allows us to build travel demand forecasting models with behavioral sensitivity. Finally, we developed a spatio-temporal model to capture truck rerouting behaviors due to weather events. The ability to model re-routing behaviors allows transportation agencies to identify operational and planning solutions that mitigate the impacts of weather on truck traffic. For freight industries, the prediction of weather impacts on truck driver’s route choices can inform a more accurate estimation of billable miles