Exploring link covering and node covering formulations of detection layout problem
Rights accessOpen Access
The primary data input used in principal traffic models comes from Origin-Destination (OD) trip matrices, which describe the patterns of traffic behavior across the network. In this way, OD matrices become a critical requirement in Advanced Traffic Management and/or Information Systems that are supported by Dynamic Traffic Assignment models. However, because OD matrices are not directly observable, the current practice consists of adjusting an initial or seed matrix from link flow counts which are provided by an existing layout of traffic counting stations. The adequacy of the detection layout strongly determines the quality of the adjusted OD. The usual approaches to the Detection Layout problem assume that detectors are located at network links. The first contribution of this paper proposes a modified set that formulates the link detection layout problem with side constraints. It also presents a new metaheuristic tabu search algorithm with high computational efficiency. The emerging Information and Communication Technologies, especially those based on the detection of the electronic signature of on-board devices (such as Bluetooth devices) allow the location of sensors at intersections. To explicitly take into account how these ICT sensors operate, this paper proposes a new formulation in terms of a node covering problem with side constraints that, for practical purposes, can be efficiently solved with standard professional solvers such as CPLEX.
CitationBarcelo, J., Gilliéron, F., Linares, M. P., Serch, O., L. M. Exploring link covering and node covering formulations of detection layout problem. "Transportation research record", Febrer 2012, vol. 2308, p. 17-26.