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.
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.
This study develops methods to coordinate travel routes to reduce congestion.
problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.
Two heuristics solve dynamic multiple travelling salesmen problems.
problem Dynamic routing with unknown customers.
method Balanced dynamic closest vehicle heuristic and balanced dynamic assignment vehicle heuristic.
result Continuous approximation models for strategic dynamic routing.
Polestar optimizes public transportation routes for efficiency and user satisfaction.
problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.
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.
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.
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.
A large GPS dataset reveals that a single route often covers 60% of travel observations.
problem Limited insights from small GPS datasets on route choice behavior.
method Evaluation of path generation algorithms including link penalty, link elimination, simulation, and via-node methods.
result Modified link penalty method achieves 97% coverage, significantly higher than previous studies.
Two DRL policies collaborate to solve NP-hard routing problems.
problem Solving complex routing problems like TSP without expert knowledge.
method Learning Collaborative Policies (LCP) using seeder and reviser policies.
result Improves solution quality over single-policy DRL on various NP-hard routing problems.
Equity-Transformer solves NP-hard min-max routing problems efficiently.
problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.
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.
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.
Study improves dynamic PT fleet optimization under noisy demand predictions.
problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of ef…
DPDP combines neural heuristics with DP for vehicle routing problems.
problem Vehicle routing problems with large scale.
method Deep Policy Dynamic Programming (DPDP) that uses a neural network policy to prioritize and restrict the DP state space.
result DPDP improves upon classical DP algorithms and outperforms neural approaches for TSP, VRP, and TSPTW.
Logit models are usually applied when studying individual travel behavior, i.e., to predict travel mode choice and to gain behavioral insights on traveler preferences. Recently, some studies have applied machine learning to model travel mode choice and reported higher out-of-sample predictive accuracy than traditional …
Accurate and reliable travel time predictions in public transport networks are essential for delivering an attractive service that is able to compete with other modes of transport in urban areas. The traditional application of this information, where arrival and departure predictions are displayed on digital boards, is…
DeepCO uses deep learning for offline combinatorial optimization in warehouse operations.
problem Optimizing warehouse operation sequences in offline settings.
method DeepCO framework utilizing distribution regularized optimization for TSP.
result DeepCO reduces route length by 5.7% on average for TSP problems.
Sym-NCO leverages symmetricities to improve DRL-NCO performance.
problem Improving neural combinatorial optimization methods.
method Sym-NCO is a regularizer-based training scheme that exploits universal symmetricities in CO problems and solutions.
result Sym-NCO significantly improves DRL-NCO performance across various CO tasks.
Public transport is one of the major forms of transportation in the world. This makes it vital to ensure that public transport is efficient. This research presents a novel real-time GPS bus transit data for over 500 routes of buses operating in New Delhi. The data can be used for modeling various timetable optimization…
In this paper we sketch some reflections on the pitfalls and inconsistencies of the research program - currently dominant among the profession - aimed at providing microfoundations to macroeconomics along a Walrasian perspective. We argue that such a methodological approach constitutes an unsatisfactory answer to a wel…
Method uses neural networks to solve combinatorial problems.
problem Solving combinatorial problems on raw input data.
method Integrates blackbox combinatorial solvers into neural networks.
result Efficient backward pass through blackbox solvers implemented.
The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention …
New model guarantees integer optimal solutions for combinatorial problems.
problem Finding optimal solutions for combinatorial problems with costly or noisy evaluations.
method Developed a surrogate model with integer-valued minima for combinatorial optimization.
result Outperforms other optimization algorithms on specific combinatorial problems.
We present a new application and covering number bound for the framework of "Machine Learning with Operational Costs (MLOC)," which is an exploratory form of decision theory. The MLOC framework incorporates knowledge about how a predictive model will be used for a subsequent task, thus combining machine learning with t…
Paper optimizes urban navigation with deep learning models.
problem Real-time urban pathfinding challenges.
method Enhanced A* algorithm and neural network model.
result Neural network model outperforms traditional methods, reducing travel times by up to 40%.
This article develops a deep reinforcement learning (Deep-RL) framework for dynamic pricing on managed lanes with multiple access locations and heterogeneity in travelers' value of time, origin, and destination. This framework relaxes assumptions in the literature by considering multiple origins and destinations, multi…
In this paper, we consider same-day delivery with vehicles and drones. Customers make delivery requests over the course of the day, and the dispatcher dynamically dispatches vehicles and drones to deliver the goods to customers before their delivery deadline. Vehicles can deliver multiple packages in one route but trav…
Neural networks struggle with TSP beyond small instances, requiring new approaches.
problem Neural networks struggle to generalize to larger instances of the TSP.
method Unified pipeline to identify inductive biases and promote generalization.
result Zero-shot generalization requires rethinking neural combinatorial optimization.
The fast demographic growth, together with the concentration of the population in cities and the increasing amount of daily waste, are factors that push to the limit the ability of waste assimilation by Nature. Therefore, we need technological means to make an optimal management of the waste collection process, which r…
Linear-time graph optimization using reinforcement learning.
problem Solving combinatorial optimization problems on real-world graphs.
method Graph neural network trained with reinforcement learning.
result Approximate solutions in linear time for various graph problems.
Short-term traffic flow prediction is one of the crucial issues in intelligent transportation system, which is an important part of smart cities. Accurate predictions can enable both the drivers and the passengers to make better decisions about their travel route, departure time and travel origin selection, which can b…
Advanced travel information and warning, if provided accurately, can help road users avoid traffic congestion through dynamic route planning and behavior change. It also enables traffic control centres mitigate the impact of congestion by activating Intelligent Transport System (ITS) proactively. Deep learning has beco…
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.
Graph Neural Networks (GNN) are a promising technique for bridging differential programming and combinatorial domains. GNNs employ trainable modules which can be assembled in different configurations that reflect the relational structure of each problem instance. In this paper, we show that GNNs can learn to solve, wit…
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.
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.
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.
Smartphone data shows promise but accuracy issues remain.
problem Inaccurate travel surveys from smartphone data.
method Training algorithms on data quality and validating labels.
result Machine learning methods are limited by data quality.
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.
Study highlights fairness issues in travel behavior prediction models.
problem Ethical challenges in travel behavior analysis using machine learning.
method Operationalized computational fairness by equality of opportunity; compared DNN and DCM; introduced absolute correlation regularization.
result Both DNN and DCM predict disparities across social groups, with DNN outperforming DCM in prediction disparities.
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.
Over the last few years, traffic data has been exploding and the transportation discipline has entered the era of big data. It brings out new opportunities for doing data-driven analysis, but it also challenges traditional analytic methods. This paper proposes a new Divide and Combine based approach to do K means clust…
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
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.
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.