首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we propose a link-node complementarity model for the basic deterministic dynamic user equilibrium (DUE) problem with single-user-class and fixed demands. The model complements link-path formulations that have been widely studied for dynamic user equilibria. Under various dynamic network constraints, especially the exact flow propagation constraints, we show that the continuous-time dynamic user equilibrium problem can be formulated as an infinite dimensional mixed complementarity model. The continuous-time model can be further discretized as a finite dimensional non-linear complementarity problem (NCP). The proposed discrete-time model captures the exact flow propagation constraints that were usually approximated in previous studies. By associating link inflow at the beginning of a time interval to travel times at the end of the interval, the resulting discrete-time model is predictive rather than reactive. The solution existence and compactness condition for the proposed model is established under mild assumptions. The model is solved by an iterative algorithm with a relaxed NCP solved at each iteration. Numerical examples are provided to illustrate the proposed model and solution approach. We particularly show why predictive DUE is preferable to reactive DUE from an algorithmic perspective.  相似文献   

2.
A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.  相似文献   

3.
This paper studies link travel time estimation using entry/exit time stamps of trips on a steady-state transportation network. We propose two inference methods based on the likelihood principle, assuming each link associates with a random travel time. The first method considers independent and Gaussian distributed link travel times, using the additive property that trip time has a closed-form distribution as the summation of link travel times. We particularly analyze the mean estimates when the variances of trip time estimates are known with a high degree of precision and examine the uniqueness of solutions. Two cases are discussed in detail: one with known paths of all trips and the other with unknown paths of some trips. We apply the Gaussian mixture model and the Expectation–Maximization (EM) algorithm to deal with the latter. The second method splits trip time proportionally among links traversed to deal with more general link travel time distributions such as log-normal. This approach builds upon an expected log-likelihood function which naturally leads to an iterative procedure analogous to the EM algorithm for solutions. Simulation tests on a simple nine-link network and on the Sioux Falls network respectively indicate that the two methods both perform well. The second method (i.e., trip splitting approximation) generally runs faster but with larger errors of estimated standard deviations of link travel times.  相似文献   

4.
This paper proposes a novel semi-analytical approach for solving the dynamic user equilibrium (DUE) of a bottleneck model with general heterogeneous users. The proposed approach makes use of the analytical solutions from the bottleneck analysis to create an equivalent assignment problem that admits closed-form commute cost functions. The equivalent problem is a static and asymmetric traffic assignment problem, which can be formulated as a variational inequality problem (VIP). This approach provides a new tool to analyze the properties of the bottleneck model with general heterogeneity, and to design efficient solution methods. In particular, the existence and uniqueness of the DUE solution can be established using the P-property of the Jacobian matrix. Our numerical experiments show that a simple decomposition algorithm is able to quickly solve the equivalent VIP to high precision. The proposed VIP formation is also extended to address simultaneous departure time and route choice in a single O–D origin-destination network with multiple parallel routes.  相似文献   

5.
The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.  相似文献   

6.
The paper presents a statistical model for urban road network travel time estimation using vehicle trajectories obtained from low frequency GPS probes as observations, where the vehicles typically cover multiple network links between reports. The network model separates trip travel times into link travel times and intersection delays and allows correlation between travel times on different network links based on a spatial moving average (SMA) structure. The observation model presents a way to estimate the parameters of the network model, including the correlation structure, through low frequency sampling of vehicle traces. Link-specific effects are combined with link attributes (speed limit, functional class, etc.) and trip conditions (day of week, season, weather, etc.) as explanatory variables. The approach captures the underlying factors behind spatial and temporal variations in speeds, which is useful for traffic management, planning and forecasting. The model is estimated using maximum likelihood. The model is applied in a case study for the network of Stockholm, Sweden. Link attributes and trip conditions (including recent snowfall) have significant effects on travel times and there is significant positive correlation between segments. The case study highlights the potential of using sparse probe vehicle data for monitoring the performance of the urban transport system.  相似文献   

7.
In this paper, we study the preferences for uncertain travel times in which probability distributions may not be fully characterized. In evaluating an uncertain travel time, we explicitly distinguish between risk, where the probability distribution is precisely known, and ambiguity, where it is not. In particular, we propose a new criterion called ambiguity-aware CARA travel time (ACT) for evaluating uncertain travel times under various attitudes of risk and ambiguity, which is a preference based on blending the Hurwicz criterion and Constant Absolute Risk Aversion (CARA). More importantly, we show that when the uncertain link travel times are independently distributed, finding the path that minimizes travel time under the ACT criterion is essentially a shortest path problem. We also study the implications on Network Equilibrium (NE) model where travelers on the traffic network are characterized by their knowledge of the network uncertainty as well as their risk and ambiguity attitudes under the ACT. We derive and analyze the existence and uniqueness of solutions under NE. Finally, we obtain the Price of Anarchy that characterizes the inefficiency of this new equilibrium. The computational study suggests that as uncertainty increases, the influence of selfishness on inefficiency diminishes.  相似文献   

8.
The network design problem is usually formulated as a bi-level program, assuming the user equilibrium is attained in the lower level program. Given boundedly rational route choice behavior, the lower-level program is replaced with the boundedly rational user equilibria (BRUE). The network design problem with boundedly rational route choice behavior is understudied due to non-uniqueness of the BRUE. In this study, thus, we mainly focus on boundedly rational toll pricing (BR-TP) with affine link cost functions. The topological properties of the lower level BRUE set are first explored. As the BRUE solution is generally non-unique, urban planners cannot predict exactly which equilibrium flow pattern the transportation network will operate after a planning strategy is implemented. Due to the risk caused by uncertainty of people’s reaction, two extreme scenarios are considered: the traffic flow patterns with either the minimum system travel cost or the maximum, which is the “risk-prone” (BR-TP-RP) or the “risk-averse” (BR-TP-RA) scenario respectively. The upper level BR-TP is to find an optimal toll minimizing the total system travel cost, while the lower level is to find the best or the worst scenario. Accordingly BR-TP can be formulated as either a min –min or a min –max program. Solution existence is discussed based on the topological properties of the BRUE and algorithms are proposed. Two examples are accompanied to illustrate the proposed methodology.  相似文献   

9.
Moving bottlenecks in highway traffic are defined as a situation in which a slow-moving vehicle, be it a truck hauling heavy equipment or an oversized vehicle, or a long convey, disrupts the continuous flow of the general traffic. The effect of moving bottlenecks on traffic flow is an important factor in the evaluation of network performance. This effect, though, cannot be assessed properly by existing transportation tools, especially when the bottleneck travels relatively long distances in the network.This paper develops a dynamic traffic assignment (DTA) model that can evaluate the effects of moving bottlenecks on network performance in terms of both travel times and traveling paths. The model assumes that the characteristics of the moving bottleneck, such as traveling path, physical dimensions, and desired speed, are predefined and, therefore, suitable for planned conveys.The DTA model is based on a mesoscopic simulation network-loading procedure with unique features that allow assessing the special dynamic characteristics of a moving bottleneck. By permitting traffic density and speed to vary along a link, the simulation can capture the queue caused by the moving bottleneck while preserving the causality principles of traffic dynamics.  相似文献   

10.
In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.  相似文献   

11.
In this paper, we present an approach for determining dynamic user equilibria. The method is suitable for disaggregated microscopic and mesoscopic simulation-based models. It is a modification of the convex-simplex method, which disposes with the line search step, and controls the subset of travelers to be re-routed at each step while updating the link travel times after each assignment. To guarantee finite termination, a suitable stopping criterion is adopted. The proposed method is implemented within TRANSIMS, the Transportation Analysis and Simulation System, as a two-stage process that employs a combined use of link performance functions and a microsimulator in order to design a framework suitable for application to real transportation systems. To demonstrate this capability, we apply the developed methodology to a large-scale network, Bignet, which is part of the transportation city network of Portland, Oregon; and a medium-scale network, Blacksburg, Virginia; and provide some comparative analyses. Our results exhibit that an improved distribution of travelers is obtained while consuming less than 17–33% of the effort required by the current version of TRANSIMS.  相似文献   

12.
In this paper we present a continuous-time network loading procedure based on the Lighthill–Whitham–Richards model proposed by Lighthill and Whitham, 1955, Richards, 1956. A system of differential algebraic equations (DAEs) is proposed for describing traffic flow propagation, travel delay and route choices. We employ a novel numerical apparatus to reformulate the scalar conservation law as a flow-based partial differential equation (PDE), which is then solved semi-analytically with the Lax–Hopf formula. This approach allows for an efficient computational scheme for large-scale networks. We embed this network loading procedure into the dynamic user equilibrium (DUE) model proposed by Friesz et al. (1993). The DUE model is solved as a differential variational inequality (DVI) using a fixed-point algorithm. Several numerical examples of DUE on networks of varying sizes are presented, including the Sioux Falls network with a significant number of paths and origin–destination pairs (OD).The DUE model presented in this article can be formulated as a variational inequality (VI) as reported in Friesz et al. (1993). We will present the Kuhn–Tucker (KT) conditions for that VI, which is a linear system for any given feasible solution, and use them to check whether a DUE solution has been attained. In order to solve for the KT multiplier we present a decomposition of the linear system that allows efficient computation of the dual variables. The numerical solutions of DUE obtained from fixed-point iterations will be tested against the KT conditions and validated as legitimate solutions.  相似文献   

13.
Recent research has investigated various means of measuring link travel times on freeways. This search has been motivated in part by the fact that travel time is considered to be more informative to users than local velocity measurements at a detector station. But direct travel time measurement requires the correlation of vehicle observations at multiple locations, which in turn requires new communications infrastructure and/or new detector hardware. This paper presents a method for estimating link travel time using data from an individual dual loop detector, without requiring any new hardware. The estimation technique exploits basic traffic flow theory to extrapolate local conditions to an extended link. In the process of estimating travel times, the algorithm also estimates vehicle trajectories. The work demonstrates that the travel time estimates are very good provided there are no sources of delay, such as an incident, within a link.  相似文献   

14.
The paper adopts the framework employed by the existing dynamic assignment models, which analyse specific network forms, and develops a methodology for analysing general networks. Traffic conditions within a link are assumed to be homogeneous, and the time varying O-D travel times and traffic flow patterns are calculated using elementary relationships from traffic flow theory and link volume conservation equations. Each individual is assumed to select a departure time and a route by trading off the travel time and schedule delay associated with each alternative. A route is considered as reasonable if it includes only links which do not take the traveller back to the origin. The set of reasonable routes is not consistant but depends on the time that an individual decides to depart from his origin. Equilibrium distributions are derived from a Markovian model which describes the evolution of travel patterns from day to day. Numerical simulation experiments are conducted to analyse the impact of different work start time flexibilities on the time dependent travel patterns. The similarity between link flows and travel times obtained from static and dynamic stochastic assignment is investigated. It is shown that in congested networks the application of static assignment results in travel times which are lower than the ones predicted by dynamic assignment.  相似文献   

15.
Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.  相似文献   

16.
In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.  相似文献   

17.
This paper presents a transparent approach to the analysis of dynamic user equilibrium and clarifies the properties of a departure-time choice equilibrium of a corridor problem where discrete multiple bottlenecks exist along a freeway. The basis of our approach is the transformation of the formulation of equilibrium conditions in a conventional “Eulerian coordinate system” into one in a “Lagrangian-like coordinate system.” This enables us to evaluate dynamic travel times easily, and to achieve a deep understanding of the mathematical structure of the problem, in particular, about the properties of the demand and supply (queuing) sub-models, relations with dynamic system optimal assignment, and differences between the morning and evening rush problems. Building on these foundations, we establish rigorous results on the existence and uniqueness of equilibria.  相似文献   

18.
Speed limits are usually imposed on roads in an attempt to enhance safety and sometimes serve the purpose of reducing fuel consumption and vehicular emissions as well. Most previous studies up to date focus on investigation of the effects of speed limits from a local perspective, while network-wide traffic reallocation effects are overlooked. This paper makes the first attempt to investigate how a link-specific speed limit law reallocates traffic flow in an equilibrium manner at a macroscopic network level. We find that, although the link travel time–flow relationship is altered after a speed limit is imposed, the standard traffic assignment method still applies. With the commonly adopted assumptions, the uniqueness of link travel times at user equilibrium (UE) remains valid, and the UE flows on links with non-binding speed limits are still unique. The UE flows on other links with binding speed limits may not be unique but can be explicitly characterized by a polyhedron or a linear system of equalities and inequalities. Furthermore, taking into account the traffic reallocation effects of speed limits, we compare the capability of speed limits and road pricing for decentralizing desirable network flow patterns. Although from a different perspective for regulating traffic flows with a different mechanism, a speed limit law may play the same role as a toll charge scheme and perform better than some negative (rebate) toll schemes under certain conditions for network flow management.  相似文献   

19.
This paper formulates a network design problem (NDP) for finding the optimal public transport service frequencies and link capacity expansions in a multimodal network with consideration of impacts from adverse weather conditions. The proposed NDP aims to minimize the sum of expected total travel time, operational cost of transit services, and construction cost of link capacity expansions under an acceptable level of variance of total travel time. Auto, transit, bus, and walking modes are considered in the multimodal network model for finding the equilibrium flows and travel times. In the proposed network model, demands are assumed to follow Poisson distribution, and weather‐dependent link travel time functions are adopted. A probit‐based stochastic user equilibrium, which is based on the perceived expected travel disutility, is used to determine the multimodal route of the travelers. This model also considers the strategic behavior of the public transport travelers in choosing their routes, that is, common‐line network. Based on the stochastic multimodal model, the mean and variance of total travel time are analytical estimated for setting up the NDP. A sensitivity‐based solution algorithm is proposed for solving the NDP, and two numerical examples are adopted to demonstrate the characteristics of the proposed model. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   

20.
Advances in connected and automated vehicle technologies have resulted in new vehicle applications, such as cooperative adaptive cruise control (CACC). Microsimulation models have shown significant increases in capacity and stability due to CACC, but most previous work has relied on microsimulation. To study the effects of CACC on larger networks and with user equilibrium route choice, we incorporate CACC into the link transmission model (LTM) for dynamic network loading. First, we derive the flow-density relationship from the MIXIC car-following model of CACC (at 100% CACC market penetration). The flow-density relationship has an unusual shape; part of the congested regime has an infinite congested wave speed. However, we verify that the flow predictions match observations from MIXIC modeled in VISSIM. Then, we use the flow-density relationship from MIXIC in LTM. Although the independence of separate links restricts the maximum congested wave speed, for common freeway link lengths the congested wave speed is sufficiently high to fit the observed flows from MIXIC. Results on a freeway and regional networks (with CACC-exclusive lanes) indicate that CACC could reduce freeway congestion, but naïve deployment of CACC-exclusive lanes could cause an increase in total system travel time.  相似文献   

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

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