Short term forecast of travel times on the Danish highway network based on TRIM data Klaus Kaae Andersen Thomas Kaare Christensen Bo Friis Nielsen Informatics.

Slides:



Advertisements
Similar presentations
Genoa, Italy September 2-4, th IEEE International Conference on Advanced Video and Signal Based Surveillance Combination of Roadside and In-Vehicle.
Advertisements

Travel Time Estimation on Arterial Streets By Heng Wang, Transportation Analyst Houston-Galveston Area Council Dr. Antoine G Hobeika, Professor Virginia.
FTP Biostatistics II Model parameter estimations: Confronting models with measurements.
Detection and Measurement of Pavement Cracking Bagas Prama Ananta.
Software Quality Ranking: Bringing Order to Software Modules in Testing Fei Xing Michael R. Lyu Ping Guo.
Resource Prediction Based on Double Exponential Smoothing in Cloud Computing Authors: Jinhui Huang, Chunlin Li, Jie Yu The International Conference on.
Application of Computer Simulation in Traffic Analysis Presented By: Lei Huang.
Virtual Dart: An Augmented Reality Game on Mobile Device Supervisor: Professor Michael R. Lyu Prepared by: Lai Chung Sum Siu Ho Tung.
Traffic Prediction on the Internet Anne Denton. Outline  Paper by Y. Baryshnikov, E. Coffman, D. Rubenstein and B. Yimwadsana  Solutions  Time-Series.
February 9, 2006TransNow Student Conference Using Ground Truth Geospatial Data to Validate Advanced Traveler Information Systems Freeway Travel Time Messages.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Travel Time Prediction for Urban Networks: the Comparisons of Simulation-based and Time-Series Models Ta-Yin Hu Department of Transportation and Communication.
1 Improving Branch Prediction by Dynamic Dataflow-based Identification of Correlation Branches from a Larger Global History CSE 340 Project Presentation.
The Fourth WIM Meeting 1 Active Nearest Neighbor Queries for Moving Objects Jan Kolar, Igor Timko.
Retrieval Evaluation. Brief Review Evaluation of implementations in computer science often is in terms of time and space complexity. With large document.
Simulation.
Chapter 3 Forecasting McGraw-Hill/Irwin
TrafficView: A Scalable Traffic Monitoring System Tamer Nadeem, Sasan Dashtinezhad, Chunyuan Liao, Liviu Iftode* Department of Computer Science University.
K. Salah1 On the Performance of a Simple Packet Rate Estimator by K. Salah & F. Haidari The 6th ACS/IEEE International Conference on Computer Systems and.
1 Statistics of Freeway Traffic. 2 Overview The Freeway Performance Measurement System (PeMS) Computer Lab Visualization of Traffic Dynamics Visualization.
1 Adaptive Kalman Filter Based Freeway Travel time Estimation Lianyu Chu CCIT, University of California Berkeley Jun-Seok Oh Western Michigan University.
Chapter 14 Simulation. Monte Carlo Process Statistical Analysis of Simulation Results Verification of the Simulation Model Computer Simulation with Excel.
Part II – TIME SERIES ANALYSIS C2 Simple Time Series Methods & Moving Averages © Angel A. Juan & Carles Serrat - UPC 2007/2008.
Fuzzy Logic in Traffic Control State Trafic Departement Baden Württemberg realized by INFORM Software Corporation Martin Pozybill Martin Pozybill Bernhard.
Forecasting McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Exploration of Ground Truth from Raw GPS Data National University of Defense Technology & Hong Kong University of Science and Technology Exploration of.
Estimating Risks Associated with Travel Demand Forecasts 14 th TRB Transportation Planning Applications Conference May 2013 Thomas Adler, RSG Michael Doherty,
Wind Energy Forecaster A Web-based Wind Energy Prediction Tool Aditya Trivedi ’16 Advisor: Dr. Eric Larson.
EE392J Final Project, March 20, Multiple Camera Object Tracking Helmy Eltoukhy and Khaled Salama.
Business Process Performance Prediction on a Tracked Simulation Model Andrei Solomon, Marin Litoiu– York University.
Topic #10: Optimization EE 456 – Compiling Techniques Prof. Carl Sable Fall 2003.
Sampling. Concerns 1)Representativeness of the Sample: Does the sample accurately portray the population from which it is drawn 2)Time and Change: Was.
DATA MINING : CLASSIFICATION. Classification : Definition  Classification is a supervised learning.  Uses training sets which has correct answers (class.
Technology and Society The DynamIT project Dynamic information services and anonymous travel time registration VIKING Workshop København Per J.
TYPOLOGY OF PRODUCTS IN OFFICIAL STATISTICS Thomas Burg Marcus Hudec.
APPL: Anchor Path Planning –based Localization for Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI LSI, Computer Science Department Houari.
Accessibility project in Denmark Phase 1 - Collect data, define congestion, establish methods to estimate congestion and the marginal congestion costs.
Improving the monitoring quality to Automate ITS Systems Enrique Belda Esplugues Civil Engineer Head of Valencia TCC Associate Professor at Valencia Polytechnic.
Machine Learning Approach to Report Prioritization with an Application to Travel Time Dissemination Piotr Szczurek Bo Xu Jie Lin Ouri Wolfson.
Prediction of Traffic Density for Congestion Analysis under Indian Traffic Conditions Proceedings of the 12th International IEEE Conference on Intelligent.
Determination of Number of Probe Vehicles Required for Reliable Travel Time Measurement in Urban Network.
JM - 1 Introduction to Bioinformatics: Lecture III Genome Assembly and String Matching Jarek Meller Jarek Meller Division of Biomedical.
January 23, 2006Transportation Research Board 85 th Annual Meeting Using Ground Truth Geospatial Data to Validate Advanced Traveler Information Systems.
Experimental research in noise influence on estimation precision for polyharmonic model frequencies Natalia Visotska.
Lecture 16: Reconfigurable Computing Applications November 3, 2004 ECE 697F Reconfigurable Computing Lecture 16 Reconfigurable Computing Applications.
Protein motif extraction with neuro-fuzzy optimization Bill C. H. Chang and Author : Bill C. H. Chang and Saman K. Halgamuge Saman K. Halgamuge Adviser.
1 Analysis of in-use driving behaviour data delivered by vehicle manufacturers By Heinz Steven
Optimizing CASCADE Data Aggregation for VANETs Khaled Ibrahim and Michele C. Weigle Department of Computer Science, Old Dominion University MASS 2008.
Crowd sourcing techniques and applications for ITS Limitations and possibilities Dionisis Kehagias Senior Researcher at Information Technologies Institute.
Jen-Tzung Chien, Meng-Sung Wu Minimum Rank Error Language Modeling.
Hcm 2010: BASIC CONCEPTS praveen edara, ph.d., p.e., PTOE
Abstract Loop detector data for northbound Autobahn 9 (A9) from Munich to Nurnberg, Germany is analyzed using the cumulative curves methodology. The analysis.
Presentation for CDA6938 Network Security, Spring 2006 Timing Analysis of Keystrokes and Timing Attacks on SSH Authors: Dawn Xiaodong Song, David Wagner,
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
Forecasting is the art and science of predicting future events.
The phenomenon of high-speed-car-following on Chinese highways Mingmin Guo, Zheng Wu Department of Mechanics and Engineering Science Fudan University.
1 Bottleneck Identification and Forecasting in Traveler Information Systems Robert L. Bertini, Rafael Fernández-Moctezuma, Huan Li, Jerzy Wieczorek, Portland.
Mustafa Gokce Baydogan, George Runger and Eugene Tuv INFORMS Annual Meeting 2011, Charlotte A Bag-of-Features Framework for Time Series Classification.
AUTOMATIC NUMBER PLATE RECOGNITION SYSTEM
Forecasting Purpose is to forecast, not to explain the historical pattern Models for forecasting may not make sense as a description for ”physical” behaviour.
The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.
An Improved Neural Network Algorithm for Classifying the Transmission Line Faults Slavko Vasilic Dr Mladen Kezunovic Texas A&M University.
Short term forecast model
INCIDENT ANALYSIS USING PROBE DATA
Ossi Nurmi 15th Global Forum on Tourism Statistics, Cusco, Peru
Connected Word Recognition
Finding Periodic Discrete Events in Noisy Streams
The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.
Presentation transcript:

Short term forecast of travel times on the Danish highway network based on TRIM data Klaus Kaae Andersen Thomas Kaare Christensen Bo Friis Nielsen Informatics and Mathematical Modelling Technical University of Denmark Viking Workshop October 2005

Background/Motivation The high way network in the Copenhagen area is equipped with double induction loop detectors. From this measurement system data on each passing single vehicle (e.g. speed and length) is collected. The data is referred to as the TRIM data Travel time estimates and travel time forecasts are calculated based on the TRIM data and given to the public by means of TV, radio and the Internet The travel time estimates and forecasts are based on data on an aggregated level

Study objectives The study objectives are Develop statistical models with aim to identify single vehicles between induction loops from the TRIM data. Hereby, the travel time between loops can be estimated directly Estimate the variability in travel times Validate the accuracy and precision of the current methods for travel time estimation and prognosis Develop new methods as an alternative to the currently used methods

Outline of the presentation The Data Modelling method -Pattern recognition methods based on statistical methods, dynamical modelling EWMA Results - Percentage recognized vehicles, accuracy and precision, implementation Comparison with existing methods Future work

TRIM data For each passing vehicle the system measures: - Time - Speed - Length - Gap … The travel times can not be estimated directly from these data!!

Data We are considering a stretch of the high way network (Jægersborgvej to Hillerødmotorvejen) Data is TRIM data 1)Empirical data (measurements from TRIM) 2)Simulated data (from the program VISSIM)

Empirical data - Time - Speed - Length - Gap …

Simulated data Data from the same stretch has been generated using the micro simulation program VISSIM The simulated data match the empirical data well The advantage in using simulated data is that each passing vehicle can be identified – thus the modelling method can be validated!!

Induction-loop data - Time - Speed - Velocity - Gap … Loop 1 Loop 2

Modelling method The aim is to develop a statistical method for identification of vehicles at successive loops and hereby allow for a direct estimation of the current travel time between loops The focus is on: -Pattern recognition of non-typical vehicles (non typical in terms of vehicle lengths) -Develop a statistical measure for how well a vehicle ’match’ another vehicle -Develop a dynamical model for estimation of forecasting purposes

Pattern recognition The vehicles are identified from the measured lengths The identification has to be unique, thus it is not possible to match every passing vehicle: 1)Sequences of vehicles (e.g. 4 passing vehicles in a sequence) 2)Long vehicles (i.e. Big trucks)

Identification based on sequences Assume, that 4 vehicles are registered at loop 1 having the lengths L={L1, L2, L3, L4} Subsequently, 4 vehicles are registered at loop 2 having the lengths L’={L1’, L2’, L3’, L4’} The corresponding ‘match’ (denoted M) is calculated as:

Identification based on sequences If M is less than the statistical measurement precision U, the sequence is defined as a ’possible match’ For each passing sequence a possible match is searched for (within a given time window) If only one ‘possible match is found’ then this is defined a a ’unique match’ From unique matches the travel time S is calculated

Problems and error sources It is not possible not identify a sequence if vehicles within the sequence change lane in between loops It is not possible to identify large vehicles or sequences if the measurement error is too large A non-correct sequence may falsely be classified as a correct sequence

Estimation of travel time The travel time at time i, T i, is estimated using an Exponentially Weighted Moving Average (EWMA) model: is the forgetting factor andS i is the current estimated travel time from the identification of non-typical vehicles. T i-1 is the travel time at time (i-1), thus the travel time 1 time instant before

EWMA and time window time Estimated Travel Time Statistical Uncertainty

Results (simulated noise-free data) Number in sequence Correctly identified Identified in total % Correct 61 %84 %92 %95 %96 %

Results

Computational speed and implementation Implementation of the algorithm is simple The estimation of travel time is only necessary when there is congestion Time needed for computation is not relevant (the algorithm is very fast for given and small intervals)

Future work: forecasts Short term forecast Pattern recognition EWMA Historical data: Travel times, accidents, weather etc Long term forecast

Travel time for longer distances For longer distances it must be expected that fewer sequences can be identified Methods for interpolation and estimation of travel time for longer distances will be validated

Conclusion The proposed method makes it possible to identify non-typical vehicles from loop to loop Thus it is possible to estimate the travel time between loops with reasonable precision Future work includes estimating the time for longer distances and validating the method using camera data