Skip to content

for Vehicle Routing Problems

· 0 citations · 73 references

TL;DR

Deep Policy Dynamic Programming is proposed, which aims to combine the strengths of learned neural heuristics with those of DP algorithms, and prioritizes and restricts the DP state space using a policy derived from a deep neural network, which is trained to predict edges from example solutions.

View source

Similar papers

Mar 2024

Smart Routes: A System for Development and Comparison of Algorithms for Solving Vehicle Routing Problems with Realistic Constraints

The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth. While we are aware of approaches that theoretically provide an exact optimal solution, their application becomes challenging as the problem size increases because of exponential com...

A. Soroka, German Mikhelson, A. Mescheryakov et al. · 0 citations
Open access Aug 2026

Application of Reinforcement Learning for Optimizing the Capacitated Vehicle Routing Problem

These findings demonstrate that reinforcement learning is a promising and scalable alternative to conventional heuristic and metaheuristic approaches for capacitated routing problems, particularly in dynamic logistics environments that require rapid and adaptive decision making.

Audrey Ariij Sya'imaa.HS, Hilda Azkiyah, Khandker Farid Uddin Ahmed · 0 citations
#reinforcement learning Open access Sep 2026

Reinforcement learning for initializing genetic algorithms in vehicle routing

This work introduces an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions, which are then further optimized by a genetic algorithm, enabling real-time and interactive routing at scale.

Ido Greenberg, P. Sielski, Hugo Linsenmaier et al. · 1 citation
#machine learning Preprint Aug 2026

JAMPR+/L2D: scalable neural heuristic for constrained vehicle routing problems in dynamic environment

It is shown that the JAMPR+/L2D model, proposed in to solve large CPDPTW problems can be adopted in the case of substantial changes of graph distance matrix, and generalizes well for tasks with simpler constraints (CVRP, VRPTW), for different problem sizes and for moderate changes in distance matrixes.

A. Soroka, A. Meshcheryakov · 0 citations
Open access Aug 2026

A solution method for the traveling salesman problem based on multi-scale features and dynamic optimization

A multi-scale deep optimization model based on an encoder-decoder architecture that validates the effectiveness of the multi-scale EMA and Triplet-Reasoning mechanisms, providing a new direction for deep learning-based graph optimization research.

Yu-Ting Xie, Qianqian Duan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.