Restricted dynamic programming: a flexible framework for solving realistic VRPs

DOI10.1016/j.cor.2011.07.002zbMath1251.90380OpenAlexW2128674029MaRDI QIDQ1762058

Jaoquim António Gromicho, J. M. J. Schutten, A. L. Kok, Jelke J. van Hoorn

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/restricted-dynamic-programming-a-flexible-framework-for-solving-realistic-vrps(034db86b-f7a3-4736-976c-ab39d0cdb1fa).html

zbMATH Keywords

VRPgiant-tour representationreal-life restrictionsrestricted DP

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (10)

Procedures for the bin packing problem with precedence constraints ⋮ A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem ⋮ On an exact method for the constrained shortest path problem ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Vehicle routing under time-dependent travel times: the impact of congestion avoidance ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general heuristic for vehicle routing problems
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• A tabu search approach for the livestock collection problem
• Fast local search algorithms for the handicapped persons transportation problem
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

This page was built for publication: Restricted dynamic programming: a flexible framework for solving realistic VRPs