Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets

Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational behavior assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands. After defining ε-BRUE, where ε is the indifference band for the perceived travel cost, we formulate the ε-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE–NCP formulation. To obtain the BRUE solution set encompassing all BRUE flow patterns, we propose a methodology of generating acceptable path set which may be utilized under the boundedly rational behavior assumption. We show that with the increase of the indifference band, the acceptable path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference band to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. The BRUE solution set can then be obtained by assigning all traffic demands to the acceptable path set. Various numerical examples are given to illustrate our findings.     

Computing the cost of traffic congestion: a microsimulation exercise of the City of Antofagasta,Chile

Abstract

This paper computes the cost of traffic congestion in the city of Antofagasta in Chile. A microsimulation is implemented where all the agents of the system travel across the transport network. The congestion cost is computed through the aggregation of the opportunity cost of people waiting within the transport system, as a consequence of traffic congestion. Monte Carlo experiments produced an approximated congestion cost of US$1.02 million during a typical working day. Moreover, the simulation provides useful information about the average traveling time for the 14 districts of the city.     

A GIS‐based traffic analysis zone design: implementation and evaluation

The purpose of this paper is to implement an efficient method for GIS‐based traffic analysis zone (TAZ) design in order to evaluate and validate such a method. The method was developed by the authors.

Moran's I spatial autocorrelation coefficient and sample variance are used for evaluating the generated TAZs using the Champaign‐Urbana, IL region as a case study. Sensitivity analysis is also conducted to explore the fluctuations in TAZ generation outcomes. The evaluation, the validation as well as the TAZ design have been implemented with ARC/INFO GIS software on a UNIX workstation platform.     

Bi-level GA and GIS for Multi-objective TSP Route Planning

Abstract

Route planning is usually carried out to achieve a single objective such as to minimize transport cost, distance traveled or travel time. This article explores an approach to multi-objective route planning using a genetic algorithm (GA) and geographical information system (GIS) approach. The method is applied to the case of a tourist sight-seeing itinerary, where a route is planned by a tour operator to cover a set of places of interest within a given area. The route planning takes into account four criteria including travel time, vehicle operating cost, safety and surrounding scenic view quality. The multi-objective route planning in this paper can be viewed as an extension of the traditional traveling salesman problem (TSP) since a tourist needs to pass through a number of sight points. The four criteria are quantified using the spatial analytic functions of GIS and a generalized cost for each link is calculated. As different criteria play different roles in the route selection process, and the best order of the multiple points needs to be determined, a bi-level GA has been devised. The upper level aims to determine the weights of each criterion, while the lower level attempts to determine the best order of the sights to be visited based on the new generalized cost that is derived from the weights at the upper level. Both levels collaborate during the iterations and the route with the minimal generalized cost is thus determined. The above sight-seeing route planning methodology has been examined in a region within the central area of Singapore covering 19 places of interest.     

Estimating origin‐destination matrices from link volume counts: a simple intercity auto travel demand model for Sri Lanka

The cost of nation wide travel surveys is high. Hence in many developing countries, planners have found it difficult to develop intercity transportation plans due to the non availability of origin‐destination trip matrices. This paper will describe a method for the intercity auto travel estimation for Sri Lanka with link traffic volume data.

The paper outlines the rationale of selecting the district capitals of Sri Lanka as its “cities,” the methodology for selecting the intercity road network, determination of link travel times from express bus schedules and the location of link volume counting positions.

Initially, the total auto travel demand model is formulated with various trip purpose sub‐models. This model is finally modified to a simple demand model with district urban population and travel times between city pairs as the exogenous variables, to overcome statistical estimation difficulties. The final demand model has statistics within the acceptable regions.

The advantages of a simple model are discussed and possible extensions are proposed.     

Estimation of link performance functions from incomplete flow data

Despite the pivotal importance of link performance functions to models of transport systems, relatively little work has been done on practical aspects of estimating these functions from observed data. Furthermore it is difficult to find any examples in the literature of estimated urban link performance functions faithfully reproducing theoretical travel time-flow relationships. One reason for the paucity of research in this area is the difficulty and expense of obtaining the requisite data. The increase in automatic collection of traffic flow data goes part way to resolving this problem, but matching such flows to manually recorded travel times can present considerable statistical difficulties in the estimation procedure. This paper considers the estimation of link performance functions from a combination of automatically recorded traffic counts and travel collected by hand, using a non-standard statistical methodology. The study is motivated by a set of data of precisely this type, from the UK city of Leicester.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Modelling and simulation of transportation system effectiveness to reduce traffic congestion: a system dynamics framework

ABSTRACT

This paper is designed to evaluate and improve the effectiveness of transportation systems and reduce traffic congestion through the use of simulation models and scenario development. A system dynamics framework is used to test and evaluate the alternatives of future strategies for the city of Surabaya, Indonesia. Some factors affecting the effectiveness of transport systems include operational effectiveness and service effectiveness, as well as uncertainty. To improve the effectiveness of transportation systems, several strategies can be implemented, such as subsidizing public transportation, increasing the cost of private vehicle parking fees, raising taxes on private vehicles, and reducing delays in public transportation through scenario development. Scenario results show that, by pursuing these strategies, effectiveness could be improved by 80% as the impact of the increase in operational and service effectiveness, helping to mitigate traffic congestion. Congestion could be reduced to 70% (on average) due to the decrease in daily traffic.     

Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting

With the recent increase in the deployment of ITS technologies in urban areas throughout the world, traffic management centers have the ability to obtain and archive large amounts of data on the traffic system. These data can be used to estimate current conditions and predict future conditions on the roadway network. A general solution methodology for identifying the optimal aggregation interval sizes for four scenarios is proposed in this article: (1) link travel time estimation, (2) corridor/route travel time estimation, (3) link travel time forecasting, and (4) corridor/route travel time forecasting. The methodology explicitly considers traffic dynamics and frequency of observations. A formulation based on mean square error (MSE) is developed for each of the scenarios and interpreted from a traffic flow perspective. The methodology for estimating the optimal aggregation size is based on (1) the tradeoff between the estimated mean square error of prediction and the variance of the predictor, (2) the differences between estimation and forecasting, and (3) the direct consideration of the correlation between link travel time for corridor/route estimation and forecasting. The proposed methods are demonstrated using travel time data from Houston, Texas, that were collected as part of the automatic vehicle identification (AVI) system of the Houston Transtar system. It was found that the optimal aggregation size is a function of the application and traffic condition.

Estimating arterial link speed using conventional road detectors

Abstract

In response to an initiative to develop an advanced traffic information system in Bangkok, this paper explores practical guidelines for the optimal location of road sensors, such that the data collected on spot speeds reflect an entire link's average speed. In particular, the authors use microsimulation software to investigate optimal detector locations, using the sum of squared errors and root mean squared errors. The analysis hypothesizes that road segments are 0.4, 0.6, 0.8, 1.0, 2.0 and 3.0 km in length and are specially designed to replicate typical arterial streets in Bangkok. The results show that a single detector location can produce good estimates of link speed only for segments that are shorter than 1.0 km. For distances of 1.0 km or more, the results suggest that two detectors be used for good link speed estimates under all traffic conditions.     

Decision-making on Large Infrastructure Projects: The Role of the Dutch Parliament

Abstract

Validating microscopic traffic simulation models incorporates several challenges because of the inadequacy and rareness of validation data, and the complexity of the car following and lane-changing processes. In addition, validation data were usually measured in aggregate form at the link level and not at the level of the individual vehicle. The majority of model validation attempts in the literature use average link measurements of traffic characteristics. However, validation techniques based on averages of traffic variables have several limitations including possible inconsistency between the field observed and simulation-estimated variables, and as such the resulting spatial–temporal traffic stream patterns.

Due to these inconsistencies, this paper introduces a novel approach to the validation of microscopic traffic simulation models. A three-stage procedure for validating microscopic simulation models is presented. The paper describes the field measurements, experimental setup, and the simulation-based analysis of the three stages. The purpose of the first stage is to validate a benchmark simulator (NETSIM) using limited field data. The second stage examines the spatial–temporal traffic patterns extracted from the benchmark simulator versus those extracted from the simulation model to be validated (I-SIM-S). Different traffic patterns were examined accounting for various factors, such as traffic flow, link speeds, and signal timing. The third stage compares the aggregate traffic measures extracted from the subject simulator against those extracted from the benchmark simulator.     

A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks

The paper investigates the efficiency of a recently developed signal control methodology, which offers a computationally feasible technique for real-time network-wide signal control in large-scale urban traffic networks and is applicable also under congested traffic conditions. In this methodology, the traffic flow process is modeled by use of the store-and-forward modeling paradigm, and the problem of network-wide signal control (including all constraints) is formulated as a quadratic-programming problem that aims at minimizing and balancing the link queues so as to minimize the risk of queue spillback. For the application of the proposed methodology in real time, the corresponding optimization algorithm is embedded in a rolling-horizon (model-predictive) control scheme. The control strategy’s efficiency and real-time feasibility is demonstrated and compared with the Linear-Quadratic approach taken by the signal control strategy TUC (Traffic-responsive Urban Control) as well as with optimized fixed-control settings via their simulation-based application to the road network of the city centre of Chania, Greece, under a number of different demand scenarios. The comparative evaluation is based on various criteria and tools including the recently proposed fundamental diagram for urban network traffic.     

A distributed origin–destination demand estimation approach for real-time traffic network management

Abstract

This paper describes a distributed recursive heuristic approach for the origin–destination demand estimation problem for real-time traffic network management applications. The distributed nature of the heuristic enables its parallelization and hence reduces significantly its processing time. Furthermore, the heuristic reduces dependency on historical data that are typically used to map the observed link flows to their corresponding origin–destination pairs. In addition, the heuristic allows the incorporation of any available partial information on the demand distribution in the study area to improve the overall estimation accuracy. The heuristic is implemented following a hierarchal multi-threading mechanism. Dividing the study area into a set of subareas, the demand of every two adjacent subareas is merged in a separate thread. The merging operations continue until the demand for the entire study area is estimated. Experiments are conducted to examine the performance of the heuristic using hypothetical and real networks. The obtained results illustrate that the heuristic can achieve reasonable demand estimation accuracy while maintaining superiority in terms of processing time.     

How tube strikes affect macroscopic and link travel times in London

Abstract

The purpose of this study was to investigate the impact of the five strikes on the London Underground (metro) rail system, which occurred in 2009 and 2010, on macroscopic and road link travel times. A consequence of these strikes was an increase in road traffic flows above usual levels. This provides an opportunity to observe the operation of the road network under unusually high flows. The first objective involves the examination of strike effects on inbound (IT) and outbound traffic (OT) within central, inner and outer London. Travel time data obtained from automatic number plate recognition cameras are used within the first part of the analysis. The second more detailed objective was to investigate in spatio-temporal effects on travel times on five road links. Correlation analyses and general linear models are developed using both traffic flow and travel time data. According to the results of the study, the morning IT had approximately twice as much delay as the OT. Central London experienced the highest delays, followed by inner and outer London. As would be expected, the unique full-day strike in 2009 yielded the worst impact on the network with the highest percentage increase in total travel time (60%) occurring during the morning peak in the IT in inner London. The results from the link-level analysis showed statistical significance amongst the examined links indicating heterogeneous effects from one link to another. It was also found that travel time changes may be more effectively captured through time-of-day terms compared to hourly traffic flows.     

Quality indicators and capacity calculation for RoRo terminals

Abstract

Road freight transportation has increased dramatically over recent years along with its impacts such as congestion, noise, and pollution. As a result, European and US governments have started policies to promote alternatives to road transportation, such as logistic chains containing a Short Sea Shipping (SSS) link. Road is, by definition, a more flexible means of transportation than shipping, which is usually cheaper. Therefore, to move traffic to SSS chains, it is necessary to provide fast, frequent, and reliable maritime transportation. In this sense, roll-on/roll-off (RoRo) vessels are the most convenient ships to be used, since they have smaller dwell times in port and, therefore, this is a kind of traffic likely to increase dramatically. The foreseeable increase of this kind of traffic must meet with an increase in the actual capacity by means of either improvement in performance and possible enlargements of existing terminals or the construction of new terminals. In that sense, this paper proposes a simple methodology to calculate the capacity of a RoRo terminal, whether already in operation or during its design process, and relate it to some quality standards by means of quality indicators, which should lead to the definition of Levels of Service similar to those already used in roads and airports. The paper ends by applying the methodology to a real terminal in Barcelona, Spain.     

Control Concepts for Facilitating Motorway On-ramp Merging Using Intelligent Vehicles

Abstract

Congestion at motorway junctions is a traffic phenomenon that degrades operation of infrastructure and can lead to breakdown of traffic flow and associated reduction in capacity. Advanced communication technologies open new possibilities to prevent or at least delay this phenomenon, and innovative active traffic management systems have been developed in the recent years for better control of motorway traffic. This paper presents a review of control strategies for facilitating motorway on-ramp merging using intelligent vehicles. First, the concepts of the control algorithms are reviewed chronologically divided into three types of intelligent vehicle: completely automated, equipped with cooperative adaptive cruise control and equipped with on-board display. Then, a common structure is identified, and the algorithms are presented based on their characteristics in order to identify similarities, dissimilarities, trends and possible future research directions. Finally, using a similar approach, a review of the methods used to evaluate these control strategies identifies important aspects that should be considered by further research on this topic.     

Optimization Of Headway,Vehicle Size and Route Choice for Minimum Cost Feeder Service

ABSTRACT

Many people use public transportation systems to reach their destination, while others use personal vehicles. Poor transportation systems do not attract ridership. Therefore, the usage of passenger cars increases, and traffic and environmental conditions deteriorate. Efficient public transportation has been recognized as one of the potential ways of mitigating air pollution, reducing energy consumption, improving mobility and alleviating traffic congestion. The objective of this study is to optimize a bus feeder service that provides the shuttle service between a recreation center (e.g. Sandy Hook, NJ) and a major public transportation facility, subject to site-specific constraints such as vehicle schedules, bus availability, service capacity and budget. The decision variables include bus headway, vehicle size and route choice. The solution methodology integrating both analytical and numerical techniques is developed, which optimizes the decision variables. Finally, the proposed solution methodology is applied to a case study. Numerical results, including optimal solutions and sensitivity analyses, are presented while the level of coordination between the feeder service and a major transportation service is discussed.     

Development of origin–destination matrices using mobile phone call data

In this research, we propose a methodology to develop OD matrices using mobile phone Call Detail Records (CDR) and limited traffic counts. CDR, which consist of time stamped tower locations with caller IDs, are analyzed first and trips occurring within certain time windows are used to generate tower-to-tower transient OD matrices for different time periods. These are then associated with corresponding nodes of the traffic network and converted to node-to-node transient OD matrices. The actual OD matrices are derived by scaling up these node-to-node transient OD matrices. An optimization based approach, in conjunction with a microscopic traffic simulation platform, is used to determine the scaling factors that result best matches with the observed traffic counts. The methodology is demonstrated using CDR from 2.87 million users of Dhaka, Bangladesh over a month and traffic counts from 13 key locations over 3 days of that month. The applicability of the methodology is supported by a validation study.     

Stability and bifurcation in network traffic flow: A Poincaré map approach

Previous studies have shown that, in a diverge-merge network with two intermediate links (the DM network), the kinematic wave model always admits stationary solutions under constant boundary conditions, but periodic oscillations can develop from empty initial conditions. Such contradictory observations suggest that the stationary states be unstable. In this study we develop a systematic approach to investigate the stability property of stationary states in this and other networks within the framework of network kinematic wave theories. Based on the observation that kinematic waves propagate in a circular path when only one of the two intermediate links is congested, we derive a one-dimensional, discrete Poincaré map in the out-flux at a Poincaré section. We then prove that the fixed points of the Poincaré map correspond to stationary flow-rates on the two links. With Lyapunov’s first method, we demonstrate that the Poincaré map can be finite-time stable, asymptotically stable, or unstable. When unstable, the map is found to have periodical points of period two, but no chaotic solutions. We further analyze the bifurcation in the stability of the Poincaré map caused by varying route choice proportions. We apply the Poincaré map approach to analyzing traffic patterns in more general (DM)ⁿ and beltway networks, which are sufficient and necessary structures for network-induced unstable traffic and gridlock, respectively. This study demonstrates that the Poincaré map approach can be efficiently applied to analyze traffic dynamics in any road networks with circular information propagation and provides new insights into unstable traffic dynamics caused by interactions among network bottlenecks.