Short/medium-term prediction for the aviation emissions in the en route airspace considering the fluctuation in air traffic demand

This paper proposes a novel short/medium-term prediction method for aviation emissions distribution in en route airspace. An en route traffic demand model characterizing both the dynamics and the fluctuation of the actual traffic demand is developed, based on which the variation and the uncertainty of the short/medium-term traffic growth are predicted. Building on the demand forecast the Boeing Fuel Flow Method 2 is applied to estimate the fuel consumption and the resulting aviation emissions in the en route airspace. Based on the traffic demand prediction and the en route emissions estimation, an aviation emissions prediction model is built, which can be used to forecast the generation of en route emissions with uncertainty limits. The developed method is applied to a real data set from Hefei Area Control Center for the en route emission prediction in the next 5 years, with time granularities of both months and years. To validate the uncertainty limits associated with the emission prediction, this paper also presents the prediction results based on future traffic demand derived from the regression model widely adopted by FAA and Eurocontrol. The analysis of the case study shows that the proposed method can characterize well the dynamics and the fluctuation of the en route emissions, thereby providing satisfactory prediction results with appropriate uncertainty limits. The prediction results show a gradual growth at an average annual rate of 7.74%, and the monthly prediction results reveal distinct fluctuation patterns in the growth.     

Urban traffic flow prediction: a spatio‐temporal variable selection‐based approach

Short‐term traffic flow prediction in urban area remains a difficult yet important problem in intelligent transportation systems. Current spatio‐temporal‐based urban traffic flow prediction techniques trend aims to discover the relationship between adjacent upstream and downstream road segments using specific models, while in this paper, we advocate to exploit the spatial and temporal information from all available road segments in a partial road network. However, the available traffic states can be high dimensional for high‐density road networks. Therefore, we propose a spatio‐temporal variable selection‐based support vector regression (VS‐SVR) model fed with the high‐dimensional traffic data collected from all available road segments. Our prediction model can be presented as a two‐stage framework. In the first stage, we employ the multivariate adaptive regression splines model to select a set of predictors most related to the target one from the high‐dimensional spatio‐temporal variables, and different weights are assigned to the selected predictors. In the second stage, the kernel learning method, support vector regression, is trained on the weighted variables. The experimental results on the real‐world traffic volume collected from a sub‐area of Shanghai, China, demonstrate that the proposed spatio‐temporal VS‐SVR model outperforms the state‐of‐the‐art. Copyright © 2015 John Wiley & Sons, Ltd.     

A multi-objective approach for Dynamic Airspace Sectorization using agent based and geometric models

A key limitation when accommodating the continuing air traffic growth is the fixed airspace structure including sector boundaries. The geometry of sectors has stayed relatively constant despite the fact that route structures and demand have changed dramatically over the past decade. Dynamic Airspace Sectorization is a concept where the airspace is redesigned dynamically to accommodate changing traffic demands. Various methods have been proposed to dynamically partition the airspace to accommodate the traffic growth while satisfying other sector constraints and efficiency metrics. However, these approaches suffer from several operational drawbacks, and their computational complexity increases fast as the airspace size and traffic volume increase. In this paper, we evaluate and identify the gaps in existing 3D sectorization methods, and propose an improved Agent Based Model (iABM) to address these gaps. We also propose three additional models using KD-Tree, Bisection and Voronoi Diagrams in 3D, to partition the airspace to satisfy the convexity constraint and reduce computational cost. We then augment these methods with a multi-objective optimization approach that uses four objectives: minimizing the variance of controller workload across the sectors, maximizing the average sector flight time, and minimizing the distance between sector boundaries and the traffic flow crossing points. Experimental results show that iABM has the best performance on workload balancing, but it is restrictive when it comes to the convexity constraint. Bisection- and Voronoi Diagram-based models perform worse than iABM on workload balancing but better on average sector flight time, and they can satisfy the convexity constraint. The KD-tree-based model has a lower computational cost, but with a poor performance on the given objectives.     

Short‐term traffic flow prediction with linear conditional Gaussian Bayesian network

Traffic flow prediction is an essential part of intelligent transportation systems (ITS). Most of the previous traffic flow prediction work treated traffic flow as a time series process only, ignoring the spatial relationship from the upstream flows or the correlation with other traffic attributes like speed and density. In this paper, we utilize a linear conditional Gaussian (LCG) Bayesian network (BN) model to consider both spatial and temporal dimensions of traffic as well as speed information for short‐term traffic flow prediction. The LCG BN allows both continuous and discrete variables, which enables the consideration of categorical variables in traffic flow prediction. A microscopic traffic simulation dataset is used to test the performance of the proposed model compared to other popular approaches under different predicting time intervals. In addition, the authors investigate the importance of spatial data and speed data in flow prediction by comparing models with different levels of information. The results indicate that the prediction accuracy will increase significantly when both spatial data and speed data are included. Copyright © 2016 John Wiley & Sons, Ltd.     

On the variance of recurrent traffic flow for statistical traffic assignment

This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency.     

Three-dimensional conflict count models for unstructured and layered airspace designs

This paper presents analytical models that describe the safety of unstructured and layered en route airspace designs. Here, ‘unstructured airspace’ refers to airspace designs that offer operators complete freedom in path planning, whereas ‘layered airspace’ refers to airspace concepts that utilize heading-altitude rules to vertically separate cruising aircraft based on their travel directions. With a focus on the intrinsic safety provided by an airspace design, the models compute instantaneous conflict counts as a function of traffic demand and airspace design parameters, such as traffic separation requirements and the permitted heading range per flight level. While previous studies have focused primarily on conflicts between cruising aircraft, the models presented here also take into account conflicts involving climbing and descending traffic. Fast-time simulation experiments used to validate the modeling approach indicate that the models estimate instantaneous conflict counts with high accuracy for both airspace designs. The simulation results also show that climbing and descending traffic caused the majority of conflicts for layered airspaces with a narrow heading range per flight level, highlighting the importance of including all aircraft flight phases for a comprehensive safety analysis. Because such trends could be accurately predicted by the three-dimensional models derived here, these analytical models can be used as tools for airspace design applications as they provide a detailed understanding of the relationships between the parameters that influence the safety of unstructured and layered airspace designs.     

Research review of air traffic management

As air transport demand keeps growing more quickly than system capacity, efficient and effective management of system capacity becomes essential to the operation of the future global air traffic system. Although research in the past two decades has made significant progress in relevant research fields, e.g. air traffic flow management and airport capacity modelling, research loopholes in air traffic management still exist and links between different research areas are required to enhance the system performance of air traffic management. Hence, the objective of this paper is to review systematically current research in the literature about the issue of air traffic management to prioritize productive research areas. Papers about air traffic management are discussed and categorized into two levels: system and airport. The system level of air transport research includes two main topics: air traffic flow management and airspace research. On the airport level, research topics are: airport capacity, airport facility utilization, aircraft operations in the airport terminal manoeuvring area as well as aircraft ground operations research. Potential research interests to focus on in the future are the integration between airspace capacity and airport capacity, the establishment of airport information systems to use airport capacity better, and the improvement in flight schedule planning to improve the reliability of schedule implementation.     

A framework for the assessment of collaborative en route resource allocation strategies

Airspace Flow Programs (AFPs) assign ground delays to flights in order to limit flow through capacity constrained airspace regions. AFPs have been successful in controlling traffic with reasonable delays, but a new program called the Combined Trajectory Options Program, or CTOP, is being explored to further accommodate projected increases in traffic demand. In CTOP, centrally managed rerouting and user preference inputs are also incorporated into initial en route resource allocations. We investigate four alternative versions of resource allocation within CTOP in this research, under differing assumptions about the degree of random variability in airline flight assignment costs when measured against a simple model based upon the flight specific, but otherwise fixed, ratio of airborne flight time and ground delay unit cost. Two en route resource allocation schemes are based on ordered assignments that are similar to those used currently, and the other two are system-optimal assignment schemes. One of these system-optimal schemes is based on complete preference information, which is ideal but not realistic, and the other is based on partial information that may be feasible to implement but yields less efficient assignments. The main contribution of this research is a methodological framework to evaluate and compare these alternative en route resource allocation schemes, under varying assumptions about the information traffic managers have been provided about the flight operators’ route preferences. The framework allows us to evaluate these various schemes under differing assumptions about how well the traffic managers’ flight cost model captures flight costs. A numerical example demonstrates that a sequential resource allocation scheme – where flights are assigned resources in the order in which preference information is submitted – can be more efficient than a scheme that offers a cost minimizing allocation based on less complete preference information, and may at the same time be perceived as equitable. We also find that assigning resources in the order flights are scheduled results in less efficient allocations, but more equitable ones.     

Short‐term highway traffic flow prediction based on a hybrid strategy considering temporal–spatial information

Short‐term traffic flow prediction is fundamental for the intelligent transportation system and is proved to be a challenge. This paper proposed a hybrid strategy that is general and can make use of a large number of underlying machine learning or time‐series prediction models to capture the complex patterns beneath the traffic flow. With the strategy, four different combinations were implemented. To consider the spatial features of traffic phenomenon, several different state vectors including different observations were built. The performance of the proposed strategy was investigated using the traffic flow measurements from the Traffic Operation and Safety Laboratory in Wisconsin, USA. The results show the overall performance of hybrid strategy is better than a single model. Also, incorporating observations from adjacent junctions can improve prediction accuracy. Copyright © 2017 John Wiley & Sons, Ltd.     

Computing 4D near-optimal trajectories for dynamic air traffic flow management with column generation and branch-and-price

Abstract

The current air traffic system faces recurrent saturation problems. Numerous studies are dedicated to this issue, including the present research on a new dynamic regulation filter holding frequent trajectory optimisations in a real-time sliding horizon loop process. We consider a trajectory optimisation problem arising in this context, where a feasible four-dimensional (4D) trajectory is to be built and assigned to each regulated flight to suppress sector overloads while minimising the cost of the chosen policy. We model this problem with a mixed integer linear programme and solve it with a branch-and-price approach. The pricing sub-problem looks for feasible trajectories in a dynamic three-dimensional (3D) network and is solved with a specific algorithm based on shortest path labelling algorithms and on dynamic programming. Each algorithm is tested on real-world data corresponding to a complete traffic day in the European air traffic system; experimental results, including computing times measurement, validate the solution process.     

Bayesian inference for day-to-day dynamic traffic models

There is significant current interest in the development of models to describe the day-to-day evolution of traffic flows over a network. We consider the problem of statistical inference for such models based on daily observations of traffic counts on a subset of network links. Like other inference problems for network-based models, the critical difficulty lies in the underdetermined nature of the linear system of equations that relates link flows to the latent path flows. In particular, Bayesian inference implemented using Markov chain Monte Carlo methods requires that we sample from the set of route flows consistent with the observed link flows, but enumeration of this set is usually computationally infeasible.We show how two existing conditional route flow samplers can be adapted and extended for use with day-to-day dynamic traffic. The first sampler employs an iterative route-by-route acceptance–rejection algorithm for path flows, while the second employs a simple Markov model for traveller behaviour to generate candidate entire route flow patterns when the network has a tree structure. We illustrate the application of these methods for estimation of parameters that describe traveller behaviour based on daily link count data alone.     

A traffic flow simulator for short‐term travel time forecasting

This paper presents an off‐line forecasting system for short‐term travel time forecasting. These forecasts are based on the historical traffic count data provided by detectors installed on Annual Traffic Census (ATC) stations in Hong Kong. A traffic flow simulator (TFS) is developed for short‐term travel time forecasting (in terms of offline forecasting), in which the variation of perceived travel time error and the fluctuations of origin‐destination (O‐D) demand are considered explicitly. On the basis of prior O‐D demand and partial updated detector data, the TFS can estimate the link travel times and flows for the whole network together with their variances and covariances. The short‐term travel time forecasting by O‐D pair can also be assessed and the O‐D matrix can be updated simultaneously. The application of the proposed off‐line forecasting system is illustrated by a numerical example in Hong Kong.     

A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty

In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd.     

Classification modeling approach for vehicle dynamics model‐integrated traffic simulation assessing surrogate safety

To assess safety impacts of untried traffic control strategies, an earlier study developed a vehicle dynamics model‐integrated (i.e., VISSIM‐CarSim‐SSAM) simulation approach and evaluated its performance using surrogate safety measures. Although the study found that the integrated simulation approach was a superior alternative to existing approaches in assessing surrogate safety, the computation time required for the implementation of the integrated simulation approach prevents it from using it in practice. Thus, this study developed and evaluated two types of models that could replace the integrated simulation approach with much faster computation time, feasible for real‐time implementation. The two models are as follows: (i) a statistical model (i.e., logit model) and (ii) a nonparametric approach (i.e., artificial neural network). The logit model and the neural network model were developed and trained on the basis of three simulation data sets obtained from the VISSIM‐CarSim‐SSAM integrated simulation approach, and their performances were compared in terms of the prediction accuracy. These two models were evaluated using six new simulation data sets. The results indicated that the neural network approach showing 97.7% prediction accuracy was superior to the logit model with 85.9% prediction accuracy. In addition, the correlation analysis results between the traffic conflicts obtained from the neural network approach and the actual traffic crash data collected in the field indicated a statistically significant relationship (i.e., 0.68 correlation coefficient) between them. This correlation strength is higher than that of the VISSIM only (i.e., the state of practice) simulation approach. The study results indicated that the neural network approach is not only a time‐efficient way to implementing the VISSIM‐CarSim‐SSAM integrated simulation but also a superior alternative in assessing surrogate safety. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive route choices in risky traffic networks: A prospect theory approach

This paper deals with route choice models capturing travelers’ strategic behavior when adapting to revealed traffic conditions en route in a stochastic network. The strategic adaptive behavior is conceptualized as a routing policy, defined as a decision rule that maps from all possible revealed traffic conditions to the choices of next link out of decision nodes, given information access assumptions. In this paper, we use a specialized example where a variable message sign provides information about congestion status on outgoing links. We view the problem as choice under risk and present a routing policy choice model based on the cumulative prospect theory (CPT), where utility functions are nonlinear in probabilities and thus flexible attitudes toward risk can be captured.In order to illustrate the differences between routing policy and non-adaptive path choice models as well as differences between models based on expected utility (EU) theory and CPT, we estimate models based on synthetic data and compare them in terms of prediction results. There are large differences in path share predictions and the results demonstrate the flexibility of the CPT model to represent varying degrees of risk aversion and risk seeking depending on the outcome probabilities.     

Visco‐elastic traffic flow model

To increase our understanding of the operations of traffic system, a visco‐elastic traffic model was proposed in analogy of non‐Newtonian fluid mechanics. The traffic model is based on mass and momentum conservations, and includes a constitutive relation similar to that of linear visco‐elastic fluids. The further inclusion of the elastic effect allows us to describe a high‐order traffic model more comprehensively because the use of relaxation time indicates that vehicle drivers adjust their time headway in a reasonable and safe range. The self‐organizing behaviour is described by introducing the effects of pressure and visco‐elasticity from the point of view in fluid mechanics. Both the viscosity and elasticity can be determined by using the relaxation time and the traffic sound speed. The sound speed can be approximately represented by the road operational parameters including the free‐flow speed, the jam density, and the density of saturation if the jam pressure in traffic flows is identical to the total pressure at the flow saturation point. A linear stability analysis showed that the traffic flow should be absolutely unstable for disturbances with short spatial wavelengths. There are two critical points of regime transition in traffic flows. The first point happens at the density of saturation, and the second point occurs at a density relating on the sound speed and the fundamental diagram of traffic flows. By using a triangular form flow–density relation, a numerical test based on the new model is carried out for congested traffic flows on a loop road without ramp effect. The numerical results are discussed and compared with the result of theoretical analysis and observation data of traffic flows. Copyright © 2011 John Wiley & Sons, Ltd.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

Lane‐based optimization of traffic equilibrium settings for area traffic control

Area traffic control is an important element in Intelligent Transportation System (ITS). This paper extends the lane‐based optimization method to a traffic equilibrium network, which improves the operational performance of signal‐controlled network. We formulate a decomposition approach to simultaneously optimize the lane markings and signal settings for a signal‐controlled network that comprises two levels of optimization. At the junction level, the lane markings, control sequence, and other aspects of the signal settings are optimized for individual junctions, whereas at the network level, the group‐based signal settings are optimized to take into account the re‐routing characteristics of travelers and signal coordination effects that are based on a TRANSYT traffic model, which is a well‐known procedure for evaluating the performance of signal‐controlled networks. We use a numerical example to demonstrate the effectiveness of the proposed methodology.     

Robust identification of air traffic flow patterns in Metroplex terminal areas under demand uncertainty

Multi-Airport Systems (MAS), or Metroplexes, serve air traffic demand in cities with two or more airports. Due to the spatial proximity and operational interdependency of the airports, Metroplex airspaces are characterized by high complexity, and current system structures fail to provide satisfactory utilization of the available airspace resources. In order to support system-level design and management towards increased operational efficiency in such systems, an accurate depiction of major demand patterns is a prerequisite. This paper proposes a framework for the robust identification of significant air traffic flow patterns in Metroplex systems, which is aligned with the dynamic route service policy for the effective management of Metroplex operations. We first characterize deterministic demand through a spatio-temporal clustering algorithm that takes into account changes in the traffic flows over the planning horizon. Then, in order to handle uncertainties in the demand, a Distributionally Robust Optimization (DRO) approach is proposed, which takes into account demand variations and prediction errors in a robust way to ensure the reliability of the demand identification. The DRO-based approach is applied on pre-tactical (i.e. one-day planning) as well as operational levels (i.e. 2-h rolling horizon). The framework is applied to Time Based Flow Management (TBFM) data from the New York Metroplex. The framework and results are validated by Subject Matter Experts (SMEs).     

ATCEM: a synthetic model for evaluating air traffic complexity

Air traffic complexity, which measures the disorder of air traffic distribution, has become the critical indicator to reflect air traffic controller workload in air traffic management (ATM) system. However, it is hard to assess the system accurately because there are too many correlated factors, which make the air traffic complexity nonlinear. This paper presents an air traffic complexity evaluation model with integrated classification using computational intelligence (ATCEM). To avoid redundant factors, critical factors contributing to complexity are analyzed and selected from numerous factors in the ATCEM. Subsequently, to construct the mapping relationship between selected factors and air traffic complexity, an integrated classifier is built in ATCEM. With efficient training and learning based on aviation domain knowledge, the integrated classifier can effectively and stably reflect the mapping relationship between selected factors and the category of air traffic complexity to ensure the precision of the evaluation. Empirical studies using real data of the southwest airspace of China show that the ATCEM outperforms a number of state‐of‐the‐art models. Moreover, using the critical complexity factors selected in ATCEM, the air traffic complexity could be effectively estimated. Copyright © 2015 John Wiley & Sons, Ltd.