I want to define a problem in Google OR-Tools, in which I can apply the CVRP with constraints on the arcs. In my situation, the arcs between two points are predefined connections, where NOT all points are connected to each other; comparable to a partly-connected undirected graph as shown in this image.
I want to enforce an arc bandwidth constraint: multiple vehicles are allowed in our graph, but each arc (a.k.a. connection) must only allow an x number of vehicles at a time.
The number of vehicles on an arc are dependend on the travel time between two nodes.