The paper deals with two different heuristic approaches for solving the problem of optimal location of traffic count sections (OLTCS), which is a crucial issue of the design of area wide ITS traffic monitoring centers. The first method applies deterministic rules on O/D flows and O/D pairs coverage. The second is based on a genetic algorithm (GA). Both are applied on a real size extra-urban road network and compared to a state-of-the art rule widely used in practical applications.
Cipriani, E., Fusco, G., Gori, S., Petrelli, M. (2006). Heuristic methods for the optimal location of road traffic monitoring. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC (pp.1072-1077). Elsevier [10.1109/ITSC.2006.1707364].
Heuristic methods for the optimal location of road traffic monitoring
CIPRIANI, ERNESTO;PETRELLI, MARCO
2006-01-01
Abstract
The paper deals with two different heuristic approaches for solving the problem of optimal location of traffic count sections (OLTCS), which is a crucial issue of the design of area wide ITS traffic monitoring centers. The first method applies deterministic rules on O/D flows and O/D pairs coverage. The second is based on a genetic algorithm (GA). Both are applied on a real size extra-urban road network and compared to a state-of-the art rule widely used in practical applications.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
