2,216 research outputs found
Distance Oracles for Time-Dependent Networks
We present the first approximate distance oracle for sparse directed networks
with time-dependent arc-travel-times determined by continuous, piecewise
linear, positive functions possessing the FIFO property.
Our approach precomputes approximate distance summaries from
selected landmark vertices to all other vertices in the network. Our oracle
uses subquadratic space and time preprocessing, and provides two sublinear-time
query algorithms that deliver constant and approximate
shortest-travel-times, respectively, for arbitrary origin-destination pairs in
the network, for any constant . Our oracle is based only on
the sparsity of the network, along with two quite natural assumptions about
travel-time functions which allow the smooth transition towards asymmetric and
time-dependent distance metrics.Comment: A preliminary version appeared as Technical Report ECOMPASS-TR-025 of
EU funded research project eCOMPASS (http://www.ecompass-project.eu/). An
extended abstract also appeared in the 41st International Colloquium on
Automata, Languages, and Programming (ICALP 2014, track-A
Hierarchical Time-Dependent Oracles
We study networks obeying \emph{time-dependent} min-cost path metrics, and
present novel oracles for them which \emph{provably} achieve two unique
features: % (i) \emph{subquadratic} preprocessing time and space,
\emph{independent} of the metric's amount of disconcavity; % (ii)
\emph{sublinear} query time, in either the network size or the actual
Dijkstra-Rank of the query at hand
Continuity of the Effective Path Delay Operator for Networks Based on the Link Delay Model
This paper is concerned with a dynamic traffic network performance model,
known as dynamic network loading (DNL), that is frequently employed in the
modeling and computation of analytical dynamic user equilibrium (DUE). As a key
component of continuous-time DUE models, DNL aims at describing and predicting
the spatial-temporal evolution of traffic flows on a network that is consistent
with established route and departure time choices of travelers, by introducing
appropriate dynamics to flow propagation, flow conservation, and travel delays.
The DNL procedure gives rise to the path delay operator, which associates a
vector of path flows (path departure rates) with the corresponding path travel
costs. In this paper, we establish strong continuity of the path delay operator
for networks whose arc flows are described by the link delay model (Friesz et
al., 1993). Unlike result established in Zhu and Marcotte (2000), our
continuity proof is constructed without assuming a priori uniform boundedness
of the path flows. Such a more general continuity result has a few important
implications to the existence of simultaneous route-and-departure choice DUE
without a priori boundedness of path flows, and to any numerical algorithm that
allows convergence to be rigorously analyzed.Comment: 12 pages, 1 figur
Route Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation
networks. For road networks, we show that one can compute driving directions in
milliseconds or less even at continental scale. A variety of techniques provide
different trade-offs between preprocessing effort, space requirements, and
query time. Some algorithms can answer queries in a fraction of a microsecond,
while others can deal efficiently with real-time traffic. Journey planning on
public transportation systems, although conceptually similar, is a
significantly harder problem due to its inherent time-dependent and
multicriteria nature. Although exact algorithms are fast enough for interactive
queries on metropolitan transit systems, dealing with continent-sized instances
requires simplifications or heavy preprocessing. The multimodal route planning
problem, which seeks journeys combining schedule-based transportation (buses,
trains) with unrestricted modes (walking, driving), is even harder, relying on
approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4,
previously published by Microsoft Research. This work was mostly done while
the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at
Microsoft Research Silicon Valle
Existence of simultaneous route and departure choice dynamic user equilibrium
This paper is concerned with the existence of the simultaneous
route-and-departure choice dynamic user equilibrium (SRDC-DUE) in continuous
time, first formulated as an infinite-dimensional variational inequality in
Friesz et al. (1993). In deriving our existence result, we employ the
generalized Vickrey model (GVM) introduced in and to formulate the underlying
network loading problem. As we explain, the GVM corresponds to a path delay
operator that is provably strongly continuous on the Hilbert space of interest.
Finally, we provide the desired SRDC-DUE existence result for general
constraints relating path flows to a table of fixed trip volumes without
invocation of a priori bounds on the path flows.Comment: 21 page
- …