UNBIASED ESTIMATION OF DESTINATION CHOICE MODELS WITH ATTRACTION CONSTRAINTS

Similar documents
Trip Distribution Models in TransCAD. Murtaza Haider Tel: , ext. 2480

Neural Network Weight Selection Using Genetic Algorithms

TRIP DISTRIBUTION MODELLING

Lecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman

Session 2: Fixed and Random Effects Estimation

Transport Modelling in OmniTRANS. Exercise book

March 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms

The Binary Genetic Algorithm. Universidad de los Andes-CODENSA

Solving singularity issues in the estimation of econometric models

Estimation of Item Response Models

Dual-Frame Weights (Landline and Cell) for the 2009 Minnesota Health Access Survey

Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. 1. Introduction

&m1 m2 d 2. f ' The resultant formula has evolved to resemble Bayes' Theorem of conditional probability and is as follows: F t(i,j) P i. A j.

Panel Data 4: Fixed Effects vs Random Effects Models

Dual-Frame Sample Sizes (RDD and Cell) for Future Minnesota Health Access Surveys

Welfare Navigation Using Genetic Algorithm

Outline. CS 6776 Evolutionary Computation. Numerical Optimization. Fitness Function. ,x 2. ) = x 2 1. , x , 5.0 x 1.

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

CIE4801 Transportation and spatial modelling (Uncongested) Assignment

Multi-objective Optimization

Genetic programming. Lecture Genetic Programming. LISP as a GP language. LISP structure. S-expressions

Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations

Ali Abur Northeastern University Department of Electrical and Computer Engineering Boston, MA 02115

Research Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003

Sparse Matrices Reordering using Evolutionary Algorithms: A Seeded Approach

Multi-Sensor Adaptive Signal Processing for Landmines

Three challenges in route choice modeling

Effects of Constant Optimization by Nonlinear Least Squares Minimization in Symbolic Regression

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

Enhanced Genetic Algorithm for Solving the School Timetabling Problem

Cell Phone Location Data for Travel Behavior Analysis

Lab 9. Julia Janicki. Introduction

Software Vulnerability

Theoretical Concepts of Machine Learning

Heteroskedasticity and Homoskedasticity, and Homoskedasticity-Only Standard Errors

Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

Monika Maharishi Dayanand University Rohtak

A Genetic Algorithm Framework

Maximum Density Still Life

STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH MULTIPLE USER CLASSES AND ELASTIC DEMAND

Fall 09, Homework 5

Optimal Detector Locations for OD Matrix Estimation

Multi-objective Optimization

Machine Learning. Topic 5: Linear Discriminants. Bryan Pardo, EECS 349 Machine Learning, 2013

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini

El Dorado County Travel Demand Model 2012 Update. October 14, FINAL User s Manual. Prepared for: El Dorado County.

Simulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016

Local Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )

* Hyun Suk Park. Korea Institute of Civil Engineering and Building, 283 Goyangdae-Ro Goyang-Si, Korea. Corresponding Author: Hyun Suk Park

TRANSPORT PLANNING AND

A TABUSEARCH IMPLEMENTATION TO SOLVE THE LOGICAL TOPOLOGY DESIGN PROBLEM FOR LOW CONGESTION REQUIREMENTS

Automatically Balancing Intersection Volumes in A Highway Network

HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS

APPENDIX D. RESIDENTIAL AND FIRM LOCATION CHOICE MODEL SPECIFICATION AND ESTIMATION

Hybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2

Resource Management in Computer Networks -- Mapping from engineering problems to mathematical formulations

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

ATI Material Do Not Duplicate ATI Material. www. ATIcourses.com. www. ATIcourses.com

Module 7 VIDEO CODING AND MOTION ESTIMATION

NAM-TREE My own methodology for A.I.

HEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A PHARMACEUTICAL MANUFACTURING LABORATORY

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

CS 188: Artificial Intelligence Spring Today

Biclustering Bioinformatics Data Sets. A Possibilistic Approach

Algorithm Design (4) Metaheuristics

Morgan County School District Re-3. Pre-Algebra 9 Skills Assessment Resources. Content and Essential Questions

A Brief Overview of Optimization Problems. Steven G. Johnson MIT course , Fall 2008

Data Mining and Evolutionary Computation Algorithms for Process Modeling and Optimization

Routenwahl im IV - Teil 2

THE DECISION OF THE OPTIMAL PARAMETERS IN MARKOV RANDOM FIELDS OF IMAGES BY GENETIC ALGORITHM

Job Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search

10. Network dimensioning

Lecture VI: Constraints and Controllers. Parts Based on Erin Catto s Box2D Tutorial

Using Genetic Algorithms to Solve the Box Stacking Problem

Nuclear Research Reactors Accidents Diagnosis Using Genetic Algorithm/Artificial Neural Networks

Jednociljna i višeciljna optimizacija korištenjem HUMANT algoritma

Genetic Algorithms Variations and Implementation Issues

METAHEURISTICS. Introduction. Introduction. Nature of metaheuristics. Local improvement procedure. Example: objective function

Statistical Analysis of List Experiments

Generating Uniformly Distributed Pareto Optimal Points for Constrained and Unconstrained Multicriteria Optimization

Florida Rural Household Travel Survey Mobile App

Lab 3: Sampling Distributions

Comparing regret minimization and utility maximization for route choice using the recursive logit model

1. Estimation equations for strip transect sampling, using notation consistent with that used to

REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN

Unsupervised Learning and Clustering

Spatial Patterns Point Pattern Analysis Geographic Patterns in Areal Data

CPSC 340: Machine Learning and Data Mining

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Comparison of Means: The Analysis of Variance: ANOVA

Another Case Study: Genetic Algorithms

CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION

Random Search Report An objective look at random search performance for 4 problem sets

CSE 446 Bias-Variance & Naïve Bayes

DESIGNING ALGORITHMS FOR SEARCHING FOR OPTIMAL/TWIN POINTS OF SALE IN EXPANSION STRATEGIES FOR GEOMARKETING TOOLS

Ellipsoid Algorithm :Algorithms in the Real World. Ellipsoid Algorithm. Reduction from general case

OPTIMAL DESIGN OF WATER DISTRIBUTION SYSTEMS BY A COMBINATION OF STOCHASTIC ALGORITHMS AND MATHEMATICAL PROGRAMMING

A Brief Overview of Optimization Problems. Steven G. Johnson MIT course , Fall 2008

Transcription:

UNBIASED ESTIMATION OF DESTINATION CHOICE MODELS WITH ATTRACTION CONSTRAINTS Vince Bernardin, PhD Steven Trevino John Gliebe, PhD APRIL 14, 2014

WHAT S WRONG WITH ESTIMATING DOUBLY CONSTRAINED DESTINATION CHOICE MODELS WITHOUT SHADOW PRICES Vince Bernardin, PhD Steven Trevino John Gliebe, PhD APRIL 14, 2014

Introduction

The Issue Bias from Inconsistency DESTINATION CHOICE MODELS INCREASINGLY COMMON 5% of MPOs in 2005 At least 10% by 2013, probably 15% or more DOUBLY CONSTRAINED MODELS COMMON IN APPLICATION Primarily for work, but also NHB, etc. USUALLY SINGLY CONSTRAINED VERSION IS ESTIMATED Then calibrated for doubly-constrained application THIS CAN LEAD TO BIASED PARAMETERS Proven for constrained choice models generally (Satsuma et al., 2011) Demonstrated by de Palma et al., 2007 for residential location choice 4

The Reason (DOUBLY) CONSTRAINED MODELS ARE DIFFICULT Standard logit estimation software cannot estimate models with constraints On the one hand, just a generalization of doubly constrained gravity model (as Daly, 1982, nicely demonstrated) On the other hand, this turns out to be a difficult type of model, not GEV, a universal or mother logit model (McFadden et al., 1977) Some recent formulations in academia, but more focused on choice set formation (Zheng and Guo, 2008; Pagliara and Timmermans, 2009; Martinez et al., 2009) Without general theoretical structure, estimation algorithms relying on analytic gradients are not possible 5

A Solution A GENETIC ALGORITHM (GA) Applied to estimate destination choice models for the new Iowa statewide model (itram) GA used the model s application code for estimation - Reduces possibility for inconsistencies between estimation and application in general Both constrained and unconstrained versions of HBW model were estimated Results are compared to demonstrate the significance of parameter bias from estimating constrained model as if it were unconstrained 6

Data / Application

Iowa ITRAM AND NHTS 3,314 zone trip-based statewide model 2,439 (1,745 weekday) household add-on sample to 2009 NHTS 1,992 HBW observations 8

Methodology

Bi-Level Formulation UPPER LEVEL LOG-LIKELIHOOD Max β obs w ij ln P ij LOWER LEVEL CONSTRAINED DESTINATION CHOICE SUCH THAT: P ij = j A je β ij x ij A j e β ij x ij T i P ij = A j j i 10

Metaheuristic ITERATIVE BI-LEVEL PROGRAM Genetic Algorithm Evolve parameters to maximize log-likelihood versus survey Destination Choice Apply the base model given a set of parameters as inputs 11

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 12

Fitness LOG-LIKELIHOOD Model s (PA) trip table matrix normalized by dividing by row sums Produces probability matrix in which each row sums to 1 Log of this matrix multiplied by matrix of weighted survey observations Although partially aggregate, no information loss 13

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 14

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 Allows estimation of embedded decay parameters in accessibility variables CONS Computationally intense - 23.9 days constrained - 20.7 days unconstrained (Need better distributed processing) 15

Results

Constrained Model is Better RHO-SQUARED VS. ZEROS 0.216 constrained 0.189 unconstrained CHI-SQUARED TEST could not reject unconstrained model with 3,314 degrees of freedom 17

Parameter Bias MANY PARAMETERS SIGNIFICANTLY BIASED Variable Constrained Unconstrained Bias Sig. Bias T Total Employment 1.450 1.450 0.999 0.00 Theta 1.000 0.544 0.997 0.00 Accessibility to Employment 0.065 0.065 0.999 0.00 - decay -0.571-0.571 Res. Accessibility x Impedance -0.017-0.020 0.000 6.52 Ln(Res. Accessibility x Impedance+1) -0.381-0.381 0.999 0.00 River Xing -0.001-0.019 0.000 5.19 RRD Xing -0.222-0.025 0.000 11.27 Interstate Xing -0.005-0.087 0.001 2.97 Different County -0.690-0.794 0.009 2.35 Intervening Rural Area -0.003-0.178 0.000 5.96 Intrazonal Constant 0.761 1.277 0.000 8.68 Intrazonal Gen. Accessibility 0.032 0.032 0.999 0.00 Intrazonal Gen. Accessibility Squared -0.009-0.009 0.999 0.00 Log-likelihood -25334.0-26197.0 Rho-squared vs. zeros 0.216 0.189 18

Other Findings INTERVENING RURAL AREAS New psychological barrier Not especially significant in HBW but highly significant for HBO ACCESSIBILITIES Confirmed findings on dual destination accessibilities (to substitutes and compliments) Confirmed value of residential accessibility and impedance interaction 19

Conclusion

Conclusions DANGER OF ESTIMATION APPLICATION INCONSISTENCY Most parameters biased by omission of constraints Difficult to correct for this with manual calibration Could draw wrong conclusions about parameter signficance Unconstrained destination choice model fit worse than doubly constrained gravity model Need for better estimation techniques GENETIC ALGORITHM Many advantages - Robust, unbiased, statistically efficient estimator - Can handle constraints, embedded parameters, etc. Computationally challenging need to improve implementation 21

Last Thoughts WHAT ABOUT OTHER SIMPLIFYING ASSUMPTIONS? Established that sampling can lead to parameter bias in all but the simplest specifications Well known that estimating models without constants can bias parameter estimates Not enough survey data to estimate constants for destinations - Debate about whether we would want to / would they be stable - Model over-specification / saturation, identification issues - Some district constants on the other hand are not uncommon Now exploring simultaneous parameter estimation from household survey and traffic count data using the same genetic algorithm - May provide enough data to estimate constants - Still doesn t resolve whether or not we really want to - But may allow us to at least test if omission of constants leads to specification bias similar to omission of constraints 22

Contacts www.rsginc.com Vince Bernardin, PhD Senior Consultant Vince.Bernardin@inc.com 812-200-2351 Steven Trevino, PhD Analyst Steven.Trevino@inc.com 812-200-2351 John Gliebe, PhD Senior Consultant John.Gliebe@inc.com 888-774-5986