Le 12/08/2014 par pickup :

R[i][v] represents either if the city i is visited by the vehicle v (0 or 1)
c1777 : forall (v in V, i in I )
( sum (j in J: j!=i) Xijv[i][j][v] >=1 ) => (R[i][v]==1);

c177722 : forall (v in V, i in I )
( sum (j in J: j!=i) Xijv[i][j][v] ==0 ) => (R[i][v]==0);

//********************** distance between citie i and the dépôt***********************
either W[i] represents the distance between city i and the deposit
c188 : forall (v in V, i in I, j in ID2:i!=j)
(R[i][v]==1) => ( W[i]== item(DIJ,<i.i,j.j>).valeur) ;
lets the cost D[v] of routing a vehicle is larger than the sum of the radial distances of the furthest two customers from the depot visitided by the same vehicule v. how can i difine this constraint ???
Best regards