Modeling network traffic for planning applications in a small community

Ming S. Lee, Anthony Chen, Piyan Chootinan, Walter Laabs, Will Recker

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)

Abstract

A procedure is developed to model network traffic for planning applications in small and/or medium-sized communities with limited planning resources. The proposed method is based on the theories and assumptions of conventional four-step travel demand models, but the baseline trip table is estimated from existing traffic counts using path flow estimator (PFE) to render a quick response approach that requires less data than the conventional approach. The proposed modeling approach is suitable for short-range, small area planning applications, such as the evaluation of alternative roadway networks that does not involve significant growth in trip generation patterns. A case study is set up with data from a small community (St. Helena, Calif.) to demonstrate the proposed approach. An O-D trip table is estimated with PFE from traffic counts. The estimation process is shown to be feasible as the results matched observed data with a satisfactory error bound. The traffic impacts of various scenarios of land use and network changes can be effectively evaluated with the proposed modeling approach.
Original languageEnglish
Pages (from-to)156-159
Number of pages4
JournalJournal of Urban Planning and Development
Volume132
Issue number3
DOIs
Publication statusPublished - 1 Sept 2006
Externally publishedYes

Keywords

  • Forecasting
  • Traffic analysis
  • Traffic engineering
  • Traffic models
  • Urban planning

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Civil and Structural Engineering
  • Development
  • Urban Studies

Fingerprint

Dive into the research topics of 'Modeling network traffic for planning applications in a small community'. Together they form a unique fingerprint.

Cite this