Deep policy dynamic programming for vehicle routing problems
From MaRDI portal
Publication:2170197
DOI10.1007/978-3-031-08011-1_14zbMath1504.90175arXiv2102.11756OpenAlexW3132134635MaRDI QIDQ2170197
Max Welling, Wouter Kool, Herke van Hoof, Joaquim A. S. Gromicho
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2102.11756
Programming involving graphs or networks (90C35) Artificial neural networks and deep learning (68T07) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items
Neural networks for local search and crossover in vehicle routing: a possible overkill?, Predicting the optimal period for Cyclic Hoist Scheduling Problems, Research on improved ant colony optimization for traveling salesman problem, Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem, Solving large-scale routing optimization problems with networks and only networks, Neural large neighborhood search for routing problems
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Solving the job-shop scheduling problem optimally by dynamic programming
- A general VNS heuristic for the traveling salesman problem with time windows
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- The vehicle routing problem: An overview of exact and approximate algorithms
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Three-dimensional matching instances are rich in stable matchings
- New benchmark instances for the capacitated vehicle routing problem
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Record breaking optimization results using the ruin and recreate principle
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Reinforcement learning for combinatorial optimization: a survey
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Tour Merging via Branch-Decomposition
- Vehicle Routing
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- On the Theory of Dynamic Programming
