Time-Expanded Graphs for Flow-Dependent Transit Times
dc.contributor.author | Köhler, Ekkehard | |
dc.contributor.author | Langkau, Katharina | |
dc.contributor.author | Skutella, Martin | |
dc.date.accessioned | 2021-12-17T10:18:48Z | |
dc.date.available | 2021-12-17T10:18:48Z | |
dc.date.issued | 2002 | |
dc.description.abstract | Motivated by applications in road traffic control, we study flows in networks featuring special characteristics. In contrast to classical static flow problems, time plays a decisive role. Firstly, there are transit times on the arcs of the network which specify the amount of time it takes for flow to travel through a particular arc; more precisely, flow values on arcs may change over time. Secondly, the transit time of an arc varies with the current amount of flow using this arc. Especially the latter feature is crucial for various real-life applications of flows over time; yet, it dramatically increases the degree of difficulty of the resulting optimization problems. | en |
dc.identifier.issn | 2197-8085 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15979 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14752 | |
dc.language.iso | en | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.ddc | 510 Mathematik | en |
dc.subject.other | approximation algorithms | en |
dc.subject.other | dynamic flow | en |
dc.subject.other | flow over time | en |
dc.subject.other | graph algorithms | en |
dc.subject.other | network flow | en |
dc.subject.other | routing | en |
dc.subject.other | traffic models | en |
dc.title | Time-Expanded Graphs for Flow-Dependent Transit Times | en |
dc.type | Research Paper | en |
dc.type.version | submittedVersion | en |
tub.accessrights.dnb | free | en |
tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
tub.affiliation.institute | Inst. Mathematik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | en |
tub.series.issuenumber | 2002, 762 | en |
tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
tub.subject.msc2000 | 90B10 Network models, deterministic | en |
tub.subject.msc2000 | 90B20 Traffic problems | en |
tub.subject.msc2000 | 90C35 Programming involving graphs or networks | en |
tub.subject.msc2000 | 05C85 Graph algorithms | en |
tub.subject.msc2000 | 90C59 Approximation methods and heuristics | en |
tub.subject.msc2000 | 68W25 Approximation algorithms | en |
tub.subject.msc2000 | 68Q25 Analysis of algorithms and problem complexity | en |