Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/traffic-estimation-and-optimal-counting-location-without-path-844A0MHwKC
References (66)
-
(1998)
The link nested logit model -
G. Cantarella, Mario Binetti (2002)
STOCHASTIC ASSIGNMENT WITH GAMMIT PATH CHOICE MODELS -
Vardi Vardi (1996)
Network tomography: estimating source‐destination traffic intensities from link dataJournal of the American Statistical Asociation, 91
-
J. Wardrop (1952)
Some Theoretical Aspects of Road Traffic Research, 1
-
S. Pallottino, M. Scutellá (1997)
Shortest Path Algorithms in Transportation models: classical and innovative aspects -
(1968)
A method for the traffic assignment problem, Report LBS-TNT-95, Transportation Network Theory Unit, London Business -
F. Jubete, E. Castillo (2007)
A complete description of cones and polytopes including hypervolumes of all facets of a polytopeInternational Journal of Mathematical Education in Science and Technology, 38
-
H. Bar-Gera (2002)
Origin-Based Algorithm for the Traffic Assignment ProblemTransp. Sci., 36
-
M. Florian, D. Hearn (1995)
Chapter 6 Network equilibrium models and algorithms, 8
-
M. Beckman, C. Mcguire, C. Winsten, T. Koopmans (1956)
Studies in the Economics of Transportation.A Quarterly Journal of Operations Research, 7
-
E. Cascetta, A. Nuzzolo, F. Russo, A. Vitetta (1996)
A MODIFIED LOGIT ROUTE CHOICE MODEL OVERCOMING PATH OVERLAPPING PROBLEMS. SPECIFICATION AND SOME CALIBRATION RESULTS FOR INTERURBAN NETWORKS -
R. Dial (1971)
A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILEClassics in Transport Analysis
-
C. Daganzo, Y. Sheffi (1977)
On Stochastic Models of Traffic AssignmentTransportation Science, 11
-
J. Prashker, S. Bekhor (1999)
Stochastic User-Equilibrium Formulations for Extended-Logit Assignment ModelsTransportation Research Record, 1676
-
C. Chu (1989)
A PAIRED COMBINATORIAL LOGIT MODEL FOR TRAVEL DEMAND ANALYSIS, 4
-
M. Maher, Xiaoyan Zhang, D. Vliet (2001)
A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flowsTransportation Research Part B-methodological, 35
-
M. Bierlaire (2002)
The total demand scale: a new measure of quality for static and dynamic origin–destination trip tablesTransportation Research Part B-methodological, 36
-
Y. Sheffi, Warrren Powell (1983)
Optimal Signal Settings Over Transportation NetworksJournal of Transportation Engineering-asce, 109
-
(1982)
Ein Direktes Verfahren Zur Verkehrsumlegung nach dem 1. Prinzip von Wardrop, Forschungsbereich: Verkehrssysteme. Arbeitsbericht 1, Universitát Bremen, Germany -
E. Castillo, Angel Cobo, F. Jubete, R. Pruneda, Carmen Castillo (2000)
An Orthogonally Based Pivoting Transformation of Matrices and Some ApplicationsSIAM J. Matrix Anal. Appl., 22
-
J. Prashker, S. Bekhor (2004)
Route Choice Models Used in the Stochastic User Equilibrium Problem: A ReviewTransport Reviews, 24
-
M. Patriksson (1994)
The Traffic Assignment problem -
Vovsha Vovsha, Bekhor Bekhor (1998)
The link nested logit model: Overcoming the route overlapping problemTransportation Research Record, 1645
-
Shiliang Sun, Changshui Zhang, Guoqiang Yu (2006)
A bayesian network approach to traffic flow forecastingIEEE Transactions on Intelligent Transportation Systems, 7
-
(1983)
Transport networks in practice -
M. Hazelton (2003)
SOME COMMENTS ON ORIGIN-DESTINATION MATRIX ESTIMATIONTransportation Research Part A-policy and Practice, 37
-
D. McFadden (1977)
Modelling the Choice of Residential LocationTransportation Research Record
-
O. Damberg, J. Lundgren, M. Patriksson (1996)
An algorithm for the stochastic user equilibrium problemTransportation Research Part B-methodological, 30
-
Dial Dial (1971)
A probabilistic multipath traffic assignment algorithm which obviates path enumerationTransportation Research, 5
-
E. Castillo, J. Menéndez, Pilar Jiménez, A. Rivas (2008)
Closed form expressions for choice probabilities in the Weibull caseTransportation Research Part B-methodological, 42
-
C. Wright, D. Jarrett, Gautam Appa, J. Rados, S. Vukanovic (1995)
Spatial aspects of traffic circulation: I. A review of alternative systemsTransportation Research Part B-methodological, 29
-
Castillo Castillo, Jubete Jubete, Pruneda Pruneda, Solares Solares (2002)
Obtaining simultaneous solutions of linear subsystems of equations and inequalitiesLinear Algebra and its Applications, 346
-
S. Dafermos, F. Sparrow (1969)
Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
-
G. Cantarella (1997)
A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic DemandTransp. Sci., 31
-
J. Wardrop (1952)
ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH., 1
-
(2006)
Shortest Path Algorithms -
C. Tebaldi, M. West (1998)
Bayesian Inference on Network Traffic Using Link Count DataJournal of the American Statistical Association, 93
-
Castillo Castillo, Menéndez Menéndez, Jiménez Jiménez (2008b)
Trip path reconstruction and estimation based on plate scanning and link observationTransportation Research Part B
-
E. Cascetta, S. Nguyen (1988)
A unified framework for estimating or updating origin/destination matrices from traffic countsTransportation Research Part B-methodological, 22
-
P. Vovsha (1997)
Application of Cross-Nested Logit Model to Mode Choice in Tel Aviv, Israel, Metropolitan AreaTransportation Research Record, 1607
-
Y. Vardi (1996)
Estimating source-destination traffic intensities from link data -
L. LeBlanc, R. Helgason, D. Boyce (1985)
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network ProgramsTransp. Sci., 19
-
(2005)
Decomposition Techniques in Mathematical Programming -
Hai Yang (1995)
Heuristic algorithms for the bilevel origin-destination matrix estimation problemTransportation Research Part B-methodological, 29
-
Hai Yang, J. Zhou (1998)
Optimal traffic counting locations for origin–destination matrix estimationTransportation Research Part B-methodological, 32
-
E. Castillo, J. Menéndez, Pilar Jiménez (2008)
Trip matrix and path flow reconstruction and estimation based on plate scanning and link observationsTransportation Research Part B-methodological, 42
-
M. Hazelton (2000)
Estimation of origin-destination matrices from link flows on uncongested networksTransportation Research Part B-methodological, 34
-
M. Frank, P. Wolfe (1956)
An algorithm for quadratic programmingNaval Research Logistics Quarterly, 3
-
E. Cascetta (1984)
Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimatorTransportation Research Part B-methodological, 18
-
A. Ehlert, Michael Bell, Sergio Grosso (2006)
The optimisation of traffic count locations in road networksTransportation Research Part B-methodological, 40
-
R. Gallager (1977)
A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Trans. Commun., 25
-
Hai Yang, Tsuna Sasaki, Y. Iida, Y. Asakura (1992)
Estimation of origin-destination matrices from link traffic counts on congested networksTransportation Research Part B-methodological, 26
-
Y. Sheffi, Warrren Powell (1982)
An algorithm for the equilibrium assignment problem with random link timesNetworks, 12
-
M. Bell (1995)
Alternatives to Dial's logit assignment algorithmTransportation Research Part B-methodological, 29
-
E. Castillo, J. Menéndez, S. Sánchez-Cambronero (2008)
Predicting traffic flow using Bayesian networksTransportation Research Part B-methodological, 42
-
M. Maher, X. Zhang (1999)
ALGORITHMS FOR THE SOLUTION OF THE CONGESTED TRIP MATRIX ESTIMATION PROBLEM -
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference -
P. Vovsha, S. Bekhor (1998)
Link-Nested Logit Model of Route Choice: Overcoming Route Overlapping ProblemTransportation Research Record, 1645
-
M. Ferris, A. Meeraus, T. Rutherford (1999)
Computing Wardropian equilibria in a complementarity frameworkOptimization Methods & Software, 10
-
T. Akamatsu (1996)
Cyclic flows, Markov process and stochastic traffic assignmentTransportation Research Part B-methodological, 30
-
E. Castillo, J. Galambos (1989)
Conditional distributions and the bivariate normal distributionMetrika, 36
-
P. Yim, W. Lam (1998)
EVALUATION OF COUNT LOCATION SELECTION METHODS FOR ESTIMATION OF O-D MATRICESJournal of Transportation Engineering-asce, 124
-
E. Castillo, F. Jubete, R. Pruneda, C. Solares (2002)
Obtaining simultaneous solutions of linear subsystems of inequalities and dualsLinear Algebra and its Applications, 346
-
J. Doblas, F. Benitez (2005)
An approach to estimating and updating origin-destination matrices based upon traffic counts preserving the prior structure of a survey matrixTransportation Research Part B-methodological, 39
-
E. Castillo, J. Gutiérrez, A. Hadi (1996)
Expert Systems and Probabilistic Network Models -
H. Bar-Gera (1999)
Origin-based Algorithms for Transportation Network Modelling
- Publisher
- Wiley
- Copyright
- 2008 Computer‐Aided Civil and Infrastructure Engineering
- ISSN
- 1093-9687
- eISSN
- 1467-8667
- DOI
- 10.1111/j.1467-8667.2008.00526.x
- Publisher site
- See Article on Publisher Site
Abstract
Abstract: This article deals with the problem of estimating and updating the origin‐destination matrix and link flows from traffic counts and its optimal location. A combination (bi‐level) of an OD‐pair matrix estimation model based on Bayesian networks, and a Wardrop‐minimum‐variance model, which identifies origins and destinations of link flows, is used to estimate OD‐pair and unobserved link flows based on some observations of links and/or OD‐pair flows. The Bayesian network model is also used to select the optimal number and locations of the links counters based on maximum correlation. Finally, the proposed methods are illustrated by their application to the Nguyen–Dupuis and the Ciudad Real networks.
Journal
Computer-Aided Civil and Infrastructure Engineering – Wiley
Published: Apr 1, 2008