Originally posted by: sophieTSP
I am trying to solve an extention of the traveling salesman problem and I do not know how to write on OPL cplex, the constraint of elimination of the subtours, I treat the TSP probabilist, (of the customers with present pi). decision with three variables, i, j for clients and k for the scenario:
the subtraction elimination constraint for the classical traveling salesman problem is as follows: at xij's place, i have xijk now
// Subtour elimination constraints.
forall (s in subtours)
sum (i in cities: s.subtour [i]! = 0)
x [minl (i, s.subtour [i]), maxl (i, s.subtour [i])]
<= s.size-1;
};
how could I add the 3rd index on this constraint?
#CPLEXOptimizers#DecisionOptimization