首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
    
Travel time, travel time reliability and monetary cost have been empirically identified as the most important criteria influencing route choice behaviour. We concentrate on travel time and travel time reliability and review two prominent user equilibrium models incorporating these two factors. We discuss some shortcomings of these models and propose alternative bi-objective user equilibrium models that overcome the shortcomings. Finally, based on the observation that both models use standard deviation of travel time within their measure of travel time reliability, we propose a general travel time reliability bi-objective user equilibrium model. We prove that this model encompasses those discussed previously and hence forms a general framework for the study of reliability related user equilibrium. We demonstrate and validate our concepts on a small three-link example.  相似文献   

2.
    
As congestion pricing has moved from theoretical ideas in the literature to real-world implementation, the need for decision support when designing pricing schemes has become evident. This paper deals with the problem of finding optimal toll levels and locations in a road traffic network and presents a case study of Stockholm. The optimisation problem of finding optimal toll levels, given a predetermined cordon, and the problem of finding both optimal toll locations and levels are presented, and previously developed heuristics are used for solving these problems. For the Stockholm case study, the possible welfare gains of optimising toll levels in the current cordon and optimising both toll locations and their corresponding toll levels are evaluated. It is shown that by tuning the toll levels in the current congestion pricing cordon used in Stockholm, the welfare gain can be increased significantly, and furthermore improved by allowing a toll on a major bypass highway. It is also shown that, by optimising both toll locations and levels, a congestion pricing scheme with welfare gain close to what can be achieved by marginal social cost pricing can be designed with tolls being located on only a quarter of the tollable links.  相似文献   

3.
    
In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.  相似文献   

4.
The aim of this paper is to remove the known limitations of Deterministic and Stochastic User Equilibrium (DUE and SUE), namely that only routes with the minimum cost are used in DUE, and that all permitted routes are used in SUE regardless of their costs. We achieve this by combining the advantages of the two principles, namely the definition of unused routes in DUE and of mis-perception in SUE, such that the resulting choice sets of used routes are equilibrated. Two model families are formulated to address this issue: the first is a general version of SUE permitting bounded and discrete error distributions; the second is a Restricted SUE model with an additional constraint that must be satisfied for unused paths. The overall advantage of these model families consists in their ability to combine the unused routes with the use of random utility models for used routes, without the need to pre-specify the choice set. We present model specifications within these families, show illustrative examples, evaluate their relative merits, and identify key directions for further research.  相似文献   

5.
We present a reformulation of the residential location submodel of the Integrated Model of Residential and Employment Location as a network equilibrium problem, thereby making travel costs by auto endogenous. The location of housing supply is examined as a welfare maximization problem for both user-optimal and system-optimal travel costs using concepts of bilevel programming. Finally, we briefly discuss how the employment submodel can be reformulated, and the entire model solved as a variational inequality problem.  相似文献   

6.
In this paper, we extend the α-reliable mean-excess traffic equilibrium (METE) model of Chen and Zhou (Transportation Research Part B 44(4), 2010, 493-513) by explicitly modeling the stochastic perception errors within the travelers’ route choice decision processes. In the METE model, each traveler not only considers a travel time budget for ensuring on-time arrival at a confidence level α, but also accounts for the impact of encountering worse travel times in the (1 − α) quantile of the distribution tail. Furthermore, due to the imperfect knowledge of the travel time variability particularly in congested networks without advanced traveler information systems, the travelers’ route choice decisions are based on the perceived travel time distribution rather than the actual travel time distribution. In order to compute the perceived mean-excess travel time, an approximation method based on moment analysis is developed. It involves using the conditional moment generation function to derive the perceived link travel time, the Cornish-Fisher Asymptotic Expansion to estimate the perceived travel time budget, and the Acerbi and Tasche Approximation to estimate the perceived mean-excess travel time. The proposed stochastic mean-excess traffic equilibrium (SMETE) model is formulated as a variational inequality (VI) problem, and solved by a route-based solution algorithm with the use of the modified alternating direction method. Numerical examples are also provided to illustrate the application of the proposed SMETE model and solution method.  相似文献   

7.
Travelers often reserve a buffer time for trips sensitive to arrival time in order to hedge against the uncertainties in a transportation system. To model the effects of such behavior, travelers are assumed to choose routes to minimize the percentile travel time, i.e. the travel time budget that ensures their preferred probability of on-time arrival; in doing so, they drive the system to a percentile user equilibrium (UE), which can be viewed as an extension of the classic Wardrop equilibrium. The stochasticity in the supply of transportation are incorporated by modeling the service flow rate of each road segment as a random variable. Such stochasticity is flow-dependent in the sense that the probability density functions of these random variables, from which the distribution of link travel time are constructed, are specified endogenously with flow-dependent parameters. The percentile route travel time, obtained by directly convolving the link travel time distributions in this paper, is not available in closed form in general and has to be numerically evaluated. To reveal their structural properties, percentile UE solutions are examined in special cases and verified with numerical results. For the general multi-class percentile UE traffic assignment problem, a variational inequality formulation is given and solved using a route-based algorithm. The algorithm makes use of the diagonal elements in the Jacobian of percentile route travel time, which is approximated through recursive convolution. Preliminary numerical experiments indicate that the algorithm is able to achieve highly precise equilibrium solutions.  相似文献   

8.
This paper addresses a general stochastic user equilibrium (SUE) traffic assignment problem with link capacity constraints. It first proposes a novel linearly constrained minimization model in terms of path flows and then shows that any of its local minimums satisfies the generalized SUE conditions. As the objective function of the proposed model involves path‐specific delay functions without explicit mathematical expressions, its Lagrangian dual formulation is analyzed. On the basis of the Lagrangian dual model, a convergent Lagrangian dual method with a predetermined step size sequence is developed. This solution method merely invokes a subroutine at each iteration to perform a conventional SUE traffic assignment excluding link capacity constraints. Finally, two numerical examples are used to illustrate the proposed model and solution method.  相似文献   

9.
The example of Singapore shows that rapid urban and economic growth does not have to bring traffic congestion and pollution. Singapore has chosen to restrain car traffic demand due to its limited land supply. Transport policy based on balanced development of road and transit infrastructure and restraint of traffic has been consistently implemented for the past 30 years. Combined with land use planning, it resulted in a modern transport system, which is free from major congestion and provides users with different travel alternatives. As the economic growth caused a substantial increase in demand for cars, several pricing policies were introduced with the aim of restraining car ownership and usage. Growth of the vehicle population is now controlled and potentially congested roads are subject to road pricing. These measures help to keep the roads free from major congestion, maintain car share of work trips below 25% and keep the transport energy usage low. Although Singapore conditions are in many aspects unique, its travel demand experience can provide useful lessons for other rapidly growing cities in Asia.
Piotr S. OlszewskiEmail:
  相似文献   

10.
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.
Changho ChoiEmail:
  相似文献   

11.
    
Most of existing route guidance strategies achieves user optimal equilibrium by comparing travel time. Measuring travel time, however, might be uneasy on an urban road network. To contend with the issue, the paper mainly considers easily obtained inflow and outflow of a link and road capacity as input, and proposes a route guidance strategy for a single destination road network based on the determination of free-flow or congested conditions on alternative routes. An extended strategy for a complex network and a feedback approximation for avoiding forecast are further explored. Weaknesses of the strategy are also explicitly analyzed. To test the strategy, simulation investigations are conducted on two networks with multiple parallel routes. The results indicate that the strategy is able to provide stable splitting rates and to approximate user optimal equilibrium in different conditions, in particular when traffic demand is high. This strategy has potential to be applied in an urban road network due to its simplicity and easily obtained input data. The strategy is also applicable for single destination if some alternatives and similar routes are available.  相似文献   

12.
    
In many countries, decision-making on proposals for national or regional infrastructure projects in passenger and freight transport includes carrying out a cost–benefit analysis for these projects. Reductions in travel times are usually a key benefit. However, if a project also reduces the variability of travel time, travellers, freight operators and shippers will enjoy additional benefits, the ‘reliability benefits’. Until now, these benefits are usually not included in the cost–benefit analysis. To include reliability of travel or transport time in the cost–benefit analysis of infrastructure projects not only monetary values of reliability, but also reliability forecasting models are needed. As a result of an extensive feasibility study carried out for the German Federal Ministry of Transport, Building and Urban Development this paper aims to provide a literature overview and outcomes of an expert panel on how best to calculate and monetise reliability benefits, synthesised into recommendations for implementing travel time reliability into existing transport models in the short, medium, and long term. The paper focuses on road transport, which has also been the topic for most of the available literature on modelling and valuing transport time reliability.  相似文献   

13.
This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.  相似文献   

14.
    
This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.  相似文献   

15.
交通事故发生机理是认识道路交通事故发生过程、交通事故预防和改善交通安全的基础。文章以道路交通系统为研究对象,分析道路交通事故的形成过程,将交通事故发生机理分为驾驶行为差错类事故发生机理、外部因素突变类事故发生机理、综合性事故发生机理三类,并在此基础上绘制了道路交通事故发生机理图,同时结合国道109线兰州八盘村路段进行了实例分析。  相似文献   

16.
    
In this paper, a model-based perimeter control policy for large-scale urban vehicular networks is proposed. Assuming a homogeneously loaded vehicle network and the existence of a well-posed Network Fundamental Diagram (NFD), we describe a protected network throughout its aggregated dynamics including nonlinear exit flow characteristics. Within this framework of constrained optimal boundary flow gating, two main performance metrics are considered: (a) first, connected to the NFD, the concept of average network travel time and delay as a performance metric is defined; (b) second, at boundaries, we take into account additional external network queue dynamics governed by uncontrolled inflow demands. External queue capacities in terms of finite-link lengths are used as the second performance metric. Hence, the corresponding performance requirement is an upper bound of external queues. While external queues represent vehicles waiting to enter the protected network, internal queue describes the protected network’s aggregated behavior.By controlling the number of vehicles joining the internal queue from the external ones, herewith a network traffic flow maximization solution subject to the internal and external dynamics and their performance constraints is developed. The originally non-convex optimization problem is transformed to a numerically efficiently convex one by relaxing the performance constraints into time-dependent state boundaries. The control solution can be interpreted as a mechanism which transforms the unknown arrival process governing the number of vehicles entering the network to a regulated process, such that prescribed performance requirements on travel time in the network and upper bound on the external queue are satisfied. Comparative numerical simulation studies on a microscopic traffic simulator are carried out to show the benefits of the proposed method.  相似文献   

17.
文章针对当前通行费拆分方法存在的问题,提出了基于超高频无源RFID技术的高速公路通行费拆分方法,阐述了该方法的应用模式及流程,并从技术和政策角度论证了该方法应用的可行性。  相似文献   

18.
    
Travel information continues to receive significant attention in the field of travel behaviour research, as it is expected to help reduce congestion by directing the network state from a user equilibrium towards a more efficient system optimum. This literature review contributes to the existing literature in at least two ways. First, it considers both the individual perspective and the network perspective when assessing the potential effects of travel information, in contrast to earlier studies. Secondly, it highlights the role of bounded rationality as well as that of non-selfish behaviour in route choice and in response to information, complementing earlier reviews that mostly focused on bounded rationality only. It is concluded that information strategies should be tailor-made to an individual's level of rationality as well as level of selfishness in order to approach system-optimal conditions on the network level. Moreover, initial ideas and future research directions are provided for assessing the potential of travel information in order to improve network efficiency of existing road networks.  相似文献   

19.
    
Estimates of road speeds have become commonplace and central to route planning, but few systems in production provide information about the reliability of the prediction. Probabilistic forecasts of travel time capture reliability and can be used for risk-averse routing, for reporting travel time reliability to a user, or as a component of fleet vehicle decision-support systems. Many of these uses (such as those for mapping services like Bing or Google Maps) require predictions for routes in the road network, at arbitrary times; the highest-volume source of data for this purpose is GPS data from mobile phones. We introduce a method (TRIP) to predict the probability distribution of travel time on an arbitrary route in a road network at an arbitrary time, using GPS data from mobile phones or other probe vehicles. TRIP captures weekly cycles in congestion levels, gives informed predictions for parts of the road network with little data, and is computationally efficient, even for very large road networks and datasets. We apply TRIP to predict travel time on the road network of the Seattle metropolitan region, based on large volumes of GPS data from Windows phones. TRIP provides improved interval predictions (forecast ranges for travel time) relative to Microsoft’s engine for travel time prediction as used in Bing Maps. It also provides deterministic predictions that are as accurate as Bing Maps predictions, despite using fewer explanatory variables, and differing from the observed travel times by only 10.1% on average over 35,190 test trips. To our knowledge TRIP is the first method to provide accurate predictions of travel time reliability for complete, large-scale road networks.  相似文献   

20.
文章基于现今城市干道平面交叉口交通流量密集的状况,分析讨论影响平面交叉口安全管理的因素,提出了交叉口安全管理方法和一些改进措施,为提高城市道路交叉口的交通安全管理提供依据。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号