Combines TSP and SC to solve real-world vaccine distribution.
problem Combining TSP and SC for efficient vaccine distribution.
method Mixed Integer Programming (MIP) and machine learning.
result Machine learning approach improves solution efficiency.
Study compares RL and SL for TSP, finds RL better for variable graph sizes.
problem Training deep neural networks for the Travelling Salesman Problem.
method Controlled experiments with supervised and reinforcement learning models on fixed and variable sized graphs.
result Reinforcement learning leads to better generalization to variable graph sizes.
Structure learning of Bayesian networks is an important problem that arises in numerous machine learning applications. In this work, we present a novel approach for learning the structure of Bayesian networks using the solution of an appropriately constructed traveling salesman problem. In our approach, one computes an…
In this paper a highly abstracted view on the historical development of Genetic Algorithms for the Traveling Salesman Problem is given. In a meta-data analysis three phases in the development can be distinguished. First exponential growth in interest till 1996 can be observed, growth stays linear till 2011 and after th…
Deep RL learns 2-opt heuristics to improve TSP solutions.
problem Improving TSP solutions beyond initial heuristics.
method Deep reinforcement learning to learn 2-opt operations.
result Learned policies improve solutions faster than previous methods.
This paper introduces a new learning-based approach for approximately solving the Travelling Salesman Problem on 2D Euclidean graphs. We use deep Graph Convolutional Networks to build efficient TSP graph representations and output tours in a non-autoregressive manner via highly parallelized beam search. Our approach ou…
Machine learning reduces combinatorial optimization problem dimensions.
problem Reducing the complexity of large combinatorial optimization problems.
method Generalization of a machine learning model for problem reduction on TSP.
result Machine learning can predict which variables are not part of an optimal solution.
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.
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.
A new scheme reduces global search cost by a square root factor.
problem Challenges in finding global minimum of cost functions.
method Gradient descent combined with a biased crossover of two good solutions.
result Quadratic speedup of global search efficiency.
Graph Pointer Networks and hierarchical reinforcement learning solve combinatorial optimization problems like TSP.
problem Traveling Salesman Problem (TSP) with constraints.
method Graph Pointer Networks (GPNs) and hierarchical reinforcement learning.
result GPNs and hierarchical RL find optimal solutions for TSP and TSP with time windows.
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.
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.
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.
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.
Deep learning has been extended to a number of new domains with critical success, though some traditional orienteering problems such as the Travelling Salesman Problem (TSP) and its variants are not commonly solved using such techniques. Deep neural networks (DNNs) are a potentially promising and under-explored solutio…
In this paper we introduce a new neural architecture for sorting unordered sequences where the correct sequence order is not easily defined but must rather be inferred from training data. We refer to this architecture as OrderNet and describe how it was constructed to be naturally permutation equivariant while still al…
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.
This paper presents a framework to tackle combinatorial optimization problems using neural networks and reinforcement learning. We focus on the traveling salesman problem (TSP) and train a recurrent network that, given a set of city coordinates, predicts a distribution over different city permutations. Using negative t…
In this work, we provide theoretical guarantees for reward decomposition in deterministic MDPs. Reward decomposition is a special case of Hierarchical Reinforcement Learning, that allows one to learn many policies in parallel and combine them into a composite solution. Our approach builds on mapping this problem into a…
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 …
Bayesian optimization method for permutations accelerates combinatorial search.
problem Optimizing expensive-to-evaluate objectives on permutation problems.
method LAW2ORDER, a batch Bayesian optimization method based on the acquisition weighted kernel.
result LAW2ORDER achieves sublinear batch cumulative regret, demonstrating accelerated search.
The design of good heuristics or approximation algorithms for NP-hard combinatorial optimization problems often requires significant specialized knowledge and trial-and-error. Can we automate this challenging, tedious process, and learn the algorithms instead? In many real-world applications, it is typically the case t…
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.
New research shows deep learning struggles with hard problems due to biased data generation.
problem Deep learning's limitations in solving computationally hard problems.
method Proved that polynomial-time sample generators for NP-hard problems sample from easier sub-problems.
result Machine learning models trained on biased datasets overestimate their accuracy for hard problems.
Adversarial self-play in two-player games has delivered impressive results when used with reinforcement learning algorithms that combine deep neural networks and tree search. Algorithms like AlphaZero and Expert Iteration learn tabula-rasa, producing highly informative training data on the fly. However, the self-play t…
This paper explores the possibility of near-optimally solving multi-agent, multi-task NP-hard planning problems with time-dependent rewards using a learning-based algorithm. In particular, we consider a class of robot/machine scheduling problems called the multi-robot reward collection problem (MRRC). Such MRRC problem…
New L2D framework allows deferring specific parts of a sequence prediction to experts.
problem Current L2D methods defer entire predictions, which is not ideal for long sequences.
method Proposes token-level and one-time rejectors to defer specific outputs of a model prediction to experts.
result Granular deferrals achieve better cost-accuracy tradeoffs than whole deferrals.
New framework analyzes effectiveness of neural network-based combinatorial problem solvers.
problem Analyzing neural network-based methods for combinatorial optimization problems.
method Introducing a theoretical framework to assess the effectiveness of solution-samplers using policy-gradient methods.
result Positive theoretical answer to the existence of expressive, tractable, and benign optimization landscapes for combinatorial problems.
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.
We introduce a new neural architecture to learn the conditional probability of an output sequence with elements that are discrete tokens corresponding to positions in an input sequence. Such problems cannot be trivially addressed by existent approaches such as sequence-to-sequence and Neural Turing Machines, because th…
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.
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.
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.
This paper distills a complex travel mode choice model into simpler, interpretable models.
problem Lack of interpretability in complex machine learning models for travel behavior.
method Model distillation combined with market segmentation.
result Generated interpretable models that closely match the predictions of the original complex model.
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.
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.
In building intelligent transportation systems such as taxi or rideshare services, accurate prediction of travel time and distance is crucial for customer experience and resource management. Using the NYC taxi dataset, which contains taxi trips data collected from GPS-enabled taxis [23], this paper investigates the use…
We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an n-vertex complete graph that needs to be inferred from noisy edge measurements. The measurements are independent and distributed according to $\calP_n$ for edges in the cycle and $\calQ_n$ otherwise. This …