ABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations

Similar documents
TRB Innovations in Travel Modeling Atlanta, June 25, 2018

By using DTA, you accept the following assumptions

Aimsun Next User's Manual

Characteristics of Routes in a Road Traffic Assignment

Comparison of Simulation-Based Dynamic Traffic Assignment Approaches for Planning and Operations Management

Use of Dynamic Traffic Assignment in FSUTMS in Support of Transportation Planning in Florida

Region-wide Microsimulation-based DTA: Context, Approach, and Implementation for NFTPO

Large-scale, high-fidelity dynamic traffic assignment: framework and real-world case studies

Eric J. Nava Department of Civil Engineering and Engineering Mechanics, University of Arizona,

Application of Dynamic Traffic Assignment (DTA) Model to Evaluate Network Traffic Impact during Bridge Closure - A Case Study in Edmonton, Alberta

Agenda. Analysis Tool Selection and Mesoscopic Dynamic Traffic Assignment Models Applications:

An Optimization Approach for Real Time Evacuation Reroute. Planning

Linking TransCAD to Synchro Micro-simulation

Trip Assignment. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1. 2 Link cost function 2

Traffic Management for Smart Cities TNK115 SMART CITIES

NCTCOG Regional Travel Model Improvement Experience in Travel Model Development and Data Management. Presented to TMIP VMTSC.

Lecture-11: Freight Assignment

Travel time uncertainty and network models

EXPLORING SIMULATION BASED DYNAMIC TRAFFIC ASSIGNMENT WITH A LARGE-SCALE MICROSCOPIC TRAFFIC SIMULATION MODEL

Guido Cantelmo Prof. Francesco Viti. Practical methods for Dynamic Demand Estimation in congested Networks

Link and Link Impedance 2018/02/13. VECTOR DATA ANALYSIS Network Analysis TYPES OF OPERATIONS

Modeling Emerging Technology and Travel Behavior

Case Study Evaluation of Dynamic Traffic Assignment Tools

Chapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks

SOUND: A Traffic Simulation Model for Oversaturated Traffic Flow on Urban Expressways

Scheduling. Radek Mařík. April 28, 2015 FEE CTU, K Radek Mařík Scheduling April 28, / 48

Wideband Channel Characterization. Spring 2017 ELE 492 FUNDAMENTALS OF WIRELESS COMMUNICATIONS 1

Modeling route choice using aggregate models

Fast Detour Computation for Ride Sharing

The evening commute with cars and transit: Duality results and user equilibrium for the combined morning and evening peaks

A Decentralized Network in Vehicle Platoons for Collision Avoidance

Trip Assignment. Chapter Overview Link cost function

Next Generation of Adaptive Traffic Signal Control

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Antennas and Propagation. Chapter 6b: Path Models Rayleigh, Rician Fading, MIMO

Control of the Contract of a Public Transport Service

Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks

Estimating the Transmission Probability in Wireless Networks with Configuration Models

Core Input Files + Engines. Node/Link/Activity Location Demand Type/ Vehicle Type VOT Table/ Emission Table. DTALite. Movement Capacity File

A Bi-level Formulation for the Combined Dynamic Equilibrium based Traffic Signal Control

This document is intended for Lighting Control Systems professionals

Utilization-Aware Adaptive Back-Pressure Traffic Signal Control

Performance Evaluation of a Mixed Vehicular Network with CAM-DCC and LIMERIC Vehicles

2015 GDOT PowerPoint. Title Page

Advanced Techniques for Mobile Robotics Location-Based Activity Recognition

Modeling TCP in Multi-Rate Multi-User CDMA Systems

Crash Event Modeling Approach for Dynamic Traffic Assignment

CS 229 Final Project: Using Reinforcement Learning to Play Othello

Optimization of On-line Appointment Scheduling

ASSESSING THE POTENTIAL FOR THE AUTOMATIC DETECTION OF INCIDENTS ON THE BASIS OF INFORMATION OBTAINED FROM ELECTRONIC TOLL TAGS

Opportunistic cooperation in wireless ad hoc networks with interference correlation

Bandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation

A NEW METHOD TO ESTIMATE VALUE OF TIME FOR HIGH-OCCUPANCY-TOLL LANE OPERATION

Optimal Resource Allocation for OFDM Uplink Communication: A Primal-Dual Approach

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment - Supplemental Material -

Use of Probe Vehicles to Increase Traffic Estimation Accuracy in Brisbane

Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents

CS188 Spring 2011 Written 2: Minimax, Expectimax, MDPs

Managing traffic through Signal Performance Measures in Pima County

Adversarial Search. Human-aware Robotics. 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: Slides for this lecture are here:

A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information

State Road A1A North Bridge over ICWW Bridge

Distributed Collaborative Path Planning in Sensor Networks with Multiple Mobile Sensor Nodes

SF2972: Game theory. Mark Voorneveld, February 2, 2015

Patterns and random permutations II

Development of a Dynamic Traffic Assignment Model for Northern Nevada

Game Playing State-of-the-Art

The WISE Experience. Association of Monterey Bay Area Governments (AMBAG) September 20, Bhupendra Patel, Ph.D. Director of Modeling, AMBAG

Optimal Utility-Based Resource Allocation for OFDM Networks with Multiple Types of Traffic

Latest Developments in VISUM

Interconnect-Power Dissipation in a Microprocessor

DOPPLER SHIFT. Thus, the frequency of the received signal is

Greater Ukiah Area Micro-simulation Model Final Report

Approximation Algorithms for Conflict-Free Vehicle Routing

Empirical Probability Based QoS Routing

Dynamic Programming. Objective

Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010

A Topological Model Based on Railway Capacity to Manage Periodic Train Scheduling

Syed Obaid Amin. Date: February 11 th, Networking Lab Kyung Hee University

1 Interference Cancellation

Game Playing State-of-the-Art. CS 188: Artificial Intelligence. Behavior from Computation. Video of Demo Mystery Pacman. Adversarial Search

CS 5522: Artificial Intelligence II

Optimal Bandwidth Allocation with Dynamic Service Selection in Heterogeneous Wireless Networks

Wireless ad hoc networks. Acknowledgement: Slides borrowed from Richard Y. Yale

On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing

Reinforcement Learning in Games Autonomous Learning Systems Seminar

Genetic Algorithm Based Charge Optimization of Lithium-Ion Batteries in Small Satellites. Saurabh Jain Dan Simon

A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks

Mobile Terminal Energy Management for Sustainable Multi-homing Video Transmission

TFA: A Threshold-Based Filtering Algorithm for Propagation Delay and Output Slew Calculation of High-Speed VLSI Interconnects

The Economics of the Marine Sector in Ireland

The Capability of Error Correction for Burst-noise Channels Using Error Estimating Code

Machine Learning and Capri, a Commuter Incentive Program

Noise Exposure History Interview Questions

Fast and efficient randomized flooding on lattice sensor networks

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017

Opportunistic Communications under Energy & Delay Constraints

Assignment Problem. Introduction. Formulation of an assignment problem

Efficiency of Dynamic Arbitration in TDMA Protocols

Multiplayer Pushdown Games. Anil Seth IIT Kanpur

Transcription:

ABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations presented by Matt Stratton, WSP USA October 17, 2017

New CT-RAMP Integrable w/dta Enhanced temporal resolution: Continuous trip departure time choice Individual schedule consistency: Trip departure time and activity duration generated by ABM consistent with travel time generated by DTA Additional important constraint on the state of the system Dynamically updated destination choice sets: Individual learning and adaptation instead of random sampling Moving towards AgBM Explicit driver and passenger roles in carpools: Translation of person trips and tours into vehicle trip and tours

New DTA Integrable w/abm Meso-level DTA for regional planning models: More detail for route choice (occupancy, VOT) Less detail for vehicle simulation Individual route choice (VOT): VOT distribution essential for pricing studies Consistency between mode choice in ABM and route choice in DTA Database of individual trajectories: Mining individual trajectories and sub-trajectories (experienced individual LOS) Selective TDSP: API for selective TDSP call (expected individual LOS)

ABM-DTA INTEGRATION PRINCIPLES 4

Conventional integration

Limitations of feeding back aggregate LOS OD skims Skims is only a surrogate for consistent individual path LOS: Back to 4-step resolution and aggregation biases Infeasible to support segmentation pertinent to ABM ( curse of dimensionality ): VOT categories (7-8 at least) Occupancy categories (3 at least) Departure time bins (15 min at least) All this for (#TAZs) 2 Behaviorally non-appealing: No relation to individual experience, learning, or adaptation

Approach for Day-Level Integration Microsimulation ABM Dynamically updated sample of origins, destinations, and departure times Individual trajectories & TDSP for potential trips List of individual trips Consolidation of individual schedules (inner loop for departure time adjustment) Microsimulation DTA Individual trajectories for the current list of trips Temporal equilibrium to achieve individual schedule consistency

INTERNAL LOOP OF INDIVIDUAL SCHEDULE ADJUSTMENTS Taking advantage of individual trajectories 8

Individual Schedule Consistency Travel Duration Arrival Departure T i d i τ i π i Schedule θ = { } π i Activity i=0 Activity i=1 Activity i=2 Trip i=1 Trip i=2 Trip i=3 Activity i=3 0 24

Individual Schedule Adjustment Schedule deviation minimization approach: Generalization of schedule delay approach developed by K. Small for a single trip Objective function terms with importance weights summed over all trips/activities: α Max(PlanActDur-AdjActDur,0) // shorter β Max(AdjActDur-PlanActDur,0) // longer λ Max(PlanTripDep-AdjTripDep,0) // depart earlier γ Max(PlanTripDep-AdjTripDep,0) // depart later μ Max(PlanTripArr-AdjTripArr,0) // arrive earlier ν Max(PlanTripArr-AdjTripArr,0) // arrive later

Individual Schedule Adjustment Results in LP problem with entire-day schedule consistency constraints Fully consistent with schedule delay models and TOD choice Applied for entire HH and accounts for joint trips Works as a natural randomizer for trip departure time

MINING AND DISSECTING INDIVIDUAL TRAJECTORIES Taking advantage of simulated individual trajectories as the best measure of actual LOS 12

Learning about Space from Individual Trajectories (Dynamic Choice Set) One implemented trip provides individual learning experience w.r.t. multiple destinations [Tian & Chiu, 2014] Destination Origin Intermediate nodes visited on the way: Travel time and cost experienced Parking conditions may not

Bank of Trajectories and Mining Quick mining: Filter user(s): Filter trajectories that span departure time bin (TOD) Filter sub-trajectories that start from OTAZ and TOD Filter sub-trajectories that include DTAZ Aggregation if more than one found: Give precedence to the modeled individual Give precedence to later iterations Averaging rules (max, min, mean, STD)

EQUILIBRATION How the external and internal loops can be combined 15

Travel Stress Behavioral meaning: Experienced travel times unreasonable and/or very different from the expected travel times Individual will seek other travel choices Formal meaning for ABM-DTA equilibration: Empirical gap measure Generated individual activity-travel pattern does not belong to stationary solution Entire daily pattern has to be re-generated Practical daily measures of travel stress : Total daily travel time Travel overhead (travel time / out-of-home activity time) More elaborate measures explored

Travel Stress Thresholds Person type Max total travel time, min Travel time overhead Min total activity time for overhead, min 1=Full-time worker 240 0.5 180 2=Part-time worker 180 0.8 120 3=University student 240 0.8 120 4=Non worker U65 180 1.5 60 5=Retiree 150 1.5 60 6=Driving-age school child 7=Pre-driving-age school child 150 0.4 120 120 0.4 120 8=Preschool child 120 0.8 120 Person is stressed if either the max time is reached or max overhead is reached in combination with min activity time HH is stressed if at least one person is stressed

Stressed and Un-stressed HHs Microsimulation ABM Stressed HHs Dynamically updated sample of origins, destinations, and departure times Individual trajectories & TDSP for potential trips List of individual trips Consolidation of individual schedules (inner loop for departure time adjustment) Individual trajectories for the current list of trips All HHs Microsimulation DTA

OVERVIEW OF 2 PROJECTS Commonality and differences between ARC and MORPC applications 19

2 Parallel applications Columbus, OH (MORPC) 1.4M population 2,000 TAZs 18,000 MAZs 10,000 links CT-RAMP2 ABM DTA daily simulation of 6M vehicles Atlanta, GA (ARC) 5.0M population 5,873 TAZs No MAZs currently 50,000 links CT-RAMP1 ABM DTA daily simulation of 20M vehicles 20

ARC SCENARIOS Results, analysis, and performance of internal loop 21

4 Scenarios Base DTA with fixed demand Base DTA+iSAM (schedule adjustment) I-85 Bridge closure DTA with fixed demand I-85 Bridge closure DTA+iSAM (schedule adjustment)

Overall Scenario Comparison Scenario Average trip time Average delay Unfinished trips Base DTA w/fixed demand 25.81 min 2.90 min 0 Base DTA w/isam 24.63 min 2.64 min 0 I-85 Bridge closure DTA w/fixed demand I-85 Bridge closure DTA w/isam 33.89 min 4.24 min 38,728 30.99 min 3.73 min 26,151

MORPC SCENARIOS Results, analysis, and performance of internal & external loops 24

LOS Skims Replaced w/ Indiv. Trajectories Would the trajectories from several DTA iterations be enough to cover the need for LOS for ABM? How good would be the match between the individual trips and trajectories? Do we still need aggregate skims to fill the gaps? How different are travel times from DTA compared to static assignment? Would the ABM-DTA integrated model require a complete recalibration compared to standard ABM?

Trajectory Coverage Stats TOD Aggregation level 1 2 3 4 9 Total Before 6 83.0% 12.5% 0.2% 0.1% 4.2% 100.0% 6-10 61.3% 5.6% 19.5% 7.6% 5.9% 100.0% 10-15 93.4% 5.7% 0.1% 0.1% 0.7% 100.0% 15-19 66.6% 5.9% 17.2% 6.2% 4.2% 100.0% After 19 92.0% 6.9% 0.1% 0.0% 0.9% 100.0% Total 77.7% 6.1% 9.6% 3.6% 3.0% 100.0%

Travel Time Differences by agglevel: Trajectory-Skim, min 40% 35% 30% 25% 20% 15% 10% 5% 0% agglevel1 agglevel2 agglevel3 agglevel4

Travel Time Differences by TOD: Trajectory-Skim, min 40% 35% 30% 25% 20% 15% 10% 5% 0% early am midday pm night

Impact of DTA on Mode Choice Useful constrained exercise included equilibration of the following 3 components: ABM mode choice only isam DTA It provides a pure impact of substitution of static LOS skims with DTA trajectories: Trip list by all modes stays the same Mode switches can be analyzed at individual level

Mode Gain and Loss by Switching from Static Skims to Dynamic Trajectories 10,000 Mode Gain & Loss: Iteration 1 vs. Iteration 0 5,000 - (5,000) (10,000) (15,000) Gain Loss (20,000)

Mode Gain and Loss (Iter. 2 vs. Iter. 1) 15,000 Mode Gain & Loss: Iteration 2 vs. Iteration 1 10,000 5,000 - (5,000) (10,000) Gain Loss (15,000)

Mode Gain and Loss 15,000 Mode Gain & Loss: Iteration 0 vs Iteration 2 10,000 5,000 - (5,000) (10,000) Gain Loss (15,000)

Observations on Impact of DTA on Mode Choice Overall a well-calibrated ABM does not suffer a stress from switching to DTA No substantial recalibration needed Most shifts are from auto modes to transit and non-motorized in the 1st iteration: More extreme congestion for certain auto trips compared to static skims The opposite equilibration shift from transit and non-motorized modes to auto in the 2nd iteration: Relative congestion relief in the second DTA application

Observations on convergence Schedule consistency and stability are improved over internal iterations and also between the global iterations although each global iteration (ABM) starts with a stress due to a new demand Stressed schedules are improved over internal iterations but not between the iteration 0 and 1 where the main change of LOS (trajectories vs. skims) occur More global iterations needed to analyze convergence

Conclusions Deep integration of ABM and DTA is feasible: Already practical for regions under 1M Many additional new avenues: Moving towards AgBM Runtime is an issue: Integration layer adds only a little DTA and ABM constitute major time-consuming components, especially DTA for large regions

Contacts Matt Stratton Matt.Stratton@wsp.com Peter Vovsha Peter.Vovsha@wsp.com Rosella Picado Rosella.Picado@wsp.com