New proof shows travel time differences on boundary uniquely identify Riemannian manifold.
problem Identifying Riemannian manifolds from boundary travel time differences.
method New proof with weaker boundary condition.
result Riemannian manifold uniquely determined from boundary travel time differences.
New method clusters travel behavior data from 1990-2017.
problem Challenges in analyzing large-scale travel data.
method Divide and Combine K-means clustering on time series data.
result Activity-travel patterns can be grouped into three clusters.
New proofs confirm travel time data determine simple metrics on a disc.
problem Determining a simple Riemannian metric from travel time data.
method Proofs based on Myers-Steenrod theorem, Lipschitz-type stability estimate.
result Travel time data determine a simple Riemannian metric on a disc up to natural gauge.
Model predicts travel time under rare conditions using a vector-space model.
problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.
Two novel models predict bus travel times with uncertainty, improving connection assurance.
problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.
STAD improves travel time estimation by learning from real traffic data.
problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.
Enhanced travel time prediction using deep neural networks and road network information.
problem Improving travel time estimation using deep learning models.
method Proposes incorporating road network information into deep learning models for travel time prediction.
result Improved travel time prediction, especially with limited training data.
TripDecoder recovers metro routes and travel times from smart card data.
problem Recover unknown routes and travel times in metro systems.
method Decouples two inference tasks: travel time and route preference.
result TripDecoder improves accuracy and efficiency compared to competitors.
Researchers recover material parameters in transversely isotropic media from travel times of qP and qSV waves.
problem Recovering material parameters in transversely isotropic media from travel times of qP and qSV waves.
method Using parabolic type operators and stability estimates for travel times of qP and qSV waves.
result Stability estimates for recovering material parameters from travel times of qP and qSV waves.
DeepTravel uses neural networks to estimate travel time efficiently.
problem Estimating travel time of paths considering complex factors.
method Leverages deep neural networks with auxiliary supervision.
result DeepTravel outperforms existing approaches in estimating travel time.
Bayesian model identifies three types of travelers adapting to feedback.
problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.
Bayesian framework predicts post-disruption travel times in metro networks.
problem Uncertainty in post-disruption travel times in metro networks.
method Bayesian spatiotemporal modeling framework capturing train interactions and non-Gaussian distributional characteristics.
result The proposed models consistently outperform baseline specifications in point prediction and uncertainty quantification.
The Euclidean traveller explores various geometric spaces, seeing different places in each.
problem Understanding the Euclidean traveller's itinerary in different geometric spaces.
method Analyzing the geometric spaces and the traveller's paths.
result The traveller sees a variety of places in different geometric spaces, including tori, closed hyperbolic surfaces, and manifolds.
Method estimates travel times on urban roads using Uber data.
problem Estimating travel times on urban roads where data is scarce.
method Graph representation, trip sampling, least-squares optimization.
result Estimates travel times on arterial roads using aggregated Uber data.
Method recovers obstacles from travel times on curved surfaces.
problem Recovering obstacles from travel times on curved surfaces.
method Extending Noakes and Stoyanov's method to Riemannian surfaces with curvature constraints.
result Obstacles can be recovered from travel times on Riemannian surfaces under certain curvature conditions.
Paper addresses travel time tomography stability and statistical inversion.
problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.
FMA-ETA predicts travel time using FFN with attention.
problem Estimating travel time from spatial-temporal data.
method FFN with Multi-factor self-attention mechanism.
result FMA-ETA outperforms state-of-the-art methods in prediction accuracy with faster inference.
Financial derivatives based on road travel times for hedging and pricing.
problem Market risk in crypto and banking sectors.
method Modeling travel time data with CARMA models and applying risk-neutral pricing.
result Derivatives pricing based on travel time and its volatility.
Unified neural network predicts taxi trip time and distance.
problem Accurate prediction of taxi trip time and distance for better customer experience and resource management.
method Proposes ST-NN, a deep neural network that predicts travel distance and time jointly.
result Significantly reduces mean absolute error for both travel time and distance predictions.
Billiard trajectories in curved spaces have predictable travel times.
problem Understanding travel times in billiard trajectories on curved surfaces.
method Analyzing geodesic flows and sectional curvature to prove time-preserving conjugacy.
result Billiard trajectories with almost identical obstacles have identical shapes.
Study uses neural networks to predict travel times for public transportation.
problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.
This paper presents a bus travel time prediction system using deep neural networks.
problem Accurate travel time predictions for urban buses to compete with other modes of transport.
method Multi-output, multi-time-step deep neural network combining convolutional and LSTM layers.
result The proposed model significantly outperforms other methods and detects small irregular peaks quickly.
Recover simple irreversible Finsler geometry from travel time data
problem Stable recovery of a simple irreversible Finsler geometry
method Use a Gromov-Hausdorff distance adapted to irreversible metric spaces
result Unique and Lipschitz-stable recovery
Same travelling times imply identical obstacles in Riemannian manifolds.
problem Determining if two sets of obstacles are identical based on travel times.
method Analyzing curvature conditions and geodesic intersections.
result Disjoint convex obstacles with identical travel times are identical.
New method estimates travel times more accurately with fewer components.
problem Dynamic number of travel time modes and skewed distributions.
method Gamma mixture densities with sparse estimation and recursive algorithm.
result Improved travel time estimation with fewer components and better fitting accuracy.
Study shows stability of travel time data reconstruction from closed subsets.
problem Reconstruction of length spaces from travel time data on a closed subset.
method Lipschitz stability proof for certain types of length spaces.
result Reconstruction of length spaces is Lipschitz stable from travel time data on a closed subset.
Boosting algorithms improve delivery time prediction in postal services.
problem Challenges in long-term travel time prediction for postal services.
method Investigated linear regression models, tree-based ensembles (random forest, bagging, boosting), and compared their performance.
result Boosting algorithms, especially light gradient boosting and catboost, outperform other methods in accuracy and runtime efficiency.
The paper predicts travel times using tree-based ensembles.
problem Predicting travel times between urban points over short and long horizons.
method Tree-based ensemble methods trained on taxi trip records with additional features from weather and routing data.
result Adding routing data improves model performance and short-term predictions require less data.
Study travel time tomography for transversely isotropic media using modified pseudodifferential calculus.
problem Travel time tomography problem for transversely isotropic media.
method Modified scattering pseudodifferential calculus to solve the tomography problem.
result Construction and use of modified pseudodifferential calculus to solve the tomography problem.
Study validates method using taxi GPS data to monitor network performance.
problem Monitoring transportation network performance with limited data.
method Multi-agent inverse optimization method using taxi GPS probe data.
result Forecasted travel times correlate with observed travel times (0.23-0.56).
Dynamic linear models improve travel time prediction for congested freeways.
problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.
ProbETA models travel time correlations between trips for better navigation.
problem Trip correlations not captured by existing methods.
method Deep hierarchical joint probabilistic model with learnable link representations.
result ProbETA outperforms state-of-the-art methods with 12.60% MAPE reduction.
This study uses Twitter to analyze traveler behavior in Manhattan.
problem Analyzing traveler behavior using social media data.
method Systematic method to extract displacement information from geo-tagged tweets.
result Twitter reveals unique demographics and travel behavior patterns.
DeepIST uses CNNs to estimate travel time from path images.
problem Accurately estimating travel time for a path in urban transportation systems.
method Proposes DeepIST, a neural network framework that converts paths into generalized images and uses PathCNN and 1D CNN to capture spatial and temporal patterns.
result DeepIST significantly outperforms existing models in travel time estimation.
Study on travel time formulas in a lake with wind flow.
problem Travel time in a lake with wind flow.
method Geometric approach using Finsler metrics.
result Formulas for distances and travel times derived.
EikoNet uses deep learning to solve the Eikonal equation quickly and efficiently.
problem Solving the Eikonal equation for first-arrival-time fields in complex 3D structures.
method Grid-free deep learning approach that optimizes network parameters to minimize equation violations.
result EikoNet provides accurate travel time solutions without violating the Eikonal equation.
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
Proves two non-trapping obstacles coincide if scattering rays have similar travelling times or scattering length spectra.
problem Identifying non-trapping obstacles based on scattering properties.
method Proves two obstacles coincide if their scattering rays have similar travelling times or scattering length spectra under weak non-degeneracy conditions.
result Two non-trapping obstacles coincide if their scattering rays have similar travelling times or scattering length spectra.
Paper predicts travel costs across regions using neural networks.
problem Predicting travel costs in sparse, stochastic OD matrices.
method Recurrent Multi-Graph Neural Networks (R-MGNN) for sparse, stochastic OD matrix forecasting.
result Framework effectively predicts future OD matrices without empty elements.
Study shows curves converge to traveling waves under specific conditions.
problem Global stability of traveling waves for area-preserving curvature flow.
method Area-preserving curvature flow with contact angle condition.
result Moving curves converge to traveling waves starting from embedded convex curves.
The study infers passenger types from commute data.
problem Classifying commuters based on travel patterns.
method Constructing eigentravel matrices and using gradient boosting for prediction.
result Gradient boosting method achieves 76% accuracy in passenger type prediction.
A new clustering framework optimizes customer search data for personalized travel recommendations.
problem Personalized travel recommendations based on customer search data.
method Multi-objective optimization-based clustering ensemble framework.
result Optimizes diversity in clustering ensemble search space and automatically determines the number of clusters.
Paper reconstructs compact Riemannian manifolds from travel time data.
problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.
BusTr predicts bus travel times from real-time traffic forecasts.
problem Improving accuracy of bus travel time predictions.
method Neural sequence model trained on real-time traffic forecasts.
result BusTr outperforms DeepTTE by 30% in Mean Absolute Percentage Error (MAPE).
An integral stability estimate is proved for refraction coefficients of two conformal metrics in a plane domain in terms of its travel times. No assumption on absence of conjugate points of geodesics is made.
A new travel time tomography method uses adaptive dictionaries to model slowness variations.
problem Modeling and reconstructing slowness maps with varying scales and discontinuities.
method Local model (sparse patches) and global model (smooth constraints) integrated into a maximum a posteriori formulation.
result The LST approach effectively models both smooth and discontinuous slowness features.
Semi-supervised GANs improve travel mode inference from GPS data.
problem Travel mode inference from GPS trajectories.
method Developed semi-supervised GANs and compared them with CNNs on a large-scale smartphone dataset.
result Best semi-supervised GAN model achieved 83.4% prediction accuracy.
Researchers can reconstruct a Yang-Mills potential from scattering data and travel times.
problem Recovering a Yang-Mills potential from lens data on compact manifolds.
method Using convexity assumptions, reconstructing the potential from scattering data and travel times.
result Lens rigidity for a particle in a Yang-Mills field is demonstrated.