A Bayesian approach to traffic estimation in stochastic user equilibrium networks Chong WEI Beijing Jiaotong University Yasuo ASAKURA Tokyo Institute of.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

OPUS OPUS Optimising the Use of Partial Information in Urban and Regional Systems Professor John Polak Imperial College London Katalysis Systematica.
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Boundedly Rational User Equilibria (BRUE): Mathematical Formulation and Solution Sets Xuan Di a, Henry X. Liu a, Jong-Shi Pang b, Xuegang (Jeff) Ban c.
A Logit-based Transit Assignment Using Gradient Projection with the Priority of Boarding on a Transit Schedule Network Hyunsoo Noh and Mark Hickman 2011.
Urban Network Gridlock: Theory, Characteristics, and Dynamics Hani Mahmassani, Meead Saberi, Ali Zockaie The 20th International Symposium on Transportation.
Balázs Sziklai Selfish Routing in Non-cooperative Networks.
Crime Risk Factors Analysis Application of Bayesian Network.
A Path-size Weibit Stochastic User Equilibrium Model
GEOG 111 & 211A Transportation Planning Traffic Assignment.
Institute for Transport Studies FACULTY OF ENVIRONMENT Cooperative and Non-Cooperative Equilibrium Problems with Equilibrium Constraints: Applications.
Bayesian Robust Principal Component Analysis Presenter: Raghu Ranganathan ECE / CMR Tennessee Technological University January 21, 2011 Reading Group (Xinghao.
Bayesian inference Gil McVean, Department of Statistics Monday 17 th November 2008.
Paper Discussion: “Simultaneous Localization and Environmental Mapping with a Sensor Network”, Marinakis et. al. ICRA 2011.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Hidden Markov Model 11/28/07. Bayes Rule The posterior distribution Select k with the largest posterior distribution. Minimizes the average misclassification.
Learning Low-Level Vision William T. Freeman Egon C. Pasztor Owen T. Carmichael.
Traffic Matrix Estimation: Existing Techniques and New Directions A. Medina (Sprint Labs, Boston University), N. Taft (Sprint Labs), K. Salamatian (University.
11 Quantifying Benefits of Traffic Information Provision under Stochastic Demand and Capacity Conditions: A Multi-day Traffic Equilibrium Approach Mingxin.
Model-Driven Data Acquisition in Sensor Networks - Amol Deshpande et al., VLDB ‘04 Jisu Oh March 20, 2006 CS 580S Paper Presentation.
1 © 1998 HRL Laboratories, LLC. All Rights Reserved Development of Bayesian Diagnostic Models Using Troubleshooting Flow Diagrams K. Wojtek Przytula: HRL.
Traffic Matrix Estimation for Traffic Engineering Mehmet Umut Demircin.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Super-Resolution of Remotely-Sensed Images Using a Learning-Based Approach Isabelle Bégin and Frank P. Ferrie Abstract Super-resolution addresses the problem.
Bayesian integration of biological prior knowledge into the reconstruction of gene regulatory networks Dirk Husmeier Adriano V. Werhli.
Source: NHI course on Travel Demand Forecasting (152054A) Session 10 Traffic (Trip) Assignment Trip Generation Trip Distribution Transit Estimation & Mode.
Particle Filtering in Network Tomography
Workshop PRIXNET – 11/12 Mars CONGESTION PRICING IN AIR TRANSPORTATION Karine Deschinkel Laboratoire PRiSM – Université de Versailles.
Model Inference and Averaging
Some network flow problems in urban road networks Michael Zhang Civil and Environmental Engineering University of California Davis.
Soft Sensor for Faulty Measurements Detection and Reconstruction in Urban Traffic Department of Adaptive systems, Institute of Information Theory and Automation,
CONTINUOUS PRICE AND FLOW DYNAMICS OF TRADABLE MOBILITY CREDITS Hongbo YE and Hai YANG The Hong Kong University of Science and Technology 21/12/2012.
MAS2317 Presentation Jake McGlen. Assuming vague prior knowledge, obtain the posterior distribution for µ and hence construct a 95% Bayesian confidence.
TRADING SPACE FOR TIME IN BAYESIAN FRAMEWORK Nataliya Bulygina 1, Susana L. Almeida 1, Thorsten Wagener 2, Wouter Buytaert 1, Neil McIntyre 1 1 Department.
Incorporating heterogeneity in meta-analyses: A case study Liz Stojanovski University of Newcastle Presentation at IBS Taupo, New Zealand, 2009.
On Activity-Based Network Design Problems JEE EUN (JAMIE) KANG, JOSEPH Y. J. CHOW, AND WILL W. RECKER 20 TH INTERNATIONAL SYMPOSIUM ON TRANSPORTATION AND.
Comparing Dynamic Traffic Assignment Approaches for Planning
Dynamics of Traffic Flows in Combined Day-to-day and With- in Day Context Chandra Balijepalli ITS, Leeds September 2004.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
STATISTICAL ANALYSIS FOR ORIGIN-DESTINATION MATRICES OF TRANSPORT NETWORK Baibing Li Business School Loughborough University Loughborough, LE11 3TU.
Measures of Conserved Synteny Work was funded by the National Science Foundation’s Interdisciplinary Grants in the Mathematical Sciences All work is joint.
Benjamin Heydecker JD (Puff) Addison Centre for Transport Studies UCL Dynamic Modelling of Road Transport Networks.
Multi-Speaker Modeling with Shared Prior Distributions and Model Structures for Bayesian Speech Synthesis Kei Hashimoto, Yoshihiko Nankaku, and Keiichi.
MCMC in structure space MCMC in order space.
Bayesian Travel Time Reliability
Wei Sun and KC Chang George Mason University March 2008 Convergence Study of Message Passing In Arbitrary Continuous Bayesian.
A Tour-Based Urban Freight Transportation Model Based on Entropy Maximization Qian Wang, Assistant Professor Department of Civil, Structural and Environmental.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Bayesian Speech Synthesis Framework Integrating Training and Synthesis Processes Kei Hashimoto, Yoshihiko Nankaku, and Keiichi Tokuda Nagoya Institute.
Zhilin Zhang, Bhaskar D. Rao University of California, San Diego March 28,
Asymptotic Behavior of Stochastic Complexity of Complete Bipartite Graph-Type Boltzmann Machines Yu Nishiyama and Sumio Watanabe Tokyo Institute of Technology,
Assignment. Where are we? There are four scopes 1. Logit 2. Assignment Today! 3. LUTI 4. Other models and appraisal.
In Bayesian theory, a test statistics can be defined by taking the ratio of the Bayes factors for the two hypotheses: The ratio measures the probability.
Travel Demand Forecasting: Traffic Assignment CE331 Transportation Engineering.
September 2008What’s coming in Aimsun: New features and model developments 1 Hybrid Mesoscopic-Microscopic Traffic Simulation Framework Alex Torday, Jordi.
Hierarchical Mixture of Experts Presented by Qi An Machine learning reading group Duke University 07/15/2005.
Outline Historical note about Bayes’ rule Bayesian updating for probability density functions –Salary offer estimate Coin trials example Reading material:
A Method to Approximate the Bayesian Posterior Distribution in Singular Learning Machines Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Transportation Planning Asian Institute of Technology
Canadian Bioinformatics Workshops
Ranking: Compare, Don’t Score Ammar Ammar, Devavrat Shah (LIDS – MIT) Poster ( No preprint), WIDS 2011.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Prepared for 16th TRB National Transportation Planning Applications Conference Outline Gap Value in Simulation-Based Dynamic Traffic Assignment (DTA) Models:
Travel Time Perception and Learning in Traffic Networks
URBAN TRANSPORTATION NERWORKS
A Modeling Framework for Flight Schedule Planning
Rutgers Intelligent Transportation Systems (RITS) Laboratory
Fuzzy Dynamic Traffic Assignment Model
Appetizer: Statistical methods in XSPEC
CS639: Data Management for Data Science
Presentation transcript:

A Bayesian approach to traffic estimation in stochastic user equilibrium networks Chong WEI Beijing Jiaotong University Yasuo ASAKURA Tokyo Institute of Technology The 20th International Symposium on Transportation and Traffic Theory Noordwijk, the Netherlands, 17 – 19, July,

Purpose O-D Matrix Link Flows Path Flows Estimating Traffic flows on congested networks 2

Background Likelihood-based methods - Frequentist: Watling (1994), Lo et al. (1996), Hazelton (2000), Parry & Hazelton (2012) - Bayesians: Maher (1983), Castillo et al. (2008), Hazelton (2008), Li (2009), Yamamoto et al. (2009), Perrakis et al. (2012) 3

Background On congested networks: Bi-level model Link count constraint L i k e l i h o o d equilibrium constraint Bi - level 4

Background On congested networks: Single level model Link count constraint L i k e l i h o o d equilibrium constraint B a y e s i a n 5

Highlights Use a likelihood to present the estimation problem along with equilibrium constraint Exactly write down the posterior distribution of traffic flows conditional on both link count data and equilibrium constraint through a Bayesian framework Develop a sampling-based algorithm to obtain the characteristics of traffic flows from the posterior distribution 6

Primary problem 7

Representation 8

Decomposition 9

Equilibrium constraint 10

ODA detector ? (90) Two-route network An illustrative example Proposed model True value = Equilibrium model True value = Link A Link B 11

Path flow estimation problem 12

Path flow estimation problem The posterior distribution Prior probability: the principle of indifference Likelihood 13

Prior knowledge of O-D matrix 14

Estimation Sampling-based algorithm 15

Blocked sampler 16

Test network 23 observed links (about 30% of the links) 53 unobserved links 60 O-D pairs 17

Test network 18

Link estimates without prior knowledge 19

O-D estimates without prior knowledge 20

Link estimates with prior knowledge 21

95% Bayesian confidence interval 22

O-D estimates with prior knowledge 23

Conclusions A likelihood-based statistical model that can take into account data constraint and equilibrium constraint through a single level structure. Therefore, the proposed method does not find an equilibrium solution in each iteration. The proposed model uses observed link counts as input but does not require consistency among the observations. 24

Conclusions The probability distribution of traffic flows can be obtained by the proposed model. No special requirements for route choice models. The National Basic Research Program of China (No. 2012CB725403) 25

Questions ? Chong WEI Yasuo ASAKURA 26