public double[] recombine(final doublep[] g1, final doublep[] g2, final double[] g3, final Random r){
	double[] res;
	int i;
	double x;
	res = g3.clone();
	for(i = g3.length; (--i) >= 0;){
		if(r.nextDouble() <= this.cr){
			//this.F是强度参数
			x = res[i] + (this.F*(g1[i] - g2[i]));
			if((this.min < x) && (this.max > x)){
				res[i] = x;
			}
		}
	}
	return res;
}

public class DE<X> extends OptimizationAlgorithm<double[], x>{
  public ITernarySearchOperation<double[]> ternary;
  public int ps;
  public DE(){
  	super();
  	this.ps = 16;
  }
  @Override
  @SupperssWarning("unchecked")
  public Individual<double[], X> solve(final IObjectFunction<X> f){
  	Individual<double[], X>[] parent, children;
  	Individual<double[], X> current, best;
  	int i, j, k;
  	parents = new Individual[this.ps];
  	children = new Individual[this.ps];
  	best = new Individual<>();
  	//初始化人口
  	for(i = children.length; (--i) >= 0){
  	  children[i] = current = new Individual<>();
  	  current.g = this.nullary.create(this.random);
  	}
  	for(;;){
  	  //构建父代人口基数
  	  for(i = children.length;(--i) >= 0){
  	  	current = children[i];
  	  	current.x = this.gpm.gpm(current.g);
  	  	current.v = f.compute(current.x);
  	  	//如果是第一代或者子代优于父代，将当前子代直接取代父代
  	  	if(parents[i] == null || current.v <= parents[i].v){
  	  	  parents[i] = current;
  	  	  if(best == null || best >= current.v){
  	  	  	best = current;
  	  	  }
  	  	}
  	  	if(this.termination.shouldTerminate()){
  	  	  return best;
  	  	}
  	  }
  	  //基因交流，交配产生后代
  	  for(i = children.length; (--i) >= 0;){
  	  	do{
  	  	  j = this.random.nextInt(children.length);
  	  	}while(j == i);
  	  	do{
  	  	  k = this.random.nextInt(children.length);
  	  	}while(j == k || k == i);
  	  	children[i] = current = new Individual<>();
  	  	//三元重组
  	  	current.g = this.ternary.recombine(parents[i].g, parents[j].g, parents[k].g, this.random);
  	  }
  	}
  }
}