Originally posted by: SystemAdmin

[rahul.raghuromeo said:]

I have a variable TruckJob[t][j][k] where t for trucks(70 trucks) and j and k for jobs(40 jobs). TruckJob[t][j][k] = 1 if Truck t serves job k after serving job j, else it's 0. Now this 3d array creates a lots of problems for cplex and so it's taking a lot of time to find the optimal solution. So, I thought it's better to break this 3d array in to 2 two dimensional array. That is TruckJob[t][j] and SubsequentJob[j][k].

Now if truck t does job j, either it serves job j as it's firstjob of the day or it comes after serving any job k and serves job j then.
This condition is implemented by the constraint

ctnew2b:
    forall (t in Trucks,j in Jobs)
    TruckJob[t][j] == FirstJob[t][j] + sum(k in Jobs)(TruckJob[t][k]*SubsequentJob[k][j]) ;


Now this constraint is extracted, but as soon as it tries to solve the problem, it goes out of memory. Now I don't know what is causing it here to go out of memory. Please help how to solve this issue.
#CPLEXOptimizers
#DecisionOptimization