Capacitated Vehicle routing problem (CVRP) Branch-and-cut algorithm using the CVRPSEP package
A C++ implementation of the CVRP undirected 3-index model [1] branch-and-cut algorithm using GUROBI's API and CVRPSEP package [2].
Note: in this code it is used this fork of the CVRPSEP package which fixes some minor issues. Please refer to [3] for further details.
CVRP undirected 3-index formulation
Let $G = (V, E)$ be an undirected graph, $K$ a set of vehicles with capacity of $Q$, and let vertex 0 be the depot and vertices $V' = V \setminus {0}$ be the customers. Consider that there is a demand $d_i$ for each $i \in V'$. The undirected three-index CVRP model can be defined as below [1]:
We noticed rare issues when using the cvrpsep lib in an unrelated project. Friendly reminder that there are minor bug fixes available to the cvrpsep lib at https://github.com/sassoftware/cvrpsep/tree/fixes