An iterative two-stage procedure is proposed that first derives the complete traffic now vector on a transport network and then produces a reliable estimate of the Origin/Destination (O/D) trip matrix. The procedure is based on the measured flows provided by a minimal-cost set of traffic sensors. These are located on the network by solving a suitable combinatorial optimization model through a number of heuristics that achieve good performances. It is shown that solving the sensor location problem may significantly improve the accuracy of common O/D estimation procedures.
Optimal location of traffic counting points for transport network control / L., Bianco; G., Confessore; Reverberi, Pierfrancesco. - (1997), pp. 853-858. ((Intervento presentato al convegno 8th IFAC/IFIP/IFORS Symposium on Transportation Systems tenutosi a KHANIA, GREECE nel JUN 16-18, 1997.
Optimal location of traffic counting points for transport network control
REVERBERI, Pierfrancesco
1997
Abstract
An iterative two-stage procedure is proposed that first derives the complete traffic now vector on a transport network and then produces a reliable estimate of the Origin/Destination (O/D) trip matrix. The procedure is based on the measured flows provided by a minimal-cost set of traffic sensors. These are located on the network by solving a suitable combinatorial optimization model through a number of heuristics that achieve good performances. It is shown that solving the sensor location problem may significantly improve the accuracy of common O/D estimation procedures.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
