1. Transportation Planning and Modeling Transportation planning is a field involved with the evaluation, assessment, design and siting of transportation facilities (generally streets, highways, footpaths, bike lanes and public transport lines). – Wikipedia, Aug 29, 2010 Image: public domaintransportationstreetshighwaysfootpathspublic transport

2. Rational Planning Method –defining goals and objectives, –identifying problems, –generating alternatives, –evaluating alternatives, and –developing plans Image: GNU Free Documentation License Daniel SchwenDaniel Schwen, the copyright holder

3. Des Moines MPO http://www.dmampo.org/

9. Planning Options Short run –TSM –TDM –Access Mgmt. –Congestion Mgmt. Long Run –Construction –Land use Future? –Pricing –Technology (ITS, fuels)

10. Congestion Pricing http://www.streetfilms.org/archives/campaign-for-new-yorks-future-congestion-pricing/ Why we don’t use congestion pricing: http://planningresearch.blogspot.com/2007/03/m anville-on-why-we-dont-use-congestion.html http://planningresearch.blogspot.com/2007/03/m anville-on-why-we-dont-use-congestion.html

12. Travel demand modeling Evaluating alternatives requires –Estimated travel demand (trips) –Estimated trip lengths –Estimated modal shares –Estimated travel speeds –Estimated travel delays –Estimate air quality, noise and energy impacts Need a systematic process

13. “Four” step model optional sometimes omitted

14. Data collection Demographic/Socioeconomic Transportation system Travel behavior/propensity/desires –Surveys

15. Study area/zone slide Des Moines MPO Boundary

22. Zones (TAZs)

24. Travel Demand Modeling (Forecasting) What is travel “demand”? Three factors –Land use –Socioeconomics and demographics –Transportation services (TTYP name 3 characteristics of these factors that affect demand)

25. Trip Generation Determine number of “trip ends” Methods –Cross Classification (tables) –Rates based on activity units (ITE) –Regression

26. Trip Distribution Determine origin and destination of trips Methods –Gravity model (Need a good shortest path algorithm) –Growth factor models

27. 1234 5678 9 101112 14151613 6 3 1 2 3 2 3 3 4 4 4 4 1 3 21 1 3 21 2 4 21 Find the shortest path from node to all other nodes (from Garber and Hoel) 1 Yellow numbers represent link travel times in minutes 3

28. 7 8 6 1234 5678 9 101112 14151613 FINAL 1 2 4 4 4 7 6 1010 8 9 9 1010

29. From: Davison E. Soper Univ of Oregon ©1995 - 2008, AMERICAN PHYSICAL SOCIETY APS encourages the redistribution of the materials included in this newspaper provided that attribution to the source is noted and the materials are not truncated or changed. http://mitchlanaillustration.blogspot.com

30. Mode Choice (Split) Which mode (transit, walk, carpool,drive alone, …) will be used? Methods –Direct generation –Trip end models –Trip interchange models

31. Traffic Assignment Which route will the trips take? Methods –Minimum path (distance or time) –Capacity restrained Need a good shortest path algorithm