A relaxation approach for estimating origin-destination trip tables

DOI10.1007/s11067-007-9059-yzbMath1405.90025OpenAlexW2003719585MaRDI QIDQ2379710

Yanyan Li

Publication date: 19 March 2010

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

Full work available at URL: https://doi.org/10.1007/s11067-007-9059-y

zbMATH Keywords

column generationrelaxationbi-level programstatic O-D estimation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (6)

An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices ⋮ Path flow and trip matrix estimation using link flow density ⋮ Path flow estimator in an entropy model using a nonlinear L-shaped algorithm ⋮ 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 ⋮ A Bayesian network model for origin-destination matrices estimation using prior and some observed link flows

Cites Work

• An efficient dual approach to the urban road network design problem
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints

This page was built for publication: A relaxation approach for estimating origin-destination trip tables