Estimating departure times from traffic counts using dynamic assignment

Conference · Sat Jul 01 04:00:00 EDT 1989

OSTI ID:5269026

Janson, B N; Southworth, F ^[1]

---

1. Oak Ridge National Lab., TN (USA)

A dynamic traffic assignment algorithm and observed traffic counts are used to estimate the distribution of departure times in a trip matrix. The objective is to find the maximum entropy distribution of departure times by origin zone subject to observed traffic counts on a subset of network links. The procedure results in the estimated number of trip departures from each origin in 10-15 minute time intervals of the full analysis period. Such an analysis period will typically range from one to three hours long. We first review the dynamic assignment algorithm developed and tested in a previous paper, and then describe its use with traffic counts to estimate the departure times of a trip matrix. We present an application to a Pittsburgh network in which trip departures are estimated for each 10-minute interval of a peak-hour survey trip matrix. Computational advances such as parallel computing will enable the procedure to be run on large networks while counts are being monitored. Such an application may provide near real-time detection of temporal trip departure profiles by origin zone. 19 refs., 1 fig., 2 tabs.

• Research Organization: Oak Ridge National Lab., TN (USA)
• Sponsoring Organization: FHWA
• DOE Contract Number: AC05-84OR21400
• OSTI ID: 5269026
• Report Number(s): CONF-900121-1; ON: DE89016259
• Country of Publication: United States
• Language: English

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
320203* -- Energy Conservation
Consumption
& Utilization-- Transportation-- Land & Roadway
99 GENERAL AND MISCELLANEOUS
990200 -- Mathematics & Computers
ALGORITHMS
CONTROL
LAND TRANSPORT
MANAGEMENT
MATHEMATICAL LOGIC
MECHANICS
STATISTICAL MECHANICS
TRAFFIC CONTROL
TRANSPORT