1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
| vector < vector < Vertice > > Algorithm::bestInsertion(Vertice &verticeToInsert, vector < vector < Vertice > >&tempSolution) const {
vector < vector < Vertice > > bestSolution;
double solutionWeight = 0.0;
for (unsigned int i=0; i < tempSolution.size(); i++) {
for (unsigned int j=0; j <= tempSolution.at(i).size(); j++) {
vector < vector < Vertice > > mySolutionCopy = tempSolution;
vector<Vertice>::const_iterator it = mySolutionCopy.at(i).begin();
mySolutionCopy.insert(it, verticeToInsert);
solutionWeight = getSolutionWeight(mySolutionCopy);
printf("poids %f \n",solutionWeight);
}
}
return bestSolution;
} |
Partager