Deep Policy Dynamic Programming for Vehicle Routing Problems
- 10 June 2022
- book chapter
- Published by Springer Nature
- p. 190-213
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Restricted dynamic programming: A flexible framework for solving realistic VRPsComputers & Operations Research, 2012
- A General VNS heuristic for the traveling salesman problem with time windowsDiscrete Optimization, 2010
- A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaksFlexible Services and Manufacturing Journal, 2010
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demandsEuropean Journal of Operational Research, 2009
- Record Breaking Optimization Results Using the Ruin and Recreate PrincipleJournal of Computational Physics, 2000
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problemEuropean Journal of Operational Research, 1996
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959