Arc travel time and path choice model estimation subsumed

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Mohammadpour, Sobhan, Frejinger, Emma
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915612257681408
author Mohammadpour, Sobhan
Frejinger, Emma
author_facet Mohammadpour, Sobhan
Frejinger, Emma
contents We address the problem of simultaneously estimating arc travel times in a network \emph{and} parameters of route choice models for strategic and tactical network planning purposes. Hitherto, these interdependent tasks have been approached separately in the literature on road traffic networks. We illustrate that ignoring this interdependence can lead to erroneous route choice model parameter estimates. We propose a method for maximum likelihood estimation to solve the simultaneous estimation problem that is applicable to any differentiable route choice model. Moreover, our approach allows to naturally mix observations at varying levels of granularity, including noisy or partial path data. Numerical results based on real taxi data from New York City show strong performance of our method, even in comparison to a benchmark method focused solely on arc travel time estimation.
format Preprint
id arxiv_https___arxiv_org_abs_2210_14351
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Arc travel time and path choice model estimation subsumed
Mohammadpour, Sobhan
Frejinger, Emma
Methodology
Machine Learning
Optimization and Control
We address the problem of simultaneously estimating arc travel times in a network \emph{and} parameters of route choice models for strategic and tactical network planning purposes. Hitherto, these interdependent tasks have been approached separately in the literature on road traffic networks. We illustrate that ignoring this interdependence can lead to erroneous route choice model parameter estimates. We propose a method for maximum likelihood estimation to solve the simultaneous estimation problem that is applicable to any differentiable route choice model. Moreover, our approach allows to naturally mix observations at varying levels of granularity, including noisy or partial path data. Numerical results based on real taxi data from New York City show strong performance of our method, even in comparison to a benchmark method focused solely on arc travel time estimation.
title Arc travel time and path choice model estimation subsumed
topic Methodology
Machine Learning
Optimization and Control
url https://arxiv.org/abs/2210.14351