2019•EPFL Press eBooksRequires access

Time-Dependent Origin-Destination Estimation Without Assignment Matrices

Ramachandran Balakrishna, Moshe E Ben-Akiva, Haris N. Koutsopoulos

Open publisher page 27 citations

Abstract

Time-dependent origin-destination (OD) flows are crucial inputs to dynamic traffic assignment (DTA) models. However, they are often unobserved, and must be estimated from indirect traffic measurements collected from the study network. Approaches to estimate OD flows from link counts traditionally rely on assignment matrices that map the OD flow variables onto the counts. However, this method (a) approximates the complex relationship between OD flows and counts with a linear function, (b) is restricted to the use of only counts, and cannot exploit richer data such as speeds, densities or travel times, and (c) cannot estimate route choice and supply parameters that critically impact the OD estimates. This chapter presents a dynamic OD estimation method that is accurate and flexible in the use of general traffic data. Moreover, it simultaneously estimates all parameters with an impact on OD estimation, and can be applied to any traffic assignment model.

About this research paper

What this paper is about

Time-dependent origin-destination (OD) flows are crucial inputs to dynamic traffic assignment (DTA) models. However, they are often unobserved, and must be estimated from indirect traffic measurements collected from the study network. Approaches to estimate OD flows from link counts traditionally rely on assignment matrices that map the OD flow variables onto the counts. However, this method (a) approximates the complex relationship between OD flows and counts with a linear function, (b) is restricted to the use of only counts, and cannot exploit richer data such as speeds, densities or travel times, and (c) cannot estimate route choice and supply parameters that critically impact the OD estimates. This chapter presents a dynamic OD estimation method that is accurate and flexible in the use of general traffic data. Moreover, it simultaneously estimates all parameters with an impact on OD estimation, and can be applied to any traffic assignment model.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Time-dependent origin-destination (OD) flows are crucial inputs to dynamic traffic assignment (DTA) models. However, they are often unobserved, and must be estimated from indirect traffic measurements collected from the study network. Approaches to estimate OD flows from link counts traditionally rely on assignment matrices that map the OD flow variables onto the counts. However, this method (a) approximates the complex relationship between OD flows and counts with a linear function, (b) is restricted to the use of only counts, and cannot exploit richer data such as speeds, densities or travel times, and (c) cannot estimate route choice and supply parameters that critically impact the OD estimates. This chapter presents a dynamic OD estimation method that is accurate and flexible in the use of general traffic data. Moreover, it simultaneously estimates all parameters with an impact on OD estimation, and can be applied to any traffic assignment model.

Key concepts: Estimation, Computer science, Biological system, Mathematics, Biology, Engineering, Systems engineering

Related papers

Back to paper searchBrowse research topicsOriginal source
Time-Dependent Origin-Destination Estimation Without Assignment Matrices — Research Paper | ScholarLens