论文信息 - Heuristic methods for the optimal location of road traffic monitoring

Heuristic methods for the optimal location of road traffic monitoring

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

Ernesto Cipriani | Stefano Gori | Gaetano Fusco | Marco Petrelli

[1] B Montella,et al. Metodi e tecnologie dell’ingegneria dei trasporti , 2000 .

[2] Giuseppe Confessore,et al. A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates , 2001, Transp. Sci..

[3] William H. K. Lam,et al. EVALUATION OF COUNT LOCATION SELECTION METHODS FOR ESTIMATION OF O-D MATRICES , 1998 .

[4] Hai Yang,et al. Optimal traffic counting locations for origin–destination matrix estimation , 1998 .

[5] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6] Anthony Chen,et al. Multiobjective Model for Locating Automatic Vehicle Identification Readers , 2004 .

[7] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8] H Spiess. A GRADIENT APPROACH FOR THE O-D MATRIX ADJUSTMENT PROBLEM , 1990 .

[9] William H. K. Lam,et al. Estimation of O-D Matrix from Traffic Counts: How to Determine the Count locations? , 1995 .