The detection layout problem
| Autor: | Barceló Bugeda, Jaime, Gilliéron, F, Linares Herreros, María Paz, Serch, Oriol, Montero Mercadé, Lídia |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació |
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: |
Link Covering
Node Covering 90 Operations research mathematical programming::90B Operations research and management science [Classificació AMS] Traffic Detector Location Location Theory Operations research Dynamic User Equilibrium Investigació operativa OD Estimation Integer Programming Matemàtiques i estadística::Investigació operativa::Optimització [Àrees temàtiques de la UPC] |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| Popis: | The main traffic models, either for planning or operational purposes, use as major data input Origin-Destination (OD) trip matrices describing the patterns of traffic behavior across the network. OD matrices become in this way a critical requirement of Advanced Traffic Management or Information Systems supported by Dynamic Traffic Assignment models. However, as far as OD matrices are not directly observable, the current practice consist of adjusting an initial or seed matrix from link flow counts provided by an existing layout of traffic counting stations. The adequacy of the detection layout strongly determines the quality of the adjusted OD. Usual approaches to the Detection Layout problem assume that detectors are located at network links but some of the Information and Communication Technologies specially those based on the detection of the electronic signature of on board devices, as for example Bluetooth devices, allow the location of sensor at intersections. This paper proposes a reformulation of the link detection layout problem adapting the classical set covering approaches with side constraints and solving it efficiently by a tabu search metaheuristic. For the intersection layout covering problem a reformulation is proposed in terms of a node covering problem with side constraints that for practical purposes can be efficiently solved with standard professional solvers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|