首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Travel time is an important performance measure for transportation systems, and dissemination of travel time information can help travelers make reliable travel decisions such as route choice or departure time. Since the traffic data collected in real time reflects the past or current conditions on the roadway, a predictive travel time methodology should be used to obtain the information to be disseminated. However, an important part of the literature either uses instantaneous travel time assumption, and sums the travel time of roadway segments at the starting time of the trip, or uses statistical forecasting algorithms to predict the future travel time. This study benefits from the available traffic flow fundamentals (e.g. shockwave analysis and bottleneck identification), and makes use of both historical and real time traffic information to provide travel time prediction. The methodological framework of this approach sequentially includes a bottleneck identification algorithm, clustering of traffic data in traffic regimes with similar characteristics, development of stochastic congestion maps for clustered data and an online congestion search algorithm, which combines historical data analysis and real-time data to predict experienced travel times at the starting time of the trip. The experimental results based on the loop detector data on Californian freeways indicate that the proposed method provides promising travel time predictions under varying traffic conditions.  相似文献   

2.
This paper investigates the problem of finding the K reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. The KRSP problem extends the classical K loopless shortest paths problem to the stochastic networks by explicitly considering travel time reliability. In this study, a deviation path approach is established for finding K α-reliable paths in stochastic networks. A deviation path algorithm is proposed to exactly solve the KRSP problem in large-scale networks. The A* technique is introduced to further improve the KRSP finding performance. A case study using real traffic information is performed to validate the proposed algorithm. The results indicate that the proposed algorithm can determine KRSP under various travel time reliability values within reasonable computational times. The introduced A* technique can significantly improve KRSP finding performance.  相似文献   

3.
In this paper, a multi‐step ahead prediction algorithm of link travel speeds has been developed using a Kalman filtering technique in order to calculate a dynamic shortest path. The one‐step and the multi‐step ahead link travel time prediction models for the calculation of the dynamic shortest path have been applied to the directed test network that is composed of 16 nodes: 3 entrance nodes, 2 exit nodes and 11 internal nodes. Time‐varying traffic conditions such as flows and travel time data for the test network have been generated using the CORSIM model. The results show that the multi‐step ahead algorithm is compared more favorably for searching the dynamic shortest time path than the other algorithm.  相似文献   

4.
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.  相似文献   

5.
Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD‐RSPP) is formulated as a multi‐criteria shortest path‐finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD‐RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real‐time basis for large‐scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

6.
With a particular emphasis on the end-to-end travel time prediction problem, this paper proposes an information-theoretic sensor location model that aims to minimize total travel time uncertainties from a set of point, point-to-point and probe sensors in a traffic network. Based on a Kalman filtering structure, the proposed measurement and uncertainty quantification models explicitly take into account several important sources of errors in the travel time estimation/prediction process, such as the uncertainty associated with prior travel time estimates, measurement errors and sampling errors. By considering only critical paths and limited time intervals, this paper selects a path travel time uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework with a unified modeling of both recurring and non-recurring traffic conditions. An analytical determinant maximization model and heuristic beam-search algorithm are used to find an effective lower bound and solve the combinatorial sensor selection problem. A number of illustrative examples and one case study are used to demonstrate the effectiveness of the proposed methodology.  相似文献   

7.
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.  相似文献   

8.
In this study, we propose a travel itinerary problem (TIP) which aims to find itineraries with the lowest cost for travelers visiting multiple cities, under the constraints of time horizon, stop times at cities and transport alternatives with fixed departure times, arrival times, and ticket prices. First, we formulate the TIP into a 0–1 integer programming model. Then, we decompose the itinerary optimization into a macroscopic tour (i.e., visiting sequence between cities) selection process and a microscopic number (i.e., flight number, train number for each piece of movement) selection process, and use an implicit enumeration algorithm to solve the optimal combination of tour and numbers. By integrating the itinerary optimization approach and Web crawler technology, we develop a smart travel system that is able to capture online transport data and recommend the optimal itinerary that satisfies travelers’ preferences in departure time, arrival time, cabin class, and transport mode. Finally, we present case studies based on real-life transport data to illustrate the usefulness of itinerary optimization for minimizing travel cost, the computational efficiency of the implicit enumeration algorithm, and the feasibility of the smart travel system.  相似文献   

9.
Travel time is an effective measure of roadway traffic conditions. The provision of accurate travel time information enables travelers to make smart decisions about departure time, route choice and congestion avoidance. Based on a vast amount of probe vehicle data, this study proposes a simple but efficient pattern-matching method for travel time forecasting. Unlike previous approaches that directly employ travel time as the input variable, the proposed approach resorts to matching large-scale spatiotemporal traffic patterns for multi-step travel time forecasting. Specifically, the Gray-Level Co-occurrence Matrix (GLCM) is first employed to extract spatiotemporal traffic features. The Normalized Squared Differences (NSD) between the GLCMs of current and historical datasets serve as a basis for distance measurements of similar traffic patterns. Then, a screening process with a time constraint window is implemented for the selection of the best-matched candidates. Finally, future travel times are forecasted as a negative exponential weighted combination of each candidate’s experienced travel time for a given departure. The proposed approach is tested on Ring 2, which is a 32km urban expressway in Beijing, China. The intermediate procedures of the methodology are visualized by providing an in-depth quantitative analysis on the speed pattern matching and examples of matched speed contour plots. The prediction results confirm the desirable performance of the proposed approach and its robustness and effectiveness in various traffic conditions.  相似文献   

10.
Path travel time reliability is an essential measure of the quality of service for transportation systems and an important attribute in travelers’ route and departure time scheduling. This paper investigates a fundamental problem of finding the most reliable path under different spatial correlation assumptions, where the path travel time variability is represented by its standard deviation. To handle the non-linear and non-additive cost functions introduced by the quadratic forms of the standard deviation term, a Lagrangian substitution approach is adopted to estimate the lower bound of the most reliable path solution through solving a sequence of standard shortest path problems. A subgradient algorithm is used to iteratively improve the solution quality by reducing the optimality gap. To characterize the link travel time correlation structure associated with the end-to-end trip time reliability measure, this research develops a sampling-based method to dynamically construct a proxy objective function in terms of travel time observations from multiple days. The proposed algorithms are evaluated under a large-scale Bay Area, California network with real-world measurements.  相似文献   

11.
In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.  相似文献   

12.
Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

13.
This paper investigates the transportation network reliability based on the information provided by detectors installed on some links. A traffic flow simulator (TFS) model is formulated for assessing the network reliability (in terms of travel time reliability), in which the variation of perceived travel time error and the fluctuations of origin-destination (OD) demand are explicitly considered. On the basis of prior OD demand and partial updated detector data, the TFS can estimate the link flows for the whole network together with link/path travel times, and their variance and covariance. The travel time reliability by OD pair can also be assessed and the OD matrix can be updated simultaneously. A Monte Carlo based algorithm is developed to solve the TFS model. The application of the proposed TFS model is illustrated by a numerical example.  相似文献   

14.
This paper presents a Bayesian inference-based dynamic linear model (DLM) to predict online short-term travel time on a freeway stretch. The proposed method considers the predicted freeway travel time as the sum of the median of historical travel times, time-varying random variations in travel time, and a model evolution error, where the median is employed to recognize the primary travel time pattern while the variation captures unexpected supply (i.e. capacity) reduction and demand fluctuations. Bayesian forecasting is a learning process that revises sequentially the state of a priori knowledge of travel time based on newly available information. The prediction result is a posterior travel time distribution that can be employed to generate a single-value (typically but not necessarily the mean) travel time as well as a confidence interval representing the uncertainty of travel time prediction. To better track travel time fluctuations during non-recurrent congestion due to unforeseen events (e.g., incidents, accidents, or bad weather), the DLM is integrated into an adaptive control framework that can automatically learn and adjust the system evolution noise level. The experiment results based on the real loop detector data of an I-66 segment in Northern Virginia suggest that the proposed method is able to provide accurate and reliable travel time prediction under both recurrent and non-recurrent traffic conditions.  相似文献   

15.
Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.  相似文献   

16.
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.  相似文献   

17.
We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.  相似文献   

18.
Travel time estimation and prediction on urban arterials is an important component of Active Traffic and Demand Management Systems (ATDMS). This paper aims in using the information of GPS probes to augment less dynamic but available information describing arterial travel times. The direction followed in this paper chooses a cooperative approach in travel time estimation using static information describing arterial geometry and signal timing, semi-dynamic information of historical travel time distributions per time of day, and utilizes GPS probe information to augment and improve the latter. First, arterial travel times are classified by identifying different travel time states, then link travel time distributions are approximated using mixtures of normal distributions. If prior travel time data is available, travel time distributions can be estimated empirically. Otherwise, travel time distribution can be estimated based on signal timing and arterial geometry. Real-time GPS travel time data is then used to identify the current traffic condition based on Bayes Theorem. Moreover, these GPS data can also be used to update the parameters of the travel time distributions using a Bayesian update. The iterative update process makes the posterior distributions more and more accurate. Finally, two comprehensive case studies using the NGSIM Peachtree Street dataset, and GPS data of Washington Avenue in Minneapolis, were conducted. The first case study estimated prior travel time distributions based on signal timing and arterial geometry under different traffic conditions. Travel time data were classified and corresponding distributions were updated. In addition, results from the Bayesian update and EM algorithm were compared. The second case study first tested the methodologies based on real GPS data and showed the importance of sample size. In addition, a methodology was proposed to distinguish new traffic conditions in the second case study.  相似文献   

19.
This paper proposes a new travel time reliability‐based traffic assignment model to investigate the rain effects on risk‐taking behaviours of different road users in networks with day‐to‐day demand fluctuations and variations in travel time. A generalized link travel time function is used to capture the rain effects on vehicle travel times and road conditions. This function is further incorporated into daily demand variations to investigate those travel time variations arising from demand uncertainty and rain condition. In view of these rain effects, road users' perception errors on travel times and risk‐taking behaviours on path choices are incorporated in the proposed model with the use of a logit‐based stochastic user equilibrium framework. This new model is formulated as a variational inequality problem in terms of path flows. A numerical example is used to illustrate the application of the proposed model for assessment of the rain effects on road networks with uncertainty.  相似文献   

20.
This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

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

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