Hi,
as a multiple variant, like it is the case for multiple vehicle routing. (I'm aware of the routing library, but for exercise I would like to understand how to model it directly)
As far as I understand, when using multiple "travelers" I cannot simply use "AddCircuit" since flow constraints from that will be violated. (Especially, I would have differing costs for each traveler, similar to the routing library)
My first thoughts are:
1. Create all possible circuits for all "travelers" and choose the ones that are cheapest according to the objective. But that would blow up the combinations depending on the number of travelers.
in order to account for subroutes for each "traveler". As such, I think, I would need to include additional constraints:
* all nodes must be visited once except depot node
* depot node is visited 1 + n_travelers
* travelers must visit disjunctive set of nodes
Is this the right approach? Do I then need to solve it in a similar fashion like the LP variant and eliminate subroutes?
Are there any other approaches?
I'm stuck and would appreciate if you can point me in the right direction.
Thanks!