首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 515 毫秒
1.
Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.  相似文献   

2.
This paper proposes a generalized model to estimate the peak hour origin–destination (OD) traffic demand variation from day-to-day hourly traffic counts throughout the whole year. Different from the conventional OD estimation methods, the proposed modeling approach aims to estimate not only the mean but also the variation (in terms of covariance matrix) of the OD demands during the same peak hour periods due to day-to-day fluctuation over the whole year. For this purpose, this paper fully considers the first- and second-order statistical properties of the day-to-day hourly traffic count data so as to capture the stochastic characteristics of the OD demands. The proposed model is formulated as a bi-level optimization problem. In the upper-level problem, a weighted least squares method is used to estimate the mean and covariance matrix of the OD demands. In the lower-level problem, a reliability-based traffic assignment model is adopted to take account of travelers’ risk-taking path choice behaviors under OD demand variation. A heuristic iterative estimation-assignment algorithm is proposed for solving the bi-level optimization problem. Numerical examples are presented to illustrate the applications of the proposed model for assessment of network performance over the whole year.  相似文献   

3.
Asakura  Yasuo  Hato  Eiji  Kashiwadani  Masuo 《Transportation》2000,27(4):419-438
The Automatic Vehicle Identification (AVI) system was recently installed in expressway networks in Japan. License plate numbers of passing vehicles are monitored through roadside AVI cameras and then recognized. This paper shows the formulation of origin and destination (OD) matrices estimation model using the observed data with the AVI system. The results of license plate matching between a pair of AVI cameras are involved as the input variables. The formulated model is a least squares model and yields to the linear transformation of the partly observed OD matrices. The model is applied to the Kobe corridor line in the Han-Shin expressway network. It is found that the estimated OD matrix is consistent with the one using the previous mail survey. The proposed estimation method is expected to investigate the day-to-day fluctuations of OD patterns in the expressway network.  相似文献   

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

5.
We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献   

6.
Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester.  相似文献   

7.
This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra‐like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

8.
The simultaneous perturbation stochastic approximation (SPSA) algorithm has been used in the literature for the solution of the dynamic origin–destination (OD) estimation problem. Its main advantage is that it allows quite general formulations of the problem that can include a wide range of sensor measurements. While SPSA is relatively simple to implement, its performance depends on a set of parameters that need to be properly determined. As a result, especially in cases where the gradient of the objective function changes quickly, SPSA may not be as stable and even diverge. A modification of the SPSA algorithm, referred to as c-SPSA, is proposed which applies the simultaneous perturbation approximation of the gradient within a small number of carefully constructed “homogeneous” clusters one at a time, as opposed to all elements at once. The paper establishes the theoretical properties of the new algorithm with an upper bound for the bias of the gradient estimate and shows that it is lower than the corresponding SPSA bias. It also proposes a systematic approach, based on the k-means algorithm, to identify appropriate clusters. The performance of c-SPSA, with alternative implementation strategies, is evaluated in the context of estimating OD flows in an actual urban network. The results demonstrate the efficiency of the proposed c-SPSA algorithm in finding better OD estimates and achieve faster convergence and more robust performance compared to SPSA with fewer overall number of function evaluations.  相似文献   

9.
Origin-destination (OD) pattern estimation is a vital step for traffic simulation applications and active urban traffic management. Many methods have been proposed to estimate OD patterns based on different data sources, such as GPS data and automatic license plate recognition (ALPR) data. These data can be used to identify vehicle IDs and estimate their trajectories by matching vehicles identified by different sensors across the network. OD pattern estimation using ALPR data remains a challenge in real-life applications due to the difficulty in reconstructing vehicle trajectories. This paper proposes an offline method for historical OD pattern estimation based on ALPR data. A particle filter is used to estimate the probability of a vehicle’s trajectory from all possible candidate trajectories. The initial particles are generated by searching potential paths in a pre-determined area based on the time geography theory. Then, the path flow estimation process is conducted through dividing the reconstructed complete trajectories of all detected vehicles into multiple trips. Finally, the OD patterns are estimated by adding up the path flows with the same ODs. The proposed method was implemented on a real-world traffic network in Kunshan, China and verified through a calibrated microscopic traffic simulation model. The results show that the MAPEs of the OD estimation are lower than 19%. Further investigation shows that there exists a minimum required ALPR sampling rate (60% in the test network) for accurately estimating the OD patterns. The findings of this study demonstrate the effectiveness of the proposed method in OD pattern estimation.  相似文献   

10.
A real option portfolio management framework is proposed to make use of an adaptive network design problem developed using stochastic dynamic programming methodologies. The framework is extended from Smit’s and Trigeorgis’ option portfolio framework to incorporate network synergies. The adaptive planning framework is defined and tested on a case study with time series origin-destination demand data. Historically, OD time series data is costly to obtain, and there has not been much need for it because most transportation models use a single time-invariant estimate based on deterministic forecasting of demand. Despite the high cost and institutional barriers of obtaining abundant OD time series data, we illustrate how having higher fidelity data along with an adaptive planning framework can result in a number of improved management strategies. An insertion heuristic is adopted to run the lower bound adaptive network design problem for a coarse Iran network with 834 nodes, 1121 links, and 10 years of time series data for 71,795 OD pairs.  相似文献   

11.
Previous research has combined automated fare-collection (AFC) and automated vehicle-location (AVL) data to infer the times and locations of passenger origins, interchanges (transfers), and destinations on multimodal transit networks. The resultant origin–interchange–destination flows (and the origin–destination (OD) matrices that comprise those flows), however, represent only a sample of total ridership, as they contain only those journeys made using the AFC payment method that have been successfully recorded or inferred. This paper presents a method for scaling passenger-journey flows (i.e., linked-trip flows) using additional information from passenger counts at each station gate and bus farebox, thereby estimating the flows of non-AFC passengers and of AFC passengers whose journeys were not successfully inferred.The proposed method is applied to a hypothetical test network and to AFC and AVL data from London’s multimodal public transit network. Because London requires AFC transactions upon both entry and exit for rail trips, a rail-only OD matrix is extracted from the estimated multimodal linked-trip flows, and is compared to a rail OD matrix generated using the iterative proportional fitting method.  相似文献   

12.
In this paper, we present a validation of public transport origin–destination (OD) matrices obtained from smartcard and GPS data. These matrices are very valuable for management and planning but have not been validated until now. In this work, we verify the assumptions and results of the method using three sources of information: the same database used to make the estimations, a Metro OD survey in which the card numbers are registered for a group of users, and a sample of volunteers. The results are very positive, as the percentages of correct estimation are approximately 90% in all cases.  相似文献   

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

14.
This study evaluates an existing bus network from the perspectives of passengers, operators, and overall system efficiency using the output of a previously developed transportation network optimisation model. This model is formulated as a bi-level optimisation problem with a transit assignment model as the lower problem. The upper problem is also formulated as bi-level optimisation problem to minimise costs for both passengers and operators, making it possible to evaluate the effects of reducing operator cost against passenger cost. A case study based on demand data for Hiroshima City confirms that the current bus network is close to the Pareto front, if the total costs to both passengers and operators are adopted as objective functions. However, the sensitivity analysis with regard to the OD pattern fluctuation indicates that passenger and operator costs in the current network are not always close to the Pareto front. Finally, the results suggests that, regardless of OD pattern fluctuation, reducing operator costs will increase passenger cost and increase inequity in service levels among passengers.  相似文献   

15.
This paper proposes a new model to estimate the mean and covariance of stochastic multi-class (multiple vehicle classes) origin–destination (OD) demands from hourly classified traffic counts throughout the whole year. It is usually assumed in the conventional OD demand estimation models that the OD demand by vehicle class is deterministic. Little attention is given on the estimation of the statistical properties of stochastic OD demands as well as their covariance between different vehicle classes. Also, the interactions between different vehicle classes in OD demand are ignored such as the change of modes between private car and taxi during a particular hourly period over the year. To fill these two gaps, the mean and covariance matrix of stochastic multi-class OD demands for the same hourly period over the year are simultaneously estimated by a modified lasso (least absolute shrinkage and selection operator) method. The estimated covariance matrix of stochastic multi-class OD demands can be used to capture the statistical dependency of traffic demands between different vehicle classes. In this paper, the proposed model is formulated as a non-linear constrained optimization problem. An exterior penalty algorithm is adapted to solve the proposed model. Numerical examples are presented to illustrate the applications of the proposed model together with some insightful findings on the importance of covariance of OD demand between difference vehicle classes.  相似文献   

16.
Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.  相似文献   

17.
This paper presents a study that characterizes, formulates, and solves the reverse logistic recycling flow equilibrium (RLRFE) problem. The RLRFE problem is concerned with the recycling channel in which recyclable collectors, processors, landfills, and demand markets form a multi-tiered network to process the recycled material flows from sources destined either for landfills or demand markets. Motivated by a government policy making or enterprise conglomerate recycling system design and operation needs, the RLRFE problem is elaborated from a system-optimal perspective using the variational inequality (VI) approach. For each origin–destination (OD) pair, the corresponding equilibrium conditions are established as a variation of the Wardrop second principle. In light of demand and cost function interactions, a nested diagonalization solution (ND) algorithm is proposed that gradually transforms the RLRFE problem into a traffic assignment model. To address multiple landfills in the recycling network and to understand how a variable-demand problem can be analyzed as a fixed-demand problem, we propose a supernetwork representation of the RLRFE problem. A numerical analysis on a test case illustrates the model formulation and the proposed algorithm.  相似文献   

18.
This study develops a methodology to model transportation network design with signal settings in the presence of demand uncertainty. It is assumed that the total travel demand consists of commuters and infrequent travellers. The commuter travel demand is deterministic, whereas the demand of infrequent travellers is stochastic. Variations in demand contribute to travel time uncertainty and affect commuters’ route choice behaviour. In this paper, we first introduce an equilibrium flow model that takes account of uncertain demand. A two-stage stochastic program is then proposed to formulate the network signal design under demand uncertainty. The optimal control policy derived under the two-stage stochastic program is able to (1) optimize the steady-state network performance in the long run, and (2) respond to short-term demand variations. In the first stage, a base signal control plan with a buffer against variability is introduced to control the equilibrium flow pattern and the resulting steady-state performance. In the second stage, after realizations of the random demand, recourse decisions of adaptive signal settings are determined to address the occasional demand overflows, so as to avoid transient congestion. The overall objective is to minimize the expected total travel time. To solve the two-stage stochastic program, a concept of service reliability associated with the control buffer is introduced. A reliability-based gradient projection algorithm is then developed. Numerical examples are performed to illustrate the properties of the proposed control method as well as its capability of optimizing steady-state performance while adaptively responding to changing traffic flows. Comparison results show that the proposed method exhibits advantages over the traditional mean-value approach in improving network expected total travel times.  相似文献   

19.
Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.  相似文献   

20.
First-best marginal cost toll for a traffic network with stochastic demand   总被引:1,自引:0,他引:1  
First-best marginal cost pricing (MCP) in traffic networks has been extensively studied with the assumption of deterministic travel demand. However, this assumption may not be realistic as a transportation network is exposed to various uncertainties. This paper investigates MCP in a traffic network under stochastic travel demand. Cases of both fixed and elastic demand are considered. In the fixed demand case, travel demand is represented as a random variable, whereas in the elastic demand case, a pre-specified random variable is introduced into the demand function. The paper also considers a set of assumptions of traveler behavior. In the first case, it is assumed that the traveler considers only the mean travel time in the route choice decision (risk-neutral behavior), and in the second, both the mean and the variance of travel time are introduced into the route choice model (risk-averse behavior). A closed-form formulation of the true marginal cost toll for the stochastic network (SN-MCP) is derived from the variational inequality conditions of the system optimum and user equilibrium assignments. The key finding is that the calculation of the SN-MCP model cannot be made by simply substituting related terms in the original MCP model by their expected values. The paper provides a general function of SN-MCP and derives the closed-form SN-MCP formulation for specific cases with lognormal and normal stochastic travel demand. Four numerical examples are explored to compare network performance under the SN-MCP and other toll regimes.  相似文献   

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

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