A GIS‐based traffic analysis zone design: technique

The main purpose of this paper is to develop an efficient method to design traffic analysis zones (TAZs), which is necessary for implementing a planning process with Geographic Information System (GIS) for Transportation (GIS‐T), using statistical spatial data analyses and GIS technology. The major roles of GIS in this method are: (1) to produce basic spatial units (BSUs) with topological data structure; (2) to integrate various procedures during the TAZ generation including computer program routines; and (3) to visualize the output of each TAZ generation. One of the most significant reasons for obtaining well‐defined TAZs is the fact that they are defined at the outset of transportation demand modeling, used from trip generation to trip assignment, and will ultimately affect transportation policy decisions.

Toward obtaining well‐defined TAZs, this paper concentrates on two important constraints: homogeneity and contiguity. Iterative partitioning technique is adopted to promote the optimum homogeneity of generated TAZs, while a contiguity checking algorithm is developed to ensure contiguous TAZs are generated by the iterative partitioning technique.     

The vehicle emissions and performance monitoring system: analysis of tailpipe emissions and vehicle performance

This paper describes tailpipe emission results generated by the Vehicle Performance and Emissions Monitoring system (VPEMS). VPEMS integrates on‐board emissions and vehicle/driver performance measurements with positioning and communications technologies, to transmit a coherent spatio‐temporally referenced dataset to a central base station in near real time. These results focus on relationships between tailpipe emissions of CO, CO₂, NO_x and speed and acceleration. Emissions produced by different driving modes are also presented. Results are generally as one would expect, showing variation between vehicle speed, vehicle acceleration and emissions. Data is based upon a test run in central London on urban streets with speeds not exceeding about 65 km/h. The results presented demonstrate the capabilities of the system. Various issues remain with regard to validation of the data and expansion of the system capability to obtain additional vehicle performance data.     

An optimization method for sustainable traffic control in urban areas

The optimization of traffic signalization in urban areas is formulated as a problem of finding the cycle length, the green times and the offset of traffic signals that minimize an objective function of performance indices. Typical approaches to this optimization problem include the maximization of traffic throughput or the minimization of vehicles’ delays, number of stops, fuel consumption, etc. Dynamic Traffic Assignment (DTA) models are widely used for online and offline applications for efficient deployment of traffic control strategies and the evaluation of traffic management schemes and policies. We propose an optimization method for combining dynamic traffic assignment and network control by minimizing the risk of potential loss induced to travelers by exceeding their budgeted travel time as a result of deployed traffic signal settings, using the Conditional Value-at-Risk model. The proposed methodology can be easily implemented by researchers or practitioners to evaluate their alternative strategies and aid them to choose the alternative with less potential risk. The traffic signal optimization procedure is implemented in TRANSYT-7F and the dynamic propagation and route choice of vehicles is simulated with a mesoscopic dynamic traffic assignment tool (DTALite) with fixed temporal demand and network characteristics. The proposed approach is applied to a reference test network used by many researchers for verification purposes. Numerical experiments provide evidence of the advantages of this optimization method with respect to conventional optimization techniques. The overall benefit to the performance of the network is evaluated with a Conditional Value-at-Risk Analysis where the optimal solution is the one presenting the least risk for ‘guaranteed’ total travel times.     

Analytical and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model

In this article, we propose a computational method for solving the Lighthill-Whitham-Richards (LWR) partial differential equation (PDE) semi-analytically for arbitrary piecewise-constant initial and boundary conditions, and for arbitrary concave fundamental diagrams. With these assumptions, we show that the solution to the LWR PDE at any location and time can be computed exactly and semi-analytically for a very low computational cost using the cumulative number of vehicles formulation of the problem. We implement the proposed computational method on a representative traffic flow scenario to illustrate the exactness of the analytical solution. We also show that the proposed scheme can handle more complex scenarios including traffic lights or moving bottlenecks. The computational cost of the method is very favorable, and is compared with existing algorithms. A toolbox implementation available for public download is briefly described, and posted at http://traffic.berkeley.edu/project/downloads/lwrsolver.     

Real-time traffic estimation using data expansion

This paper presents a method for estimating missing real-time traffic volumes on a road network using both historical and real-time traffic data. The method was developed to address urban transportation networks where a non-negligible subset of the network links do not have real-time link volumes, and where that data is needed to populate other real-time traffic analytics. Computation is split between an offline calibration and a real-time estimation phase. The offline phase determines link-to-link splitting probabilities for traffic flow propagation that are subsequently used in real-time estimation. The real-time procedure uses current traffic data and is efficient enough to scale to full city-wide deployments. Simulation results on a medium-sized test network demonstrate the accuracy of the method and its robustness to missing data and variability in the data that is available. For traffic demands with a coefficient of variation as high as 40%, and a real-time feed in which as much as 60% of links lack data, we find the percentage root mean square error of link volume estimates ranges from 3.9% to 18.6%. We observe that the use of real-time data can reduce this error by as much as 20%.     

Auction-based highway reservation system an agent-based simulation study

Based on previous studies of a highway reservation system, this paper proposed an auction-based implementation, in which the users can bid for the right to use a route during a certain period of time. This paper models the auction system with MATSim using an agent-based simulation technique. The agents adopt their own bidding logic in the auction, and the price converges after around 130 iterations, when the number of users using the reserved highway and the total collected revenue become stable. When the overall demand changes, the collected revenue ranges from 5 to 11 dollars per user, and from 0.7 to 1.5 dollars per mile. The auction system can transfer more consumer surplus to the toll road operators, since it is a personalized tolling mechanism. The users are using the reservation system as insurance of a guaranteed congestion-free travel. The auction-based highway reservation shows great potential as a new traffic management system.     

Winter problems on mountain passes – Implications for cost-benefit analysis

Cost-benefit analysis is a tool in government decision-making for determining the consequences of alternative uses of society’s scarce resources. Such a systematic process of comparing benefits and costs was adopted in early years for transportation projects and it has been the subject of much refining over the years. There are still some flaws, however, in the application of the method. In this article we have studied the impact of weather conditions on traffic speed on low traffic roads often exposed to adverse weather. This is an issue not currently considered in the cost-benefit analysis of road projects. By using two analytical approaches—structural equation modelling and classification and regression tree analysis—the impact of the weather indicators temperature, wind speed, and precipitation on traffic speed has been quantified. The data relates to three winter months on the European Route 6 road over the mountain pass Saltfjellet in Norway. Increase in wind speed, increase in precipitation and temperatures around freezing point all caused significant decrease in traffic speed in the case studied. If actions were taken to reduce the impact of adverse weather on traffic (e.g. by building a tunnel through the mountain) this study indicates that the road users would gain a total benefit of approximately 2,348,000 NOK (282,000 EUR) each winter at Saltfjellet if all the weather related benefits were included. We argue that this is a significant number that is highly relevant to include in CBAs. This applies both to the CBAs of new transportation projects as well as when resources are allocated for operation, maintenance, and monitoring of the existing transport systems. Including the weather related benefits would improve the application of CBA as a decision-making tool for policy makers.     

船舶在波浪中航行时的安全操纵

船舶在波浪中航行,纯稳性丧失、参数激振和横甩是造成船舶倾覆的主要原因。针对波长与船长、波高与波长、波与船的波舷角三者对船舶稳性的影响进行讨论,揭示了船舶在波浪中航行时的稳性变化规律,提出了应合理地选择船舶的航行姿态、谨慎用舵等操船建议,保证船舶的航行安全。     

A piecewise-constant congestion taxing policy for repeated routing games

In this paper, we consider repeated routing games with piecewise-constant congestion taxing in which a central planner sets and announces the congestion taxes for fixed windows of time in advance. Specifically, congestion taxes are calculated using marginal congestion pricing based on the flow of the vehicles on each road prior to the beginning of the taxing window (and, hence, there is a time-varying delay in setting the congestion taxes). We motivate the piecewise-constant taxing policy by that users or drivers may dislike fast-changing prices and that they also prefer prior knowledge of the prices. We prove for this model that the multiplicative update rule and the discretized replicator dynamics converge to a socially optimal flow when using vanishing step sizes. Considering that the algorithm cannot adapt itself to a changing environment when using vanishing step sizes, we propose adopting constant step sizes in this case. Then, however, we can only prove the convergence of the dynamics to a neighborhood of the socially optimal flow (with the size of the neighbourhood being of the order of the selected step size). The results are illustrated on a nonlinear version of Pigou’s famous routing game.