An artificial neural network approach for evaluating transportation network improvements

As demand increases over time, new links or improvements in existing links may be considered for increasing a network's capacity. The selection and timing of improvement projects is an especially challenging problem when the benefits or costs of those projects are interdependent. Most existing models neglect the interdependence of projects and their impacts during intermediate periods of a planning horizon, thus failing to identify the optimal improvement program. A multiperiod network design model is proposed to select the best combination of improvement projects and schedules. This model requires the evaluation of numerous network improvement alternatives in several time periods. To facilitate efficient solution methods for the network design model, an artificial neural network approach is proposed for estimating total travel times corresponding to various project selection and scheduling decisions. Efficient procedures for preparing an appropriate training data set and an artificial neural network for this application are discussed. The Calvert County highway system in southern Maryland is used to illustrate these procedures and the resulting performance.     

Prediction of hourly air pollutant concentrations near urban arterials using artificial neural network approach

This paper applies artificial neural network to predict hourly air pollutant concentrations near an arterial in Guangzhou, China. Factors that influence pollutant concentrations are classified into four categories: traffic-related, background concentration, meteorological and geographical. The hourly averages of these influential factors and concentrations of carbon monoxide, nitrogen dioxide, particular matter and ozone were measured at three selected sites near the arterial using vehicular automatic monitoring equipments. Models based on back-propagation neural network were trained, validated and tested using the collected data. It is demonstrated that the models are able to produce accurate prediction of hourly concentrations of the pollutants respectively more than 10 h in advance. A comparison study shows that the neural network models outperform multiple linear regression models and the California line source dispersion model.     

Hybrid artificial neural network and locally weighted regression models for lane-based short-term urban traffic flow forecasting

ABSTRACT

In recent years, there has been considerable research interest in short-term traffic flow forecasting. However, forecasting models offering a high accuracy at a fine temporal resolution (e.g. 1 or 5?min) and lane level are still rare. In this study, a combination of genetic algorithm, neural network and locally weighted regression is used to achieve optimal prediction under various input and traffic settings. The genetically optimized artificial neural network (GA-ANN) and locally weighted regression (GA-LWR) models are developed and tested, with the former forecasting traffic flow every 5-min within a 30-min period and the latter for forecasting traffic flow of a particular 5-min period of each for four lanes of an urban arterial road in Beijing, China. In particular, for morning peak and off-peak traffic flow prediction, the GA-ANN 5-min traffic flow model results in average errors of 3–5% and most 95th percentile errors of 7–14% for each of the four lanes; for the peak and off-peak time traffic flow predictions, the GA-LWR 5-min traffic flow model results in average errors of 2–4% and most 95th percentile errors are lower than 10% for each of the four lanes. When compared to previous models that usually offer average errors greater than 6–15%, such empirical findings should be of interest to and instrumental for transportation authorities to incorporate in their city- or state-wide Advanced Traveller Information Systems (ATIS).     

基于遗传算法的BP神经网络短时交通流预测

对BP神经网络模型、方法及遗传算法的基本原理进行了分析,将遗传算法与标准BP神经网络算法相结合构建了基于遗传算法的神经网络算法;建立了基于BP神经网络的短时交通流预测模型,对BP神经网络算法及基于遗传算法的BP神经网络算法进行设计,并将其应用于短时交通流预测模型的仿真计算,仿真结果表明基于遗传算法的BP神经网络算法具有更快的计算速度及更好的适应能力,该方法可以较好地应用于短时交通流预测。     

Traffic volume forecasting based on radial basis function neural network with the consideration of traffic flows at the adjacent intersections

The forecasting of short-term traffic flow is one of the key issues in the field of dynamic traffic control and management. Because of the uncertainty and nonlinearity, short-term traffic flow forecasting could be a challenging task. Artificial Neural Network (ANN) could be a good solution to this issue as it is possible to obtain a higher forecasting accuracy within relatively short time through this tool. Traditional methods for traffic flow forecasting generally based on a separated single point. However, it is found that traffic flows from adjacent intersections show a similar trend. It indicates that the vehicle accumulation and dissipation influence the traffic volumes of the adjacent intersections. This paper presents a novel method, which considers the travel flows of the adjacent intersections when forecasting the one of the middle. Computational experiments show that the proposed model is both effective and practical.     

Evaluating marginal improvements to a transport network: An application to the Santiago underground

This paper describes a simplified methodology designed for quick investment appraisal of improvements to a transport network, and discusses its limitations and advantages particularly in the context of a developing country. The approach basically considers:

- a method to define the total population (relevant origin-destination pairs) affected by the project

- the selection of a low-cost background model to represent transport demand on a network at an aggregate level

- the choice of a suitable marginal demand model (in this case a discrete mode choice model) capable of providing the required sensitivity and accuracy to model the project

- the estimation of the marginal demand due to the project during all the years of the study horizon, and

- a sensitivity analysis to assess the robustness of the decision recommended using these two models.

Finally, the paper summarises the results of applying the methodology to the case of an extension to the Santiago underground; it was found that the project has a high social rate of return (almost 20 per cent). However, from the point of view of a private evaluation, it can cover its operating costs only.     

Simulating the household plug-in hybrid electric vehicle distribution and its electric distribution network impacts

This paper presents a multi agent-based simulation framework for modeling spatial distribution of plug-in hybrid electric vehicle ownership at local residential level, discovering “plug-in hybrid electric vehicle hot zones” where ownership may quickly increase in the near future, and estimating the impacts of the increasing plug-in hybrid electric vehicle ownership on the local electric distribution network with different charging strategies. We use Knox County, Tennessee as a case study to highlight the simulation results of the agent-based simulation framework.     

Estimation of AADT from short period counts in hong kong — A comparison between neural network method and regression analysis

The average annual daily traffic (AADT) volumes can be estimated by using a short period count of less than twenty‐four hour duration. In this paper, the neural network method is adopted for the estimation of AADT from short period counts and for the determination of the most appropriate length of counts. A case study is carried out by analysing data at thirteen locations on trunk roads and primary roads in urban area of Hong Kong. The estimation accuracy is also compared with the one obtained by regression analysis approach. The results show that the neural network approach consistently performed better than the regression analysis approach.     

A practical method to estimate the benefits of improved road network reliability: an application to departing air passengers

This paper develops and applies a practical method to estimate the benefits of improved reliability of road networks. We present a general methodology to estimate the scheduling costs due to travel time variability for car travel. In contrast to existing practical methods, we explicitly consider the effect of travel time variability on departure time choices. We focus on situations when only mean delays are known, which is typically the case when standard transport models are used. We first show how travel time variability can be predicted from mean delays. We then estimate the scheduling costs of travellers, taking into account their optimal departure time choice given the estimated travel time variability. We illustrate the methodology for air passengers traveling by car to Amsterdam Schiphol Airport. We find that on average planned improvements in network reliability only lead to a small reduction in access costs per trip in absolute terms, mainly because most air passengers drive to the airport outside peak hours, when travel time variability tends to be low. However, in relative terms the reduction in access costs due to the improvements in network reliability is substantial. In our case we find that for every 1 Euro reduction in travel time costs, there is an additional cost reduction of 0.7 Euro due to lower travel time variability, and hence lower scheduling costs. Ignoring the benefits from improved reliability may therefore lead to a severe underestimation of the total benefits of infrastructure improvements.     

An algorithm for the combined distribution and assignment problem

Much interest has recently been shown in the combination of the distribution and assignment models. In this paper we adopt a generalized Benders' decomposition to solve this combined problem for a system optimized assignment with linear link costs and explicit capacity constraints on link flows. The master problem which is generated is used to show that the combined problem can be viewed as a modified distribution problem, of gravity form, with a minimax instead of a linear objective function. An algorithm for solving the master problem is discussed, and some computational results presented.     

A method to assess demand growth vulnerability of travel times on road network links

Many national governments around the world have turned their recent focus to monitoring the actual reliability of their road networks. In parallel there have been major research efforts aimed at developing modelling approaches for predicting the potential vulnerability of such networks, and in forecasting the future impact of any mitigating actions. In practice—whether monitoring the past or planning for the future—a confounding factor may arise, namely the potential for systematic growth in demand over a period of years. As this growth occurs the networks will operate in a regime closer to capacity, in which they are more sensitive to any variation in flow or capacity. Such growth will be partially an explanation for trends observed in historic data, and it will have an impact in forecasting too, where we can interpret this as implying that the networks are vulnerable to demand growth. This fact is not reflected in current vulnerability methods which focus almost exclusively on vulnerability to loss in capacity. In the paper, a simple, moment-based method is developed to separate out this effect of demand growth on the distribution of travel times on a network link, the aim being to develop a simple, tractable, analytic method for medium-term planning applications. Thus the impact of demand growth on the mean, variance and skewness in travel times may be isolated. For given critical changes in these summary measures, we are thus able to identify what (location-specific) level of demand growth would cause these critical values to be exceeded, and this level is referred to as Demand Growth Reliability Vulnerability (DGRV). Computing the DGRV index for each link of a network also allows the planner to identify the most vulnerable locations, in terms of their ability to accommodate growth in demand. Numerical examples are used to illustrate the principles and computation of the DGRV measure.     

An analysis of the Spanish high capacity road network criticality

The analysis of complex networks has been carried out in different fields using an ample variety of method and concepts. Recently, in the general literature of regional economics, the concepts of resilience, connectivity, vulnerability and criticality have been gaining their momentum. The aim of this paper is to provide an analytical framework, using well-known accessibility indicators, in order to calculate the critical links or road sections of the Spanish high-capacity road network. Our analysis will be based on approximately four hundred sections that will be classified in five different groups according to their criticality degree in the whole network. Our analysis will be complemented with the comparison of the results obtained in five different scenarios, namely the average criticality using the effects on the whole country, Madrid, Barcelona, Valencia and Pontevedra. Furthermore, the paper will also analyze what kind of intrinsic characteristics of the sections favor or not the links’ criticality using a method based on a classification and regression tree. This analysis is crucial to understand other important concepts that are recently being studied in network and spatial economics, like, for example, resilience and vulnerability. It is concluded that the number of relations or routes, being a trunk or not, the road density and the time to Madrid capital play an important role in the criticality of the roads section in the high capacity road network.     

An individual information system for visualizing the bus and subway network

The system described in this paper allows the user to visualize the Montreal transportation system. The user is provided with several different maps.

The complete subway network and all regular bus lines have been included. The subway network and the bus lines can be selectively displayed. The most attractive feature of this system is the possibility of obtaining all possible routes between two different places. The input is based on the menu technique.

The system can be easily adapted to other large urban transportation systems.     

An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks

As intelligent transportation systems (ITS) approach the realm of widespread deployment, there is an increasing need to robustly capture the variability of link travel time in real-time to generate reliable predictions of real-time traffic conditions. This study proposes an adaptive information fusion model to predict the short-term link travel time distribution by iteratively combining past information on link travel time on the current day with the real-time link travel time information available at discrete time points. The past link travel time information is represented as a discrete distribution. The real-time link travel time is represented as a range, and is characterized using information quality in terms of information accuracy and time delay. A nonlinear programming formulation is used to specify the adaptive information fusion model to update the short-term link travel time distribution by focusing on information quality. The model adapts good information by weighing it higher while shielding the effects of bad information by reducing its weight. Numerical experiments suggest that the proposed model adequately represents the short-term link travel time distribution in terms of accuracy and robustness, while ensuring consistency with ambient traffic flow conditions. Further, they illustrate that the mean of a representative short-term travel time distribution is not necessarily a good tracking indicator of the actual (ground truth) time-dependent travel time on that link. Parametric sensitivity analysis illustrates that information accuracy significantly influences the model, and dominates the effects of time delay and the consistency constraint parameter. The proposed information fusion model bridges key methodological gaps in the ITS deployment context related to information fusion and the need for short-term travel time distributions.     

An application of the CUSUM algorithm to freeway incident detection based on two contiguous detectors

The CUSUM (cumulative sum of log‐likelihood ratio) algorithm is a detection algorithm that shows potential for the improvement of incident detection algorithms because it is designed to minimize the mean detect delay for a given false alarm constraint and it can also detect changes with different patterns. In this study, the CUSUM algorithm was applied to freeway incident detection by integrating traffic measurements from two contiguous loop detectors and the non‐stationarity of traffic flows. The developed algorithm was tested based on incident data from the PATH program, with consideration given to the impact of different geometric conditions on algorithm performance. It was also compared with two existing algorithms, in order to address the influence of traffic patterns. The evaluation results show that the CUSUM incident detection algorithm can perform equally well in comparison with the selected algorithms.     

基于模糊BP网络的隧道施工方法选择研究

文章在传统BP网络的基础上,根据围岩级别与隧道施工方法之间的模糊对应关系,建立了围岩分级和施工方法的模糊BP网络模型.该网络对检验样本施工方法的检验结果与期望值比较吻合.对实例的预测结果表明,网络能够实现对施工方法的正确选择,不会引起判断错误,可以用来作为隧道施工方法选择的决策依据,并在工程实践中推广应用.     

Clockwise hysteresis loops in the Macroscopic Fundamental Diagram: An effect of network instability

A recent study reported that the Macroscopic Fundamental Diagram of a medium size city exhibited a clockwise hysteresis loop on a day in which a major disturbance caused many drivers to use unfamiliar routes. It is shown below that, even in a perfectly symmetric network with uniform demand, clockwise loops are to be expected when there are disturbances, especially if the disturbances cause a significant fraction of the drivers to not change routes adaptively. It is also shown that when drivers are not adaptive networks are inherently more unstable as they recover from congestion than as they are loaded. In other words, during recovery congestion tends more strongly toward unevenness because very congested areas clear more slowly than less congested areas. Since it is known that uneven congestion distributions reduce network flows, it follows that lower network flows should arise during recovery, resulting in clockwise loops. Fortunately, the presence of a sufficient number of drivers that choose routes adaptively to avoid congested areas helps to even out congestion during recovery, increasing flow. Thus, clockwise loops are less likely to occur when driver adaptivity is high.     

The structure of the solution set to network optimisation problems

This paper argues that both heuristic and non-heuristic algorithms for the road network optimisation problem would benefit from a greater understanding of the structure of the set of feasible solutions to such problems. In order to provide this, a comparative study of a number of spatial combinatorial problems was undertaken. The results show that the road network optimisation problem is rich in good sub-optimal solutions. The implications of this finding for the development of optimising and heuristic algorithms are discussed, and some suggestions made as to where future research on network optimisation problems could most fruitfully be directed.