David Watling, Richard Connors, Agachai Sumalee ITS, University of Leeds Acknowledgement: DfT “New Horizons” Dynamic Traffic Assignment Workshop, Queen’s.

Slides:



Advertisements
Similar presentations
Example Project and Numerical Integration Computational Neuroscience 03 Lecture 11.
Advertisements

Macroscopic ODE Models of Traffic Flow Zhengyi Zhou 04/01/2010.
Optimization Techniques for Supply Network Models Simone Göttlich Joint Work with: M. Herty, A. Klar (TU Kaiserslautern) M. Herty, A. Klar (TU Kaiserslautern)
Using Dynamic Traffic Assignment Models to Represent Day-to-day Variability Dirck Van Vliet 20 th International EMME Users’ Conference Montreal October.
Probabilistic Re-Analysis Using Monte Carlo Simulation
Geometry information from Liufang Ave. North in Beijing Green phase (s): 99,77,66,75,60 Dwell time distribution: N (30,9), N (27,7), N (24,6) Maximal bandwidth:
Analytical derivations of merge capacity: a multilane approach Ludovic Leclercq 1,2, Florian Marczak 1, Victor L. Knoop 2, Serge P. Hoogendoorn 2 1 Université.
Enhanced analytical decision support tools The Scheme level Final workshop of the DISTILLATE programme Great Minster House, London Tuesday 22 nd January.
TRANSPORT MODELLING Lecture 4 TRANSPORT MODELLING Lecture 4 26-Sep-08 Transport Modelling Microsimulation Software.
Computational Modelling of Road Traffic SS Computational Project by David Clarke Supervisor Mauro Ferreira - Merging Two Roads into One As economies grow.
Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)
W HAT W ILL T HE ‘W ORLD ’ B E L IKE … … in 20 minutes’ time? … the rest of today? … in two years’ time? … in 20 years’ time? … in 100 years’ time?
1 Adjoint Method in Network Analysis Dr. Janusz A. Starzyk.
Calculation of Similarity (Chernoff et al. 1999, 2000, 2001) 1. Observed Similarity = mean of 200 random sub- samples of larger population at size of smaller.
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
Evaluating Robustness of Signal Timings for Conditions of Varying Traffic Flows 2013 Mid-Continent Transportation Research Symposium – August 16, 2013.
Particle Filtering in Network Tomography
Alternative Measures of Risk. The Optimal Risk Measure Desirable Properties for Risk Measure A risk measure maps the whole distribution of one dollar.
Network Analysis - Introduction Transmission Planning Code Workshop 2 1 st May 2008.
ECE 8443 – Pattern Recognition LECTURE 06: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Bias in ML Estimates Bayesian Estimation Example Resources:
BsysE595 Lecture Basic modeling approaches for engineering systems – Summary and Review Shulin Chen January 10, 2013.
Modeling & Simulation: An Introduction Some slides in this presentation have been copyrighted to Dr. Amr Elmougy.
Introduction to Monte Carlo Simulation. What is a Monte Carlo simulation? In a Monte Carlo simulation we attempt to follow the `time dependence’ of a.
Monte Carlo Simulation CWR 6536 Stochastic Subsurface Hydrology.
Chapter 14 Monte Carlo Simulation Introduction Find several parameters Parameter follow the specific probability distribution Generate parameter.
A Multivariate Statistical Model of a Firm’s Advertising Activities and their Financial Implications Oleg Vlasov, Vassilly Voinov, Ramesh Kini and Natalie.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Assimilation of HF Radar Data into Coastal Wave Models NERC-funded PhD work also supervised by Clive W Anderson (University of Sheffield) Judith Wolf (Proudman.
Modelling and channel borrowing in mobile communications networks Richard J. Boucherie University of Twente Faculty of Mathematical Sciences University.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
Department of Mathematics, Mahidol University Department of Mathematics Mahidol University C M E Yongwimon Lenbury Deparment.
1 Evaluation of Adaptive Cruise Control in Mixed Traffic Session
Dynamics of Traffic Flows in Combined Day-to-day and With- in Day Context Chandra Balijepalli ITS, Leeds September 2004.
Crystal Ball: Risk Analysis  Risk analysis uses analytical decision models or Monte Carlo simulation models based on the probability distributions to.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Distributed Flow Routing Surface Water Hydrology, Spring 2005 Reading: 9.1, 9.2, 10.1, 10.2 Venkatesh Merwade, Center for Research in Water Resources.
A Stochastic Model of Platoon Formation in Traffic Flow USC/Information Sciences Institute K. Lerman and A. Galstyan USC M. Mataric and D. Goldberg TASK.
16 Sep 04Transport Workshop at Queen's1 A numerical comparison of three heuristic methods for path reassignment for dynamic user equilibrium Ying-en Ge.
Akram Bitar and Larry Manevitz Department of Computer Science
© K.Cuthbertson, D. Nitzsche FINANCIAL ENGINEERING: DERIVATIVES AND RISK MANAGEMENT (J. Wiley, 2001) K. Cuthbertson and D. Nitzsche Lecture Asset Price.
Monte-Carlo method for Two-Stage SLP Lecture 5 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO Working Group on Continuous.
Benjamin Heydecker JD (Puff) Addison Centre for Transport Studies UCL Dynamic Modelling of Road Transport Networks.
Effect of Electronically Enhanced Driver Behavior on Freeway Traffic Flow Alain L. Kornhauser Professor, Operations Research & Financial Engineering Director,
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
STOCHASTIC HYDROLOGY Stochastic Simulation of Bivariate Distributions Professor Ke-Sheng Cheng Department of Bioenvironmental Systems Engineering National.
EC208 – Introductory Econometrics. Topic: Spurious/Nonsense Regressions (as part of chapter on Dynamic Models)
Stochastic Optimization
Statistics Presentation Ch En 475 Unit Operations.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Supply Assumptions for Investment Planning Transmission Planning Code Workshop 1 3rd April 2008.
Generated Trips and their Implications for Transport Modelling using EMME/2 Marwan AL-Azzawi Senior Transport Planner PDC Consultants, UK Also at Napier.
ERT 210/4 Process Control & Dynamics DYNAMIC BEHAVIOR OF PROCESSES :
S9-1 ADM730, Section 9, September 2005 Copyright  2005 MSC.Software Corporation SECTION 9 MONTE CARLO ANALYSIS, CORRELATION.
Matrix Models for Population Management & Conservation March 2014 Lecture 10 Uncertainty, Process Variance, and Retrospective Perturbation Analysis.
State Equations BIOE Processes A process transforms input to output States are variables internal to the process that determine how this transformation.
September 2008What’s coming in Aimsun: New features and model developments 1 Hybrid Mesoscopic-Microscopic Traffic Simulation Framework Alex Torday, Jordi.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Weihua Gu Department of Electrical Engineering The Hong Kong Polytechnic University Bus and Car Delays at Near-Side/Far-Side Stops.
Uncertainty in transport models
Rutgers Intelligent Transportation Systems (RITS) Laboratory
Ensemble variance loss in transport models:
Transportation, Assignment and Network Models
Finite Volume Method for Unsteady Flows
Filtering and State Estimation: Basic Concepts
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Uncertainty and Error Propagation
Ying-en Ge and Malachy Carey 16 September 2004
Professor Ke-sheng Cheng
Akram Bitar and Larry Manevitz Department of Computer Science
Presentation transcript:

David Watling, Richard Connors, Agachai Sumalee ITS, University of Leeds Acknowledgement: DfT “New Horizons” Dynamic Traffic Assignment Workshop, Queen’s University, Belfast 15 th September 2004 Encapsulating between day variability in demand in analytical, within-day dynamic, link travel time functions

Aims  Dynamic modelling of network links subject to variable in-flows comprising:  Within-day variation described by inflow, outflow and travel time profiles  Between-day variation = random variation in these profiles  Thus identify mean travel times under doubly dynamic variation in flows

UK’s Department for Transport Work  Reliability impacts on travel decisions through generalised cost

Dynamic Models Cellular Automata Microsimulation Analytical ‘whole-link’ models  Many shown to fail plausibility tests (FIFO) e.g.  = f [x(t)], with x(t) = number cars on link  Carey et al. “improved” whole-link models guarantee FIFO and agree with LWR behaviour.

Modelling Within-Day Variation: Whole-link model (Carey et al, 2003) travel time for vehicle entering at time t in-flow at entry time out-flow at exit time Flow conservation (Astarita, 1995)

Whole-link Model  Combining gives a first-order differential equation:  No analytic solution for most functions h(.), u(.).  Can solve using backward differencing, applied in forward time (to avoid FIFO violations).

Flow Capacity  Should the link travel-time function h(w) inherently define max (valid) w and hence capacity, c?  Out-flow can exceed capacity in computation so long as inflow ‘compensates’ such that w=βu(t)+(1-β)v(t+τ(t))< c  Can ensure outflows respect flow capacity by adapting the numerical scheme. τ0τ0 τ w c Scenarios for h(w) with finite capacity c Desired meaning of capacity requires careful definition of h(w)

Day-to-day variation  Introduce day-to-day variation of inflow  Derive expected travel time profile in terms of mean, variances, co-variances of day-to-day varying in-flows

Mean travel time under between-day varying inflows Travel time at mean inflow Day-to-day variation Inflation term for between- day variation. Comprising: Variance-Covariance matrix of inflow variability and Hessian matrix “sensitivity of travel time to inflows” Not a constant!

Day-to-day parameterisation Practically unrestrictive: discretised case with N time slices Univariate Case General Case u(t) = u(t,  ) each day has different value of (vector)  u(t) =  = [θ 1, θ 2,…, θ N ]

Methodology Monte Carlo simulations of day-to-day inflows   drawn from a normal distribution gives many u(t,  i ) Whole-link model gives travel time  i (t)=  (u(t,  i )) Calculate mean of all the Monte Carlo days travel times. This is the experienced mean travel time. Calculate travel time at mean inflow, using whole-link model with inflow E[u(t,  )] Calculate the “Inflation” Term: combination of the Hessian and Covariance matrix Compare inflation term with

Numerical Example  BPR-type link travel time function ff = 10mins c = 2000 pcus/hour (‘capacity’)  In-flow profile with random day-to-day peak

Solving Carey’s model with  = 1, so that  = h[u(t)] No dependence on outflows.

Std dev of inflows Travel time calculated for the mean inflow Mean travel time over the days (with c.i.s) Mean inflow over the days  )(uE  Numerical difference from plot above Inflation term by calculation

Example:  =0.1  Asymptotic link travel time function ff = 10mins c = 7000 pcus/hour (‘capacity’)  In-flow profile with random day-to-day peak

Compare Two Link Travel Time Functions w τ=h(w)

Example:  =0.5  Asymptotic link travel time function ff = 10mins c = 7000 pcus/hour (‘capacity’)  In-flow profile with random day-to-day peak

Example:  =varying  Asymptotic link travel time function ff = 10mins c = 7000 pcus/hour (‘capacity’)  In-flow profile with random day-to-day peak

Further Work  Analytic derivation of the correction term?  Modify whole-link model to limit outflows  Augment with dynamic queuing model?  Conditions for FIFO?  Follow this approach on the links of a network to investigate its reliability under day-to-day varying demand.

Questions/Comments?