Originally posted by: bornee
in order to improve the quality of the solution I am asked to calculate the lower bound and upper bound on the distance traveled by each vehicle.
for the lower bound: is the sum of all minimum distance of all the cities or to each node of the network: Gij = the minimum distance that separates the city from any other towns i j such that j different filing.
example
0 10 15 5 4 4
10 0 20 12 75
15 20 0 40 52
5 12 40 0 30
44 75 52 30 0
so G03=5 ; G10= 10 ; G20 = 15 ; G30=5 ; G43=30 so the sum of all this distance is the lower bound SUM (Gij) = 5+10+15+5+30 = 65 = Dmin
ican't modelit this constraint any help please??
for the upper bound: Sij = maximum distance between city i any other cities j such that j different filing. SUM (Sij)= Dmax
the distance traveled by each vehicle is calculated in this way :
c1414 : forall (v in V)
sum (i in I, j in J: i!=j)Xijv[i][j][v]*item(DIJ,<i.i,j.j>).valeur == D[v];
when the distance traversed by each vehicle must be between the lower bound and the upper bound :
Dmin <= D[v] <= Dmax
when v = vehicul and i j the cities
thank you
#DecisionOptimization#OPLusingCPLEXOptimizer