Inhalt des Dokuments
Preprint 35-2004
Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)- Title
- Flows over Time: Towards a more Realistic and Computationally Tractable Model
- Authors
- Classification
-
MSC: primary: 90C27 Combinatorial optimization secondary: 90B10 Network models, deterministic 90B20 Traffic problems 90C35 Programming involving graphs or networks 05C85 Graph algorithms 90C59 Approximation methods and heuristics 68W25 Approximation algorithms 68Q25 Analysis of algorithms and problem complexity - Keywords
-
Approximation algorithms, dynamic flow, flow over time, graph algorithms, network flow, routing, traffic models
- Abstract
-
We introduce a novel model for "Flows over Time" which captures the behavior of cars traveling through a road network better than previous models. We show that computing an optimal solution in the new model is NP-hard and present an LP-based algorithm which we evaluate with several experiments on real world data of road networks and generated requests. Among other things we compare the quality of the solutions with solutions generated by an FPTAS for a related but considerably less realistic model.
- Source
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe