Path flow estimator in an entropy model using a nonlinear L-shaped algorithm

DOI10.1007/s11067-016-9327-9zbMath1364.90106OpenAlexW2397519446MaRDI QIDQ2358123

Maryam Abareshi, Mehdi Zaferanieh, Bagher Keramati

Publication date: 21 June 2017

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

Full work available at URL: https://doi.org/10.1007/s11067-016-9327-9

zbMATH Keywords

L-shaped algorithmentropy modelorigin-destination matrixpath flow estimationtraffic count

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (3)

Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case ⋮ Origin-destination matrix estimation problem in a Markov chain approach ⋮ A dynamic hierarchical Bayesian model for the estimation of day-to-day origin-destination flows in transportation networks

Cites Work

• Unnamed Item
• Unnamed Item
• An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices
• DTA2012 symposium: Combining disaggregate route choice estimation with aggregate calibration of a dynamic traffic assignment model
• Time dependent origin-destination estimation from traffic count without prior information
• \(L\)-shaped algorithm for two stage problems of stochastic convex programming
• Incorporating ridesharing in the static traffic assignment model
• A heuristic for the doubly constrained entropy distribution/assignment problem
• A relaxation approach for estimating origin-destination trip tables
• Finding the k Shortest Paths
• Origin-Based Algorithm for the Traffic Assignment Problem
• Computing Wardropian equilibria in a complementarity framework

This page was built for publication: Path flow estimator in an entropy model using a nonlinear L-shaped algorithm