Using Reinforcement Learning for the Three-Dimensional Loading Capacitated Vehicle Routing Problem

The 3L-CVRP is a long-standing problem in the operations research literature. However, these existing approaches have two shortcomings. First, existing approaches are based on heuristics that are limited by the quality of the chosen rules and need to be adapted to new scenarios by domain experts. Second, existing approaches require convergence towards near-optimal solutions, which is computationally expensive.

Data and Resources

Cite this as

Schoepf S.a, Mak S.a, Xu L.a, Senoner J.b, Netland T.b, Brintrup A.a (2025). Dataset: Using Reinforcement Learning for the Three-Dimensional Loading Capacitated Vehicle Routing Problem. https://doi.org/10.57702/mf7nd9aq

DOI retrieved: January 3, 2025

Additional Info

Field Value
Created January 3, 2025
Last update January 3, 2025
Defined In https://doi.org/10.48550/arXiv.2307.12136
Author Schoepf S.a
More Authors
Mak S.a
Xu L.a
Senoner J.b
Netland T.b
Brintrup A.a
Homepage https://github.com/if-loops/3L-CVRP