VRPSolverEasy is the first practical tool for the exact solution of VRPs: (1) User-friendly; (2) Covers most classic variants and their combinations; (3) Small running times up to a respectable instance size (like 100 customers) @rrsadykov @najibprog@edu_queiroga
VRPSolverEasy supports many popular VRP variants and even allows for arbitrary combinations of them. Harness the power of sophisticated exact Branch-Cut-and-Price algorithms without the complexity. Check the accompanying paper hal.inria.fr/hal-04057985/do…
VRPSolverEasy allows you to define routing problems using familiar elements like depots, customers, links, and vehicle types. This user-friendly approach makes it accessible to routing practitioners while maintaining top-notch performance. #Optimization#Routing
🚀 Exciting news for the routing community! We're proud to announce VRPSolverEasy, a Python interface for VRPSolver that does not require any knowledge of Mixed Integer Programming modeling. pypi.org/project/VRPSolverEa…#VRPSolverEasy#VRP