Modeling the day-to-day traffic evolution process after an unexpected network disruption

Although various approaches have been proposed for modeling day-to-day traffic flow evolution, none of them, to the best of our knowledge, have been validated for disrupted networks due to the lack of empirical observations. By carefully studying the driving behavioral changes after the collapse of I-35W Mississippi River Bridge in Minneapolis, Minnesota, we found that most of the existing day-to-day traffic assignment models would not be suitable for modeling the traffic evolution under network disruption, because they assume that drivers’ travel cost perception depends solely on their experiences from previous days. When a significant network change occurs unexpectedly, travelers’ past experience on a traffic network may not be entirely useful because the unexpected network change could disturb the traffic greatly. To remedy this, in this paper, we propose a prediction-correction model to describe the traffic equilibration process. A “predicted” flow pattern is constructed inside the model to accommodate the imperfect perception of congestion that is gradually corrected by actual travel experiences. We also prove rigorously that, under mild assumptions, the proposed prediction-correction process has the user equilibrium flow as a globally attractive point. The proposed model is calibrated and validated with the field data collected after the collapse of I-35W Bridge. This study bridges the gap between theoretical modeling and practical applications of day-to-day traffic equilibration approaches and furthers the understanding of traffic equilibration process after network disruption.     

Modelling daily activity program generation considering within-day and day-to-day dynamics in activity-travel behaviour

This paper presents a comprehensive econometric modelling framework for daily activity program generation. It is for day-specific activity program generations of a week-long time span. Activity types considered are 15 generic categories of non-skeletal and flexible activities. Under the daily time budget and non-negativity of participation rate constraints, the models predict optimal sets of frequencies of the activities under consideration (given the average duration of each activity type). The daily time budget considers at-home basic needs and night sleep activities together as a composite activity. The concept of composite activity ensures the dynamics and continuity of time allocation and activity/travel behaviour by encapsulating altogether the activity types that are not of our direct interest in travel demand modelling. Workers’ total working hours (skeletal activity and not a part of the non-skeletal activity time budget) are considered as a variable in the models to accommodate the scheduling effects inside the generation model of non-skeletal activities. Incorporation of previous day’s total executed activities as variables introduces day-to-day dynamics into the activity program generation models. The possibility of zero frequency of any specific activity under consideration is ensured by the Kuhn-Tucker optimality conditions used for formulating the model structure. Models use the concept of random utility maximization approach to derive activity program set. Estimations of the empirical models are done using the 2002–2003 CHASE survey data set collected in Toronto.

A multi-commodity flow network design problem

There exist systems which can be usefully described by a network containingarcs through which a commodity of one type flows. This paper is concerned with finding a solution procedure for a particular multi-commodity flow network design problem. The problem is to identify a set of arcs in the network such that if travel is prohibited in them all flow travels by feasible paths and its total cost is minimal. The total flow in each arc may not exced its capacity, which is a known constant. Each arc and each node of the network has a non-negative constant unit traversal cost. Between each pair of distinct nodes there is a given non-negative rate of flow from the first vertex to the second which may be split up among a number of paths according to some constant traversal cost flow assignment process. The optimality criterion is the total traversal cost of all flow, which is to be minimized. Previous work on network design problems of this type is surveyed. The principal contribution of this paper is the presentation of a solution procedure for the above problem based on branch and bound enumeration. An illustrative numerical example is included. Computational experience gained in using the procedure with a FORTRAN IV program on an IBM 370 is favourable.     

On a link-based day-to-day traffic assignment model

In this paper, we perform a rigorous analysis on a link-based day-to-day traffic assignment model recently proposed in He et al. (2010). Several properties, including the invariance set and the constrained stability, of this dynamical process are established. An extension of the model to the asymmetric case is investigated and the stability result is also established under slightly more restrictive assumptions. Numerical experiments are conducted to demonstrate the findings.     

On the kinematics and quantum dynamics of traffic flow

The hydrodynamic model of traffic flow is presented and interpreted. Traffic dimensions are defined for the dynamic entities of flow and the behaviour of congestive and dispersive flow is discussed dependent on the value of the local traffic transfer number, R. The wave equation is one example of dispersive flow, where quantum numbers define the condition of free flow at the endpoints of the link. The Schrödinger equation is defined and applied to the study of the cyclic work journey and the problem of traffic lights as an harmonic oscillator.     

A traffic flow simulator for network reliability assessment

This paper investigates the transportation network reliability based on the information provided by detectors installed on some links. A traffic flow simulator (TFS) model is formulated for assessing the network reliability (in terms of travel time reliability), in which the variation of perceived travel time error and the fluctuations of origin-destination (OD) demand are explicitly considered. On the basis of prior OD demand and partial updated detector data, the TFS can estimate the link flows for the whole network together with link/path travel times, and their variance and covariance. The travel time reliability by OD pair can also be assessed and the OD matrix can be updated simultaneously. A Monte Carlo based algorithm is developed to solve the TFS model. The application of the proposed TFS model is illustrated by a numerical example.     

A bilevel flow model for hazmat transportation network design

In this work we consider the following hazmat transportation network design problem. A given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from specific origin points to specific destination points, and we assume there are regional and local government authorities that want to regulate the hazmat transportations by imposing restrictions on the amount of hazmat traffic over the network links. In particular, the regional authority aims to minimize the total transport risk induced over the entire region in which the transportation network is embedded, while local authorities want the risk over their local jurisdictions to be the lowest possible, forcing the regional authority to assure also risk equity. We provide a linear bilevel programming formulation for this hazmat transportation network design problem that takes into account both total risk minimization and risk equity. We transform the bilevel model into a single-level mixed integer linear program by replacing the second level (follower) problem by its KKT conditions and by linearizing the complementary constraints, and then we solve the MIP problem with a commercial optimization solver. The optimal solution may not be stable, and we provide an approach for testing its stability and for evaluating the range of its solution values when it is not stable. Moreover, since the bilevel model is difficult to be solved optimally and its optimal solution may not be stable, we provide a heuristic algorithm for the bilevel model able to always find a stable solution. The proposed bilevel model and heuristic algorithm are experimented on real scenarios of an Italian regional network.     

Eco-system optimal time-dependent flow assignment in a congested network

This research addresses the eco-system optimal dynamic traffic assignment (ESODTA) problem which aims to find system optimal eco-routing or green routing flows that minimize total vehicular emission in a congested network. We propose a generic agent-based ESODTA model and a simplified queueing model (SQM) that is able to clearly distinguish vehicles’ speed in free-flow and congested conditions for multi-scale emission analysis, and facilitates analyzing the relationship between link emission and delay. Based on the SQM, an expanded space-time network is constructed to formulate the ESODTA with constant bottleneck discharge capacities. The resulting integer linear model of the ESODTA is solved by a Lagrangian relaxation-based algorithm. For the simulation-based ESODTA, we present the column-generation-based heuristic, which requires link and path marginal emissions in the embedded time-dependent least-cost path algorithm and the gradient-projection-based descent direction method. We derive a formula of marginal emission which encompasses the marginal travel time as a special case, and develop an algorithm for evaluating path marginal emissions in a congested network. Numerical experiments are conducted to demonstrate that the proposed algorithm is able to effectively obtain coordinated route flows that minimize the system-wide vehicular emission for large-scale networks.     

An examination of the determinants of day-to-day variability in individuals' urban travel behavior

Day-to-day variability in individuals' travel behavior (intrapersonal variability) has been recognized in conceptual discussions, yet the analysis and modeling of urban travel are typically based on a single day record of each individual's travel. This paper develops and examines hypotheses regarding the determinants of intrapersonal variability in urban travel behavior.Two general hypotheses are formulated to describe the effects of motivations for travel and related behavior and of travel and related constraints on intrapersonal variability in weekday urban travel behavior. Specific hypotheses concerning the effect of various sociodemographic characteristics on intrapersonal variability are derived from these general hypotheses. These specific hypotheses are tested empirically in the context of daily trip frequency using a five-day record of travel in Reading, England.The empirical result support the two general hypotheses. First, individuals who have fewer economic and role-related constraints have higher levels of intrapersonal variability in their daily trip frequency. Second, individuals who fulfil personal and household needs that do not require daily participation in out-of-home activities have higher levels of intrapersonal variability in their daily trip frequency.     

Multi-commodity traffic assignment by continuum approximation of network flow with variable demand

Consider a city with several highly compact central business districts (CBD), and the commuters’ destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out each other as in conventional fluid flow problems albeit travelling in different directions, the traffic flows from a CBD to the destinations over the city are considered as one commodity. The interaction of the traffic flows among different commodities is governed by a cost–flow relationship. The case of variable demand is considered. The primal formulation of the continuum equilibrium model is given and proved to satisfy the user optimal conditions, and the dual formulation of the problem and its complementary conditions are also discussed. A finite element method is then employed to solve the continuum problem. A numerical example is given to illustrate the effectiveness of the proposed method.     

A marginal utility day-to-day traffic evolution model based on one-step strategic thinking

Most deterministic day-to-day traffic evolution models, either in continuous-time or discrete-time space, have been formulated based on a fundamental assumption on driver route choice rationality where a driver seeks to maximize her/his marginal benefit defined as the difference between the perceived route costs. The notion of rationality entails the exploration of the marginal decision rule from economic theory, which states that a rational individual evaluates his/her marginal utility, defined as the difference between the marginal benefit and the marginal cost, of each incremental decision. Seeking to analyze the marginal decision rule in the modeling of deterministic day-to-day traffic evolution, this paper proposes a modeling framework which introduces a term to capture the marginal cost to the driver induced by route switching. The proposed framework enables to capture both benefit and cost associated with route changes. The marginal cost is then formulated upon the assumption that drivers are able to predict other drivers’ responses to the current traffic conditions, which is adopted based on the notion of strategic thinking of rational players developed in behavior game theory. The marginal cost based on 1-step strategic thinking also describes the “shadow price” of shifting routes, which helps to explain the behavioral tendency of the driver perceiving the cost-sensitivity to link/route flows. After developing a formulation of the marginal utility day-to-day model, its theoretical properties are analyzed, including the invariance property, asymptotic stability, and relationship with the rational behavioral adjustment process.     

Testing and evaluation of a multi-commodity multi-modal network flow model for disaster relief management

The results of the testing of an optimization model in disaster relief management are presented. The problem is a large-scale multi-commodity, multi-modal network flow problem with time windows. Due to the nature of this problem, the size of the optimization model grows extremely rapidly as the number of modes and/or commodities increase. The formulation is based on the concept of a time-space network. Two heuristic algorithms are developed. One exploits an inherent network structure of the problem with a set of side constraints and the other is an interactive fix-and-run heuristic. The findings of the model-testing and a wide range of sensitivity analyses using an artificially generated data set are presented. Both solution procedures prove to be efficient and effective in providing close to optimal solutions.     

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

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

Origin-destination trip table estimation based on subarea network OD flow and vehicle trajectory data

Identifying accurate origin-destination (O-D) travel demand is one of the most important and challenging tasks in the transportation planning field. Recently, a wide range of traffic data has been made available. This paper proposes an O-D estimation model using multiple field data. This study takes advantage of emerging technologies – car navigation systems, highway toll collecting systems and link traffic counts – to determine O-D demand. The proposed method is unique since these multiple data are combined to improve the accuracy of O-D estimation for an entire network. We tested our model on a sample network and found great potential for using multiple data as a means of O-D estimation. The errors of a single input data source do not critically affect the model’s overall accuracy, meaning that combining multiple data provides resilience to these errors. It is suggested that the model is a feasible means for more reliable O-D estimation.     

A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand

Transportation networks are often subjected to perturbed conditions leading to traffic disequilibrium. Under such conditions, the traffic evolution is typically modeled as a dynamical system that captures the aggregated effect of paths-shifts by drivers over time. This paper proposes a day-to-day (DTD) dynamical model that bridges two important gaps in the literature. First, existing DTD models generally consider current path flows and costs, but do not factor the sensitivity of path costs to flow. The proposed DTD model simultaneously captures all three factors in modeling the flow shift by drivers. As a driver can potentially perceive the sensitivity of path costs with the congestion level based on past experience, incorporating this factor can enhance real-world consistency. In addition, it smoothens the time trajectory of path flows, a desirable property for practice where the iterative solution procedure is typically terminated at an arbitrary point due to computational time constraints. Second, the study provides a criterion to classify paths for an origin–destination pair into two subsets under traffic disequilibrium: expensive paths and attractive paths. This facilitates flow shifts from the set of expensive paths to the set of attractive paths, enabling a higher degree of freedom in modeling flow shift compared to that of shifting flows only to the shortest path, which is behaviorally restrictive. In addition, consistent with the real-world driver behavior, it also helps to preclude flow shifts among expensive paths. Improved behavioral consistency can lead to more meaningful path/link time-dependent flow profiles for developing effective dynamic traffic management strategies for practice. The proposed DTD model is formulated as the dynamical system by drawing insights from micro-economic theory. The stability of the model and existence of its stationary point are theoretically proven. Results from computational experiments validate its modeling properties and illustrate its benefits relative to existing DTD dynamical models.     

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).     

车身物理实验对车身尺寸控制的重要性

随着汽车产业的发展竞争也越来越激烈,汽车产品需要不断的提高其外观质量要求,以吸引消费者的第一感觉,且良好的外观尺寸保证有助于提升整车的表面完整性,降低汽车的风阻和风噪,有利于整车油耗降低和舒适性提升。然而白车身在油漆过程以及完成后装配总装零件,总装零件的重量以及压缩力(气弹簧、密封条)会对开启件与白车身的相对位置发生偏移,而且现在汽车内饰为了增加隔音效果,重量也在不断增加;同时为提高开启件的声音品质,密封条的断面设计也越来越复杂,势必对开启件的尺寸控制增加难度。本文通过物理实验的方法对两类典型的开启件变形进行分析和研究。     

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.     

Evaluation of an existing bus network using a transit network optimisation model: a case study of the Hiroshima City Bus network

This study evaluates an existing bus network from the perspectives of passengers, operators, and overall system efficiency using the output of a previously developed transportation network optimisation model. This model is formulated as a bi-level optimisation problem with a transit assignment model as the lower problem. The upper problem is also formulated as bi-level optimisation problem to minimise costs for both passengers and operators, making it possible to evaluate the effects of reducing operator cost against passenger cost. A case study based on demand data for Hiroshima City confirms that the current bus network is close to the Pareto front, if the total costs to both passengers and operators are adopted as objective functions. However, the sensitivity analysis with regard to the OD pattern fluctuation indicates that passenger and operator costs in the current network are not always close to the Pareto front. Finally, the results suggests that, regardless of OD pattern fluctuation, reducing operator costs will increase passenger cost and increase inequity in service levels among passengers.