SIMULTANEOUS TRAVEL MODEL ESTIMATION FROM SURVEY DATA AND TRAFFIC COUNTS May 20, 2015 Vince Bernardin, PhD, RSG Steven Trevino, RSG John-Paul Hopman, MACOG.

Slides:



Advertisements
Similar presentations
Reinforcement Learning
Advertisements

Genetic Algorithms (Evolutionary Computing) Genetic Algorithms are used to try to “evolve” the solution to a problem Generate prototype solutions called.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Objectives 10.1 Simple linear regression
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
GEOG 111 & 211A Transportation Planning Traffic Assignment.
Visual Recognition Tutorial
Chapter 8 Estimation: Additional Topics
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Data Mining Techniques Outline
Session 11: Model Calibration, Validation, and Reasonableness Checks
Improved Crowd Control Utilizing a Distributed Genetic Algorithm John Chaloupek December 3 rd, 2003.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Lec 10, TD Part 3: ch5.4.2 & H/O, pp : Trip Distribution Trip distribution: why is it needed? The Fratar Method (read, not covered in class; get.
Business Statistics: A Decision-Making Approach, 6e © 2005 Prentice-Hall, Inc. Chap 7-1 Introduction to Statistics: Chapter 8 Estimation.
Chap 9-1 Statistics for Business and Economics, 6e © 2007 Pearson Education, Inc. Chapter 9 Estimation: Additional Topics Statistics for Business and Economics.
TRIP ASSIGNMENT.
The Calibration Process
1/49 EF 507 QUANTITATIVE METHODS FOR ECONOMICS AND FINANCE FALL 2008 Chapter 9 Estimation: Additional Topics.
Source: NHI course on Travel Demand Forecasting (152054A) Session 10 Traffic (Trip) Assignment Trip Generation Trip Distribution Transit Estimation & Mode.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
©2009 Proprietary and Confidential DTA in practice: Modeling dynamic networks in the real world Michael Mahut, Ph.D. INRO Montreal, Canada.
10.3 Estimating a Population Proportion
Genetic Algorithm.
Destination Choice Modeling of Discretionary Activities in Transport Microsimulations Andreas Horni.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Estimates and Sample Sizes Lecture – 7.4
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
CJT 765: Structural Equation Modeling Class 7: fitting a model, fit indices, comparingmodels, statistical power.
Section 8.1 Estimating  When  is Known In this section, we develop techniques for estimating the population mean μ using sample data. We assume that.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
A Survey of Distributed Task Schedulers Kei Takahashi (M1)
Neural and Evolutionary Computing - Lecture 6
Unsupervised Learning: Clustering Some material adapted from slides by Andrew Moore, CMU. Visit for
Dynamic Origin-Destination Trip Table Estimation for Transportation Planning Ramachandran Balakrishna Caliper Corporation 11 th TRB National Transportation.
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Conceptual Differences Between Cube Analyst and Cube Analyst Drive Austen C. Duffy, Ph.D. Computational Mathematician, Citilabs.
Lecture 4: Statistics Review II Date: 9/5/02  Hypothesis tests: power  Estimation: likelihood, moment estimation, least square  Statistical properties.
Planning Applications Conference, Reno, NV, May Impact of Crowding on Rail Ridership: Sydney Metro Experience and Forecasting Approach William Davidson,
+ “Statisticians use a confidence interval to describe the amount of uncertainty associated with a sample estimate of a population parameter.”confidence.
Chapter 3: Maximum-Likelihood Parameter Estimation l Introduction l Maximum-Likelihood Estimation l Multivariate Case: unknown , known  l Univariate.
TRB Planning Applications May 2009, Houston,TX Changing assignment algorithms: the price of better convergence Michael Florian and Shuguang He INRO.
Chap 7-1 A Course In Business Statistics, 4th © 2006 Prentice-Hall, Inc. A Course In Business Statistics 4 th Edition Chapter 7 Estimating Population Values.
De novo discovery of mutated driver pathways in cancer Discussion leader: Matthew Bernstein Scribe: Kun-Chieh Wang Computational Network Biology BMI 826/Computer.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Statistics What is the probability that 7 heads will be observed in 10 tosses of a fair coin? This is a ________ problem. Have probabilities on a fundamental.
Organization of statistical investigation. Medical Statistics Commonly the word statistics means the arranging of data into charts, tables, and graphs.
Math 3680 Lecture #15 Confidence Intervals. Review: Suppose that E(X) =  and SD(X) = . Recall the following two facts about the average of n observations.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
A Genetic Algorithm for Truck Model Parameters from Local Truck Count Data Vince Bernardin, Jr, PhD & Lee Klieman, PE, PTOE Bernardin, Lochmueller & Associates,
Travel Demand Forecasting: Traffic Assignment CE331 Transportation Engineering.
Building Valid, Credible & Appropriately Detailed Simulation Models
MEGN 537 – Probabilistic Biomechanics Ch.5 – Determining Distributions and Parameters from Observed Data Anthony J Petrella, PhD.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Estimating standard error using bootstrap
Using Linked Non-Home-Based Trips in Virginia
12th TRB National Planning Application Conference Xiaobo Liu, Ph.D.
CJT 765: Structural Equation Modeling
Presentation transcript:

SIMULTANEOUS TRAVEL MODEL ESTIMATION FROM SURVEY DATA AND TRAFFIC COUNTS May 20, 2015 Vince Bernardin, PhD, RSG Steven Trevino, RSG John-Paul Hopman, MACOG John Gliebe, PhD, RSG

RSG Our Mission CALIBRATE A NEW TDM FOR THE SOUTH BEND, IN MPO (MACOG) Small HH travel survey –518 HH sample HH NHTS sample = 681 HH Large, detailed traffic count database –1,536 count stations with volumes by direction vehicle class time of day –27,648 observed volumes

RSG The Counts

RSG Business-as-Usual (1) 1. Collect survey. 2. Sequentially estimate / calibrate component demand model parameters. 3. Assign modeled demand to the highway network. 4. Look at traffic counts versus modeled volumes. 5. Groan…

RSG Business-as-Usual (2) 6. Scratch head… 7. Engage in highly sophisticated random number draw or other quasi-random process to select demand model parameter to adjust. 8. Take a wild guess at how much to adjust said parameter. 9. Assign modeled demand and compare to counts. 10. Repeat ad nauseam…

RSG What if… We didn’t ignore traffic counts until the end? Like all great ideas… someone has thought of this before. A Better Way?

RSG Isn’t this just ODME? There’s been LOTS of research on and application of methods for estimating OD matrices or trip tables from counts or sometimes even from counts and survey data. ODME (from counts) is powerful – and dangerous. The power comes from harnessing the information in traffic counts. The danger comes from under-determination. –In a typical mid-sized model with 1,000 zones & 1,000 counts 1 million degrees of freedom vs. 1,000 observations. There are many, many, MANY OD matrices that can produce the observed counts – one real solution – many that bear no resemblance to it.

RSG Parameter Estimation from Counts (& Survey) Although technically, ODME could be considered an extreme (over-saturated) example, model parameter estimation from counts is generally a different problem. Even a model with a fair amount of advanced components and a lot of parameters generally has fewer degrees of freedom (unknowns) than observations (knowns). A unique solution can be found to properly specified problem of fitting parameters to observations! And people have done it.

RSG Literature Review ABOUT 15 REFERENCES IN THE LIT GOING BACK TO THE 1970s Most estimate demand models only from traffic counts, ignoring survey data. Most adopt unrealistically simplistic travel models. –Single trip purpose –No mode choice –No advanced components (destination choice, etc.) –No equilibrium assignment –No feedback A few are worth a good read… but in the end remain academic research.

RSG Challenge Previous attempts have usually simplified – because this problem is HARD (NP-hard to be nerdy about it). –Any realistic model including an equilibrium assignment (or even worse, feedback) turns the parameter estimation problem into a MPEC (mathematical program with equilibrium constraints). –No analytic gradients. –No expectation of global concavity. –Heuristics / Metaheuristics necessary.

RSG ITERATIVE BI-LEVEL PROGRAM Bi-level program formulation typical Stackelberg leader-follower game Metaheuristic Genetic Algorithm Evolve parameters to maximize fitness vs. counts & survey Travel Model Apply the base model given a set of parameters as inputs

RSG Genetic Algorithm OVERVIEW Initial “population” of solutions Evaluate “fitness” of each solution Kill least fit solutions Create new generation of solutions by -Randomly mutating fit solutions -Combining fit solutions

RSG Fitness

RSG Generation

RSG Distribution

RSG Network Assignment (1) Assume network loading error distribution and calculate log-likelihood. Started by assuming Normal. Changed to Log-normal. Much better but still had trouble.

RSG Network Assignment (2)

RSG Fitness

RSG Mutation and Combination MUTATION Draw new parameter randomly from normal distribution around previous solution parameter. Currently only mutating best solution. A couple of ‘hyper-mutants’ (mutate all parameters) each generation. RE-COMBINATION ‘Mate’ two attractive solutions. ‘Child’ solution has a 50% chance of getting each parameter from either parent solution.

RSG GA: Pros and Cons PROS Robust to multiple optima – which are possible. Reduces possibility for inconsistencies between estimation and application. Allows inequality constraints on parameters 0 <  <  max Approach obviates need for sampling – improving the statistical efficiency of the estimator, better use of data. CONS Computationally intense. -Ran about 16 processor days. -Didn’t have time to run to convergence. (Need better distributed processing)

RSG Results Ran 1,500 iterations. Obtained improved, not converged solution. –Overall pseudo-LL improved 5.5% –Actual estimate of LL using strict Poisson/Log-normal assumptions improved 1.4% –LL gen only improved marginally 0.2% –LL dist improved 2.6% –LL net only improved 1.7%, but –RMSE improved 8.1% relative to start (34% to 31%)

RSG Improvement GENETIC ALGORITHM Slow, not fully converged, but found solution that better fit both survey data and counts.

RSG Conclusions Modest, but promising results. –Took more time (effort and run time) than initially hoped. –Should take less effort next time. –Obtained modestly improved results, similar to manual calibration. –Could likely obtain better results with more run time. –Could ultimately be cheaper than manual calibration. Will definitely try again! –Continue exploring functional/distributional assumptions. –Need to work on better parallelization. –Want to try technique for model transfers.