Origin-destination matrix estimation problem in a Markov chain approach

DOI10.1007/s11067-019-09447-8OpenAlexW2915212070MaRDI QIDQ2005890

Mehdi Zaferanieh, Mohammad Reza Safi, Maryam Abareshi

Publication date: 8 October 2020

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-019-09447-8

zbMATH Keywords

Markov chaintrust-region methodorigin-destination matrixtraffic countsuser-equilibrium assignment

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

Maximum probability O-D matrix estimation in large-sized networks

Uses Software

• pyuvdata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices
• Time dependent origin-destination estimation from traffic count without prior information
• Transit passenger origin-destination estimation in congested transit networks with elastic line frequencies
• A trust region algorithm for nonlinear bilevel programming
• Foundations of bilevel programming
• Path flow and trip matrix estimation using link flow density
• Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
• A relaxation approach for estimating origin-destination trip tables
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• Finding the k Shortest Paths
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Probability theory. A comprehensive course

This page was built for publication: Origin-destination matrix estimation problem in a Markov chain approach