Hi or-tools experts,
Now I would like to consider a vrp problem with time window constraints a little differently. In particular, I would like to restrict each vehicle in the fleet to a set of visit locations prior running the solver. Of course, this problem may seem as decoupled TSP's; however, I would like more than one vehicle to service the same location.
For example, Let's say I have the following set of locations indicies
{0,1,2,3,4,5,6,7}
and 2 vehicles
vehicle_0 should service locations {0,1,2,3,4}
vehicle_1 should service locations {4,5,6,7,1}
Note that the two vehicles would like to service nodes 1 and 4, but they shouldn't do that at the same time.
we also may have some time constraints on visiting each of the locations. I am wondering now how we can route these two vehicles.
I hope that my question is clear and I appreciate your help!
All the best,
Mohamed