Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

229458687916 · Jun 202019922001200920172026
48 results for Capacitated Vehicle Routing Problem

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.

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.

We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning. In this approach, we train a single model that finds near-optimal solutions for problem instances sampled from a given distribution, only by observing the reward signals and following feasibility rules. Our mo…

2018-02-12abs ↗pdf ↗

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.

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.

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.

Do you remember your first video game console? We remember ours. Decades ago, they provided hours of entertainment. Now, we have repurposed them to solve dynamic and stochastic optimization problems. With deep reinforcement learning methods posting superhuman performance on a wide range of Atari games, we consider the …

2019-11-14abs ↗pdf ↗

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

2018-09-30abs ↗pdf ↗

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.

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.

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.

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 …

2018-03-22abs ↗pdf ↗

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…

2019-10-25abs ↗pdf ↗

Paper tackles inventory management with deep learning, improving performance and adherence to constraints.

problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.

Increasing availability of vehicle GPS data has created potentially transformative opportunities for traffic management, route planning and other location-based services. Critical to the utility of the data is their accuracy. Map-matching is the process of improving the accuracy by aligning GPS data with the road netwo…

2016-11-29abs ↗pdf ↗

Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…

2019-06-20abs ↗pdf ↗

Deep learning has revolutionized the ability to learn "end-to-end" autonomous vehicle control directly from raw sensory data. While there have been recent extensions to handle forms of navigation instruction, these works are unable to capture the full distribution of possible actions that could be taken and to reason a…

2018-11-25abs ↗pdf ↗

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.

Transformers improve solving mixed-integer programs, especially CLSP.

problem Solving Capacitated Lot Sizing Problem (CLSP) with mixed-integer programming.
method Employing transformer models to predict binary variables in CLSP.
result Transformer model outperforms CPLEX and LSTM in solving CLSP.

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.

Continuous monitoring of cardiac health under free living condition is crucial to provide effective care for patients undergoing post operative recovery and individuals with high cardiac risk like the elderly. Capacitive Electrocardiogram (cECG) is one such technology which allows comfortable and long term monitoring t…

2019-03-29abs ↗pdf ↗

In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach is based on a general representation result for monotone convex functionals, a fu…

2017-12-20abs ↗pdf ↗

An active area of research is to increase the safety of self-driving vehicles. Although safety cannot be guarenteed completely, the capability of a vehicle to predict the future trajectories of its surrounding vehicles could help ensure this notion of safety to a greater deal. We cast the trajectory forecast problem in…

2019-02-09abs ↗pdf ↗

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.

Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.

problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.

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.

This paper presents a method for testing the decision making systems of autonomous vehicles. Our approach involves perturbing stochastic elements in the vehicle's environment until the vehicle is involved in a collision. Instead of applying direct Monte Carlo sampling to find collision scenarios, we formulate the probl…

2019-02-05abs ↗pdf ↗