Originally posted by: PDPP
HI,
i have a problem
i have this constraint :
c2 : forall (t in T,v in V)
sum ( i in I,j in J:j!=i)Xijv[i][j][v][t] <= U[v];
ensure that at evry t the vehicul offer only one service. when (i and j the index of nodes, v index of vehicul and t the periode(T=7 days)
in exemple :
t=1 t=2 t=3 t=4
traject of vehicul : 0................. x5 ...................................... x8 ............................................... x3...........................................0
so : X05v1= 1 / X58v2=1 / X83v3=1 / X30v4=1
so i must modify my model, so the vehicul can spend 2 days to offer a service like
in exemple2 : t=1 t=2 t=3 t=4
traject of vehicul : 0................. x5 ............................................................................................ x3...........................................0
so X05v1=1 / X53v2=1 / X30v4 =1 and at t=3 the vehicul is in route so how can i define this constraint???
i try with this constraint but no results:
c89: forall( v in V, t in T, i in I, j in J: j!=i && (t+1) in T)
( Xijv[i][j][v][t]* item(DIJ,<i.i,j.j>).valeur >= 55 ) => (Xijv[i][j][v][t]==1 && Xijv[i][j][v][t+1]==0);
this constraint ensure that if the distance between i and j more then 55 so the vehicule must spend 2 days to offer a service??
please any help??
#DecisionOptimization#OPLusingCPLEXOptimizer