107108109110111112113114115116117
int sameSolutionCount = 0; int iteration = 1; double lastSolution = Double.MAX_VALUE; while (sameSolutionCount < MAX_SAME_SOLUTION) { aco.iteration(); double thisSolution = aco.getBestCost(); builder.setLength(0); builder.append("Iteration: ");