JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
Neural LNS improves vehicle routing performance.
problem Optimizing vehicle routes with constraints.
method Integrates deep learning with large neighborhood search.
result Significantly outperforms existing methods on CVRP.
New machine learning pipeline solves dynamic vehicle routing problems efficiently.
problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.
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.
A framework for reinforcement learning tackles CVRP with competitive results.
problem Optimizing routes for vehicles with limited capacity.
method Formulates action selection as a mixed-integer optimization problem, uses policy iteration to improve policies.
result Achieves an average gap of 1.7% with state-of-the-art OR methods on CVRP instances.
Video games improve vehicle routing performance.
problem Optimizing vehicle routes with unpredictable passenger requests.
method Replaced vehicle routing with a game, trained agents to play.
result General game-playing agents outperform traditional methods.
New system assigns vehicles to routes for cost and energy efficiency.
problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.
A new dynamic attention model improves vehicle routing problem solutions.
problem Vehicle routing problems (VRP) are NP-hard and challenging to solve.
method Dynamic attention model with a dynamic encoder-decoder architecture.
result The model outperforms previous methods and shows good generalization.
Deep learning solves EV routing with time windows for EV fleets.
problem Electric vehicle routing with time windows for logistics.
method End-to-end deep reinforcement learning with attention model and graph embedding.
result Proposed model efficiently solves large EVRPTW instances.
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.
NeuRewriter learns to choose and rewrite heuristics in combinatorial problems.
problem Time-consuming tuning of heuristics in combinatorial optimization.
method NeuRewriter uses reinforcement learning to learn a policy for picking heuristics and rewriting solutions.
result NeuRewriter outperforms existing methods in various combinatorial tasks.
Reinforcement learning solves VRP efficiently.
problem Optimizing vehicle routes for delivery problems.
method Training a single model with policy gradient to find near-optimal solutions.
result Outperforms classical heuristics and OR-Tools on VRP instances.
iDriveSense offers safer trip recommendations by considering road anomalies.
problem Drivers seek safer routes despite shortest/fastest path recommendations.
method Crowdsensing, vehicle sensors, fuzzy systems for road quality assessment.
result Proposes a system for dynamic route planning considering road anomalies.
SafeRNet uses IoT and cloud computing to provide real-time safe routes.
problem High traffic fatality rates despite advanced technology.
method Bayesian network for safe route modeling.
result Demonstrated effectiveness with real traffic data.
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.
Improves heuristics for routing problems using attention models.
problem Improving heuristics for combinatorial optimization problems, especially for routing problems.
method Proposed a model based on attention layers and trained it using REINFORCE with a simple greedy rollout.
result Significantly improved results for TSP and other routing problems, close to optimal or specialized algorithms.
Paper proposes a probabilistic map-matching method using particle filters.
problem Improving GPS data accuracy by aligning with road network.
method Sequential Monte Carlo algorithm (particle filters).
result Validated technique on GPS data of varying quality.
SECRM-2D improves RL-based autonomous driving with safety guarantees.
problem Safety and efficiency trade-offs in RL-based autonomous driving.
method RL-based controller with safety constraints for efficient and comfortable driving.
result SECRM-2D avoids crashes and improves efficiency and comfort compared to baselines.
Predicts destinations and routes from partial trajectory data.
problem Predicting destinations and routes from partial trajectory data for applications like parking suggestions and ride-sharing.
method Three-step procedure: k-d tree-based space discretization, recurrent neural network for destination prediction, and route calculation.
result Best models predict destinations with a mean error of 1.3 km and 1.43 km.
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.
This paper optimizes multi-currency AMMs to reduce forex trading costs.
problem Lack of direct liquid markets for currency pairs.
method Constant-mean AMM architecture, hierarchical agglomerative clustering algorithm.
result Optimized multi-currency pools reduce trading costs by ~13%.
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.
Proposes a graph neural network for efficient multi-agent routing.
problem Routing multiple agents in complex, sparsely connected graphs with dynamic traffic.
method Value Iteration Network based on graph neural networks for online coordination.
result Significantly outperforms traditional methods in terms of cost and runtime.
A novel controller for wheeled robots handles joystick inputs for smooth steering.
problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.
Deep Q-learning optimizes same-day delivery with vehicles and drones.
problem Optimizing same-day delivery with limited vehicle and drone capacities.
method Deep Q-learning approach to assign packages to vehicles or drones.
result Deep Q-learning policy outperforms benchmark policies and maintains effectiveness with changing fleet sizes.
This research optimizes handover between fog nodes in vehicular IoT using machine learning.
problem Smooth transition of device connections and offloaded tasks between fog nodes in vehicular IoT.
method Proposes a three-layer feed-forward neural network and a dual stacked RNN with LSTM cells to predict fog nodes and minimize service interruption.
result Achieved 99.2% accuracy in predicting fog nodes with a test set.
Deep RL solves global routing problems more efficiently.
problem Challenging problem in electronic circuit design and other systems.
method Deep reinforcement learning for conjoint optimization.
result Deep RL outperforms A* method in routing solutions.
Proposes a new model for predicting future motion of road actors in autonomous vehicles.
problem Forecasting the long-term future motion of road actors for safe autonomous driving.
method Recurrent graph-based attentional approach with interpretable geometric and social relationships.
result Can produce diverse predictions conditioned on hypothetical or 'what-if' scenarios.
Self-driving vehicles improve safety by predicting surrounding vehicles' trajectories.
problem Ensuring safety of self-driving vehicles through better trajectory prediction.
method Developed a Convolutional Neural Network to forecast vehicle trajectories from raw data.
result Improvement over baseline models in trajectory forecasting accuracy.
Deep learning and prior maps improve traffic light recognition for autonomous cars.
problem Recognizing traffic lights for autonomous cars in urban environments.
method Combining deep learning-based detection with prior maps for traffic light identification and state recognition.
result The proposed system correctly identified relevant traffic lights along predefined routes.
A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.
problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.
End-to-end driving network learns navigation and localization from raw data.
problem Lack of full action distribution and localization in end-to-end autonomous driving.
method Variational network for predicting control commands and deterministic navigation, probabilistic localization using noisy GPS.
result Model can predict full probability distribution over possible actions and navigate routes.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.
Capsule networks improve traffic sign detection accuracy.
problem Inability of CNNs to capture pose, view, orientation of traffic signs.
method Proposes capsule networks for traffic sign detection.
result Achieves 97.6% accuracy on GTSRB dataset.
A new approach integrates inventory prediction and routing optimization for better supply chain management.
problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.
Proposes CPO framework for robust decision-making with explainable uncertainty regions.
problem Overly conservative uncertainty regions in data-driven optimization lead to suboptimal decisions.
method Conformal-Predict-Then-Optimize (CPO) framework using conditional generative models and visual summaries.
result Demonstrates improved robustness and explainability in decision-making.
Unified routing and arbitrage with concave continuation.
problem Combining routing and arbitrage in financial markets.
method Extending AMM trade functions to negative inputs via concave continuation.
result Unified approach unifies routing and arbitrage.
Acoustic sensors identify vehicles using spectral embedding.
problem Vehicle recognition from roadside audio sensors.
method Extract frequency signatures, apply spectral embedding for dimensionality reduction.
result K-nearest neighbors achieve accurate vehicle identification after dimensionality reduction.
Paper tackles vehicle make & model classification with improved accuracy.
problem High classification accuracy and reduced annotation time for vehicle images.
method Created a fine-grained database and proposed a pipeline combining SSD and CNN models.
result Approximately 4% better classification accuracy compared to conventional CNN model.
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.
Adaptive stress testing for autonomous vehicles identifies failure scenarios using reinforcement learning.
problem Identifying potential failure scenarios in autonomous vehicle decision-making systems.
method Formulated as a Markov decision process, used reinforcement learning (DRL) to find likely failure scenarios.
result Deep Reinforcement Learning (DRL) finds more likely failure scenarios with fewer simulator calls than Monte Carlo Tree Search (MCTS).
This paper improves nearest neighbor search by learning optimal routing functions.
problem Local minima issues in greedy routing on similarity graphs.
method Learn routing function that considers global graph structure.
result Significant improvement in search performance via learning.
Proposes CTSDG model for better vehicle intention prediction across domains.
problem Domain generalization for vehicle intention prediction in dynamic environments.
method Structural causal model with recurrent latent variable integration.
result Consistent improvement in prediction accuracy compared to state-of-the-art methods.
Generative model learns vehicle trajectory distributions for better data generalization.
problem Data sparsity and privacy issues in urban vehicle trajectory analysis.
method Generative adversarial imitation learning framework for urban vehicle trajectory generation.
result TrajGAIL model produces synthetic trajectories similar to real ones, achieving significant performance gains.
Deep learning improves vehicle control performance and generalizes well.
problem Designing a controller for autonomous vehicles in diverse scenarios.
method Application of deep learning methods for vehicle control.
result Deep learning methods provide excellent performance and generalization.
Optimal alarms detect vehicle collisions with theoretical and empirical validation.
problem Detecting dangerous vehicle collisions in real-time.
method Surveyed and compared three classes of collision detection techniques: Monte Carlo, deterministic approximations, and machine learning.
result Monte Carlo sampling is a robust solution for real-time collision detection despite its simplicity.
Improved particle filters enhance vehicle tracking accuracy.
problem Particle filters struggle with frequent, informative observations.
method Proposes particle filters that sample around recent observations.
result Significant improvement in accuracy and efficiency.
New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.
problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.