An integrated framework for embedding large-scale dynamic traffic assignment models in advanced traveler information systems

In recent years, increasing attention has been drawn to the development of various applications of intelligent transportation systems (ITS), which are credited with the amelioration of traffic conditions in urban and regional environments. Advanced traveler information systems (ATIS) constitute an important element of ITS by providing potential travelers with information on the network's current performance both en-route and pre-trip. In order to tackle the complexity of such systems, derived from the difficulty of providing real-time estimations of current as well as forecasts of future traffic conditions, a series of models and algorithms have been initiated. This paper proposes the development of an integrated framework for real-time ATIS and presents its application on a large-scale network, that of Thessaloniki, Greece, concluding with a discussion on development and implementation challenges as well as on the advantages and limitations of such an effort.     

A combined activity/travel choice model for congested road networks with queues

This paper presents a combined activity/travel choice model and proposes a flow-swapping method for obtaining the model's dynamic user equilibrium solution on congested road network with queues. The activities of individuals are characterized by given temporal utility profiles. Three typical activities, which can be observed in morning peak period, namely at-home activity, non-work activity on the way from home to workplace and work-purpose activity, will be considered in the model. The former two activities always occur together with the third obligatory activity. These three activities constitute typical activity/travel patterns in time-space dimension. At the equilibrium, each combined activity/travel pattern, in terms of chosen location/route/departure time, should have identical generalized disutility (or utility) experienced actually. This equilibrium can be expressed as a discrete-time, finite-dimensional variational inequality formulation and then converted to an equivalent "zero-extreme value" minimization problem. An algorithm, which iteratively adjusts the non-work activity location, corresponding route and departure time choices to reach an extreme point of the minimization problem, is proposed. A numerical example with a capacity constrained network is used to illustrate the performance of the proposed model and solution algorithm.     

A conflict model and interactive simulator (FASTCARS) for predicting enroute driver behavior in response to real-time traffic condition information

This paper proposes a theoretical methodology and practical data collection approach for modeling enroute driver behavioral choice under Advanced Traveler Information Systems (ATIS). The theoretical framework is based on conflict assessment and resolution theories popularized in psychology and applied to models of individual consumer behavior. It is posed that enroute assessment and adjustment is a reactionary process influenced by increased conflict arousal and motivation to change. When conflict rises to a level at which conflict exceeds a personal threshold of tolerance, drivers are likely to alter enroute behavior to alleviate conflict through either route diversion of goal revision. Assessment and response to conflict arousal directly relate to the driver's abilities to perceive and predict network conditions in conjunction with familiarity of network configurations and accessible alternate routes.Data collection is accomplished through FASTCARS (Freeway andArterialStreetTrafficConflictArousal andResolutionSimulator), in interactive microcomputer-based driving simulator. Limited real-world implementation of ATIS has made it difficult to study or predict individual driver reaction to these technologies. It is contended here that in-laboratory experimentation with interactive route choice simulators can substitute for the lack of real-world applications and provide an alternate approach to data collection and driver behavior analysis. This paper will explain how FASTCARS is useful for collecting data and testing theories of driver behavior.     

Evaluating the benefits of a combined route guidance and road pricing system in a traffic network with recurrent congestion

When drivers do not have complete information on road travel time and thus choose their routes in a stochastic manner or based on their previous experience, separate implementations of either route guidance or road pricing cannot drive a stochastic network flow pattern towards a system optimum in a Wardropian sense. It is thus of interest to consider a combined route guidance and road pricing system. A road guidance system could reduce drivers' uncertainty of travel time through provision of traffic information. A driver who is equipped with a guidance system could be assumed to receive complete information, and hence be able to find the minimum travel time routes in a user-optimal manner, while marginal-cost road pricing could drive a user-optimal flow pattern toward a system optimum. Therefore, a joint implementation of route guidance and road pricing in a network with recurrent congestion could drive a stochastic network flow pattern towards a system optimum, and thus achieve a higher reduction in system travel time. In this paper the interaction between route guidance and road pricing is modeled and the potential benefit of their joint implementation is evaluated based on a mixed equilibrium traffic assignment model. The private and system benefits under marginal-cost pricing and varied levels of market penetration of the information systems are investigated with a small and a large example. It is concluded that the two technologies complement each other and that their joint implementation can reduce travel time more efficiently in a network with recurrent congestion.     

An agent-based approach to modelling driver route choice behaviour under the influence of real-time information

This paper presents an agent-based approach to modelling individual driver behaviour under the influence of real-time traffic information. The driver behaviour models developed in this study are based on a behavioural survey of drivers which was conducted on a congested commuting corridor in Brisbane, Australia. Commuters’ responses to travel information were analysed and a number of discrete choice models were developed to determine the factors influencing drivers’ behaviour and their propensity to change route and adjust travel patterns. Based on the results obtained from the behavioural survey, the agent behaviour parameters which define driver characteristics, knowledge and preferences were identified and their values determined. A case study implementing a simple agent-based route choice decision model within a microscopic traffic simulation tool is also presented. Driver-vehicle units (DVUs) were modelled as autonomous software components that can each be assigned a set of goals to achieve and a database of knowledge comprising certain beliefs, intentions and preferences concerning the driving task. Each DVU provided route choice decision-making capabilities, based on perception of its environment, that were similar to the described intentions of the driver it represented. The case study clearly demonstrated the feasibility of the approach and the potential to develop more complex driver behavioural dynamics based on the belief–desire–intention agent architecture.     

A solution algorithm for a dynamic deterministic user equilibrium assignment model with departure time choice

Abstract

A route-based combined model of dynamic deterministic route and departure time choice and a solution method for many origin and destination pairs is proposed. The divided linear travel time model is used to calculate the link travel time and to describe the propagation of flow over time. For the calculation of route travel times, the predictive ideal route travel time concept is adopted. Solving the combined model of dynamic deterministic route and departure time choice is shown to be equivalent to solving simultaneously a system of non-linear equations. A Newton-type iterative scheme is proposed to solve this problem. The performance of the proposed solution method is demonstrated using a version of the Sioux Falls network. This shows that the proposed solution method produces good equilibrium solutions with reasonable computational cost.     

The influence of route guidance advice on route choice in urban networks

The paper begins by reviewing what is known about route choice processes and notes the mismatch between this knowledge and the route choice assumptions embedded in the most widely used assignment models. Empirical evidence on the influence of route guidance advice on route choice is reviewed and, despite its limited nature, is seen to suggest that users are reluctant to follow advice unless they find it convincing and that, the more familiar they are with the network, the less likely they are to accept advice. Typically only a small minority of journeys are made in total compliance with advice.Results from an interactive route choice simulator (IGOR) are summarised and are seen to reveal that compliance depends on the extent to which the advice is corroborated by other factors, on the drivers' familiarity with the network and on the quality of advice previously received. It is noted that the IGOR results are in a form which would enable response models to be calibrated.Recent approaches to the modelling of route choice in the context of guidance are discussed. Some are seen to make simplifying assumptions which must limit the relevance of their results; most make no allowance for the fact that drivers are unlikely to comply with all advice and several are not able to represent the benefits which guidance might bring in the context of sporadic congestion or incidents.As an alternative, a two phase model comprising a medium term strategic equilibrium and a day-specific simulation with explicit representation of driver response is proposed.Updated and extended from an earlier version published in theProceedings of the Japan Society of Civil Engineers (JSCE No 425/IV-4, 1991-1).     

A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

Effectiveness of en route traffic information in developing countries using conventional discrete choice and neural‐network models

Providing commuters with traffic information or advising them of alternative routes during traffic incidents can alleviate congestion. For decades, advanced traveler information services (ATIS) have been devised and dedicated to this role. ATIS comprises a wide variety of technologies across the world, including radio traffic information (RTI) advisory service. RTI is common in both developed and developing countries. Although extensive literature and evaluation results of ATISs and RTI are available in developed countries, little attention has been devoted to that in developing countries. This work provides a modeling platform to study drivers' response to en route traffic information provided by Radio‐Payam broadcasting service in Tehran, the capital city of the developing country of Iran. The results are compared with counterpart cases in developed countries. Past studies and this study have employed conventional discrete models for drivers' response, such as ordered logit and ordered probit. This work evaluates the accuracy level of these conventional models in comparison with a developed neural‐network (NN) model, because it has been widely proven that NN models are highly precise. It has also been found that, apart from reliability, the conventional models are within an acceptable level of prediction accuracy compared with the NN models. The results show a high degree of similarities between the case of Tehran and its counterparts in the developing countries. The results also deliver some insights on how to improve or better implement the ATIS technologies. Copyright © 2012 John Wiley & Sons, Ltd.     

Surrogate‐based optimization of cordon toll levels in congested traffic networks

The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd.     

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.     

Multi-scenario optimization approach for assessing the impacts of advanced traffic information under realistic stochastic capacity distributions

In this study, to incorporate realistic discrete stochastic capacity distribution over a large number of sampling days or scenarios (say 30–100 days), we propose a multi-scenario based optimization model with different types of traveler knowledge in an advanced traveler information provision environment. The proposed method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions (and related reliability measure) across a large number of different sampling days. Using a gap function framework or describing the mixed user equilibrium under different information availability over a long-term steady state, a nonlinear programming model is formulated to describe the route choice behavior of the perfect information (PI) and expected travel time (ETT) user classes under stochastic day-dependent travel time. Driven by a computationally efficient algorithm suitable for large-scale networks, the model was implemented in a standard optimization solver and an open-source simulation package and further applied to medium-scale networks to examine the effectiveness of dynamic traveler information under realistic stochastic capacity conditions.     

Network operation reliability in a Manhattan-like urban system with adaptive traffic lights

Traffic breakdown to global gridlock occurring in congested traffic network makes the serious traffic congestion even much worse. This paper has proposed to use Network Operation Reliability (NOR) to quantitatively depict the probabilistic feature of traffic breakdown to global gridlock. The Nagel–Schreckenberg cellular automaton model has been used to simulate the traffic flow in a Manhattan-like urban network. A simple adaptive traffic light strategy has been proposed. It has been shown that if vehicles choose to use geometric shortest path, the adaptive traffic signals are able to remarkably enhance the NOR and sometimes the average velocity and the arrival rate as well. The vehicle distribution has been investigated, which has heuristically explained the enhancement of the NOR. A simple perimeter control strategy has been shown to fail to enhance the NOR. Finally, we show that if the time shortest path information could be provided and updated timely, then the NOR can be remarkably enhanced but the adaptive traffic signals have only trivial effect on NOR.     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

Time-dependent congestion pricing system for large networks: Integrating departure time choice,dynamic traffic assignment and regional travel surveys in the Greater Toronto Area

Congestion pricing is one of the widely contemplated methods to manage traffic congestion. The purpose of congestion pricing is to manage traffic demand generation and supply allocation by charging fees (i.e., tolling) for the use of certain roads in order to distribute traffic demand more evenly over time and space. This study presents a framework for large-scale variable congestion pricing policy determination and evaluation. The proposed framework integrates departure time choice and route choice models within a regional dynamic traffic assignment (DTA) simulation environment. The framework addresses the impact of tolling on: (1) road traffic congestion (supply side), and (2) travelers’ choice dimensions including departure time and route choices (demand side). The framework is applied to a simulation-based case study of tolling a major freeway in Toronto while capturing the regional effects across the Greater Toronto Area (GTA). The models are developed and calibrated using regional household travel survey data that reflect the heterogeneity of travelers’ attributes. The DTA model is calibrated using actual traffic counts from the Ontario Ministry of Transportation and the City of Toronto. The case study examined two tolling scenarios: flat and variable tolling. The results indicate that: (1) more benefits are attained from variable pricing, that mirrors temporal congestion patterns, due to departure time rescheduling as opposed to predominantly re-routing only in the case of flat tolling, (2) widespread spatial and temporal re-distributions of traffic demand are observed across the regional network in response to tolling a significant, yet relatively short, expressway serving Downtown Toronto, and (3) flat tolling causes major and counterproductive rerouting patterns during peak hours, which was observed to block access to the tolled facility itself.     

Investigating the effect of travel time variability on drivers' route choice decisions in Shanghai,China

Abstract

This paper investigates the effect of travel time variability on drivers' route choice behavior in the context of Shanghai, China. A stated preference survey is conducted to collect drivers' hypothetical choice between two alternative routes with designated unequal travel time and travel time variability. A binary choice model is developed to quantify trade-offs between travel time and travel time variability across various types of drivers. In the model, travel time and travel time variability are, respectively, measured by expectation and standard deviation of random travel time. The model shows that travel time and travel time variability on a route exert similarly negative effects on drivers' route choice behavior. In particular, it is found that middle-age drivers are more sensitive to travel time variability and less likely to choose a route with travel time uncertainty than younger and elder drivers. In addition, it is shown that taxi drivers are more sensitive to travel time and more inclined to choose a route with less travel time. Drivers with rich driving experience are less likely to choose a route with travel time uncertainty.     

Effects of queue spillover in networks considering simultaneous departure time and route choices

This paper explores the effects of queue spillover in transportation networks, in the context of dynamic traffic assignment. A model of spatial queue is defined to characterize dynamic traffic flow and queuing formation in network links. Network users simultaneously choose departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of the dynamic user equilibrium, dynamic network flows are obtained exactly on some networks with typical structure. Various effects of queue spillover are discussed based on the results of these networks, and some new paradoxes of link capacity expansion have been found as a result of such effects. Analytical and exact results in these typical networks show that ignoring queuing length may generate biased solutions, and the link storage capacity is a very important factor concerning the performance of networks.     

An integrated real-time traffic signal system for transit signal priority,incident detection and congestion management

This paper presents a traffic control system that can work standalone to handle various boundary conditions of the recurrent, non-recurrent congestion, transit signal priority and downstream blockage conditions to improve the overall traffic network vehicular productivity and efficiency. The control system uses field detectors’ data to determine the boundary conditions of all incoming and exit links. The developed system is interfaced with CORSIM micro-simulation for rigorous evaluations with different types of signal phase settings. The comparative performance of this control logic is quite satisfactory for some of the most frequently used phase settings in the network with a high number of junctions under highly congested conditions.     

A model for assessing the effects of dynamic travel time information via variable message signs

In view of the serious traffic congestion during peak hours in most metropolitan areas around the world and recent improvement of information technology, there is a growing aspiration to alleviate road congestion by applications of electronic information and communication technology. Providing drivers with dynamic travel time information such as estimated journey times on major routes should help drivers to select better routes and guide them to utilise existing expressway network. This can be regarded as one possible strategy for effective traffic management. This paper aims to investigate the effects and benefits of providing dynamic travel time information to drivers via variable message signs at the expressway network. In order to assess the effects of the dynamic driver information system with making use of the variable message signs, a time-dependent traffic assignment model is proposed. A numerical example is used to illustrate the effects of the dynamic travel time information via variable message signs. This revised version was published online in June 2006 with corrections to the Cover Date.     

A cell-based Merchant-Nemhauser model for the system optimum dynamic traffic assignment problem

A cell-based variant of the Merchant-Nemhauser (M-N) model is proposed for the system optimum (SO) dynamic traffic assignment (DTA) problem. Once linearized and augmented with additional constraints to capture cross-cell interactions, the model becomes a linear program that embeds a relaxed cell transmission model (CTM) to propagate traffic. As a result, we show that CTM-type traffic dynamics can be derived from the original M-N model, when the exit-flow function is properly selected and discretized. The proposed cell-based M-N model has a simple constraint structure and cell network representation because all intersections and cells are treated uniformly. Path marginal costs are defined using a recursive formula that involves a subset of multipliers from the linear program. This definition is then employed to interpret the necessary condition, which is a dynamic extension of the Wardrop’s second principle. An algorithm is presented to solve the flow holding back problem that is known to exist in many discrete SO-DTA models. A numerical experiment is conducted to verify the proposed model and algorithm.