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. © 2006 IEEE.
Heuristic methods for the optimal location of road traffic monitoring / E., Cipriani; Fusco, Gaetano; S., Gori; M., Petrelli. - STAMPA. - (2006), pp. 1072-1077. (Intervento presentato al convegno IEEE Intelligent Transportation Systems Conference tenutosi a Toronto; Canada nel September 17-20, 2006) [10.1109/itsc.2006.1707364].
Heuristic methods for the optimal location of road traffic monitoring
FUSCO, Gaetano;
2006
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. © 2006 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
