如何向 CPLEX 循环添加约束？

Question

**I want to link energy consumption from one segment to the next,I tried matrices but they didn't work, so I created a Tuple named (arcAndsegment) that receives three parameters: the arc, the segment, and the vehicle. However, I receive an error that says (type <int, int, int > cannot be used with indexation), so I switched to using the loop "for," but it's still not working, and the same error appears.my problem is in the last line that contains energy expression" BatteryCapacity[<i,j,k>]== remainingBatteryCapacity[<i-1,j,k>]+AddedCapacity[<i,j,k>]-EnergyConsumption[<i,j,k>];" Thank you in advance for any assistance.`

int N=10;
range NumNodes=0..6;//max Num of  nodes 
{int}Nodeset=asSet(NumNodes);//node set
range Numofarcs=1..12;//max Num of arcs
{int}arcset=asSet(Numofarcs);//arc set
range Numofvehicles=1..N;//NumOf vehicles
range Numofsegments=1..12;//max Num of segments
{int} segmentset=asSet(Numofsegments);//segments set
range P=1..5;//max Num of paths
{int}pathset=asSet(P);//paths set
tuple path_definition{int a;int b;}
setof (path_definition) paths= {<a,b>| a in pathset,b in Nodeset};
tuple location{int x; int y;}
location NodeLocation [Nodeset];
tuple edge{
  int i;
  int j;
  int k;
}
setof (edge) arc = {<i,j,k>| i,j in Nodeset,k in  Numofsegments :i!=j};

float travelTime[arc]; 
float distance[arc];
tuple speedVcr{
  float speed;
  float vcr;
}
float speed[arc];
tuple Vedge{
  int i;
  int j;
  int k;
}
setof (Vedge) vehicleEdges = {<i,j,k>| i,j in Nodeset,k in Numofvehicles :i!=j};
tuple combinaison{int a; int b; int c;}
setof (combinaison) arcAndsegment={<a,b,c>| a in segmentset,b in arc ,c in  Numofvehicles };


//variables 
float BatteryCapacity[arcAndsegment];
float remainingBatteryCapacity[arcAndsegment]; 
float AddedCapacity[arcAndsegment];
float EnergyConsumption[arcAndsegment];
 
//decision variable 
dvar boolean y[arc][segmentset];
dvar boolean z[arc][segmentset];
dvar boolean s[arc][arc][segmentset];
dvar float+ Ibat;

//float batteryCapacity[segments];
//data
int cbat=800;
int ccab=100;
int cond=500;
float Imax=34;
float Imin=15;
//objective
minimize
  sum(u in arc, j in segmentset) N*cbat*Ibat+ sum(u in arc, j in segmentset) ccab*y[u][j] + sum(u in arc, j in segmentset)cond*z[u][j];

//constraintes
subject to {
forall ( u in arc,j in segmentset)y[u][j]>=z[u][j];

forall ( u in arc,j in segmentset,k in Numofvehicles)
  startBatteryCapacity:
   BatteryCapacity[<0,j,k>]==Imax;
forall (i in segmentset,j in arc,k in Numofvehicles)
   BatteryCapacity[<i,j,k>]== remainingBatteryCapacity[<i-1,j,k>]+AddedCapacity[<i,j,k>]-EnergyConsumption[<i,j,k>];
}  `**

Answer 1

the following works fine:

int N=10;
range NumNodes=0..6;//max Num of  nodes 
{int}Nodeset=asSet(NumNodes);//node set
range Numofarcs=1..12;//max Num of arcs
{int}arcset=asSet(Numofarcs);//arc set
range Numofvehicles=1..N;//NumOf vehicles
range Numofsegments=1..12;//max Num of segments
{int} segmentset=asSet(Numofsegments);//segments set
range P=1..5;//max Num of paths
{int}pathset=asSet(P);//paths set
tuple path_definition{int a;int b;}
setof (path_definition) paths= {<a,b>| a in pathset,b in Nodeset};
tuple location{int x; int y;}
location NodeLocation [Nodeset];
tuple edge{
  int i;
  int j;
  int k;
}
setof (edge) arc = {<i,j,k>| i,j in Nodeset,k in  Numofsegments :i!=j};

float travelTime[arc]; 
float distance[arc];
tuple speedVcr{
  float speed;
  float vcr;
}
float speed[arc];
tuple Vedge{
  int i;
  int j;
  int k;
}
setof (Vedge) vehicleEdges = {<i,j,k>| i,j in Nodeset,k in Numofvehicles :i!=j};
tuple combinaison{int a; edge b; int c;}
setof (combinaison) arcAndsegment={<a,b,c>| a in segmentset,b in arc ,c in  Numofvehicles };


//variables 
float BatteryCapacity[arcAndsegment];
float remainingBatteryCapacity[arcAndsegment]; 
float AddedCapacity[arcAndsegment];
float EnergyConsumption[arcAndsegment];
 
//decision variable 
dvar boolean y[arc][segmentset];
dvar boolean z[arc][segmentset];
dvar boolean s[arc][arc][segmentset];
dvar float+ Ibat;

//float batteryCapacity[segments];
//data
int cbat=800;
int ccab=100;
int cond=500;
float Imax=34;
float Imin=15;
//objective
minimize
  sum(u in arc, j in segmentset) N*cbat*Ibat+ sum(u in arc, j in segmentset) ccab*y[u][j] + sum(u in arc, j in segmentset)cond*z[u][j];

//constraintes
subject to {
forall ( u in arc,j in segmentset)y[u][j]>=z[u][j];

forall ( u in arc,j in segmentset,k in Numofvehicles:u.j==0 && <0,u,k> in arcAndsegment )
  startBatteryCapacity:
   BatteryCapacity[item(arcAndsegment,<0,u,k>)]==Imax;
forall (i in segmentset,j in arc,k in Numofvehicles:i>=2)
   BatteryCapacity[item(arcAndsegment,<i,j,k>)]== remainingBatteryCapacity[item(arcAndsegment,<i-1,j,k>)]+AddedCapacity[item(arcAndsegment,<i,j,k>)]-EnergyConsumption[item(arcAndsegment,<i,j,k>)];
}