Models and algorithms for the screen line-based traffic-counting location problems
From MaRDI portal
Publication:2566947
DOI10.1016/j.cor.2004.08.011zbMath1088.90006OpenAlexW2110043546MaRDI QIDQ2566947
Hai Yang, Liping Gan, Chao Yang
Publication date: 29 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.08.011
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items
Flow intercepting facility location: Problems, models and heuristics, Vehicle-ID sensor location for route flow recognition: models and algorithms, Locating sensors to observe network arc flows: exact and heuristic approaches, Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm, A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables, Sensor location problem for network traffic flow derivation based on turning ratios at intersection, The support unit location problem to road traffic surveys with multi-stages, Two Applications of Statistics to Traffic Models
Cites Work