65,821 research outputs found
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
An integrated method for short-term prediction of road traffic conditions for intelligent transportation systems applications
The paper deals with the short-term prediction of road traffic conditions within Intelligent Transportation Systems applications. First, the problem of traffic modeling and the potential of different traffic monitoring technologies are discussed. Then, an integrated method for short-term traffic prediction is presented, which integrates an Artificial Neural Network predictor that forecasts future states in standard conditions, an anomaly detection module that exploits floating car data to individuate possible occurrences of anomalous traffic conditions, and a macroscopic traffic model that predicts speeds and queue progressions in case of anomalies. Results of offline applications on a primary Italian motorway are presented
HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks
A recent approach in modeling and analysis of the supply and demand in
heterogeneous wireless cellular networks has been the use of two independent
Poisson point processes (PPPs) for the locations of base stations (BSs) and
user equipments (UEs). This popular approach has two major shortcomings. First,
although the PPP model may be a fitting one for the BS locations, it is less
adequate for the UE locations mainly due to the fact that the model is not
adjustable (tunable) to represent the severity of the heterogeneity
(non-uniformity) in the UE locations. Besides, the independence assumption
between the two PPPs does not capture the often-observed correlation between
the UE and BS locations.
This paper presents a novel heterogeneous spatial traffic modeling which
allows statistical adjustment. Simple and non-parameterized, yet sufficiently
accurate, measures for capturing the traffic characteristics in space are
introduced. Only two statistical parameters related to the UE distribution,
namely, the coefficient of variation (the normalized second-moment), of an
appropriately defined inter-UE distance measure, and correlation coefficient
(the normalized cross-moment) between UE and BS locations, are adjusted to
control the degree of heterogeneity and the bias towards the BS locations,
respectively. This model is used in heterogeneous wireless cellular networks
(HetNets) to demonstrate the impact of heterogeneous and BS-correlated traffic
on the network performance. This network is called HetHetNet since it has two
types of heterogeneity: heterogeneity in the infrastructure (supply), and
heterogeneity in the spatial traffic distribution (demand).Comment: JSA
Short-Term Forecasting of Passenger Demand under On-Demand Ride Services: A Spatio-Temporal Deep Learning Approach
Short-term passenger demand forecasting is of great importance to the
on-demand ride service platform, which can incentivize vacant cars moving from
over-supply regions to over-demand regions. The spatial dependences, temporal
dependences, and exogenous dependences need to be considered simultaneously,
however, which makes short-term passenger demand forecasting challenging. We
propose a novel deep learning (DL) approach, named the fusion convolutional
long short-term memory network (FCL-Net), to address these three dependences
within one end-to-end learning architecture. The model is stacked and fused by
multiple convolutional long short-term memory (LSTM) layers, standard LSTM
layers, and convolutional layers. The fusion of convolutional techniques and
the LSTM network enables the proposed DL approach to better capture the
spatio-temporal characteristics and correlations of explanatory variables. A
tailored spatially aggregated random forest is employed to rank the importance
of the explanatory variables. The ranking is then used for feature selection.
The proposed DL approach is applied to the short-term forecasting of passenger
demand under an on-demand ride service platform in Hangzhou, China.
Experimental results, validated on real-world data provided by DiDi Chuxing,
show that the FCL-Net achieves better predictive performance than traditional
approaches including both classical time-series prediction models and neural
network based algorithms (e.g., artificial neural network and LSTM). This paper
is one of the first DL studies to forecast the short-term passenger demand of
an on-demand ride service platform by examining the spatio-temporal
correlations.Comment: 39 pages, 10 figure
- …