private double fitness(Solution solution,double[] weights){
  double max=Double.NEGATIVE_INFINITY;
  for (int i=0; i < solution.getNumberOfObjectives(); i++) {
    max=Math.max(max,Math.max(weights[i],0.0001) * Math.abs(solution.getObjective(i) - idealPoint[i]));
  }
  if (solution.violatesConstraints()) {
    max+=10000.0;
  }
  return max;
}

private double fitness ( Solution solution , double [ ] weights ) { double max = Double . NEGATIVE_INFINITY ; for ( int i = 0 ; i < solution . getNumberOfObjectives ( ) ; i ++ ) { max = Math . max ( max , Math . max ( weights [ i ] , 0.0001 ) * Math . abs ( solution . getObjective ( i ) - idealPoint [ i ] ) ) ; } if ( solution . violatesConstraints ( ) ) { max += 10000.0 ; } return max ; }
evaluates the fitness of the specified solution using the chebyshev weights .
