Show simple item record

dc.contributor.authorBarceló Bugeda, Jaime
dc.contributor.authorGilliéron, Fanny
dc.contributor.authorLinares Herreros, María Paz
dc.contributor.authorSerch Muni, Oriol
dc.contributor.authorMontero Mercadé, Lídia
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.identifier.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.
dc.description.abstractThe 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.
dc.format.extent10 p.
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subject.otherOD Estimation
dc.subject.otherDynamic User Equilibrium
dc.subject.otherTraffic Detector Location
dc.subject.otherLink Covering
dc.subject.otherNode Covering
dc.subject.otherInteger Programming
dc.subject.otherLocation Theory
dc.titleExploring link covering and node covering formulations of detection layout problem
dc.contributor.groupUniversitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.contributor.groupUniversitat Politècnica de Catalunya. MPI - Modelització i Processament de la Informació
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::49 Calculus of variations and optimal control; optimization
dc.rights.accessOpen Access
dc.description.versionPostprint (author's final draft)
upcommons.citation.authorBarcelo, J.; Gilliéron, F.; Linares, M. P.; Serch, O.; Montero, Lídia
upcommons.citation.publicationNameTransportation research record

Files in this item


This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain