jelvariableprovider.java

Java实现的遗传算法工具集：GA Playground

public class JelVariableProvider {
  public double x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10;
  public double x11,x12,x13,x14,x15,x16,x17,x18,x19,x20;
  
  public double x0() {
  	return x0;
  };

  public double x1() {
  	return x1;
  };

  public double x2() {
  	return x2;
  };

  public double x3() {
  	return x3;
  };

  public double x4() {
  	return x4;
  };

  public double x5() {
  	return x5;
  };

  public double x6() {
  	return x6;
  };

  public double x7() {
  	return x7;
  };

  public double x8() {
  	return x8;
  };

  public double x9() {
  	return x9;
  };

  public double x10() {
  	return x10;
  };

  public double x11() {
  	return x11;
  };

  public double x12() {
  	return x12;
  };

  public double x13() {
  	return x13;
  };

  public double x14() {
  	return x14;
  };

  public double x15() {
  	return x15;
  };

  public double x16() {
  	return x16;
  };

  public double x17() {
  	return x17;
  };

  public double x18() {
  	return x18;
  };

  public double x19() {
  	return x19;
  };

  public double x20() {
  	return x20;
  };
  
  
  
  public void initVariables(double vars[]) {
  	
  	try {
	    x0=vars[0];
	    x1=vars[1];
	    x2=vars[2];
	    x3=vars[3];
	    x4=vars[4];
	    x5=vars[5];
	    x6=vars[6];
	    x7=vars[7];
	    x8=vars[8];
	    x9=vars[9];
	    x10=vars[10];
	    x11=vars[11];
	    x12=vars[12];
	    x13=vars[13];
	    x14=vars[14];
	    x15=vars[15];
	    x16=vars[16];
	    x17=vars[17];
	    x18=vars[18];
	    x19=vars[19];
	    x20=vars[20];
	  }
	  catch (Exception e) {
	  	return;
	  };
  	
  }
  
  
  public void initVariables(double vars[],int highest,int num) {
  	
  	try {
  		if (highest == 1) {
  			x1 = vars[num];
  		}
  		else if (highest == 2) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  		}
  		else if (highest == 3) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  		}
  		else if (highest == 4) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  		}
  		else if (highest == 5) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  			x5 = vars[num+4];
  		}
  		else if (highest == 6) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  			x5 = vars[num+4];
  			x6 = vars[num+5];
  		}
  		else if (highest == 7) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  			x5 = vars[num+4];
  			x6 = vars[num+5];
  			x7 = vars[num+6];
  		}
  		else if (highest == 8) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  			x5 = vars[num+4];
  			x6 = vars[num+5];
  			x7 = vars[num+6];
  			x8 = vars[num+7];
  		}
  		else if (highest == 9) {
  			x1 = vars[num];
  			x2 = vars[num+1];
  			x3 = vars[num+2];
  			x4 = vars[num+3];
  			x5 = vars[num+4];
  			x6 = vars[num+5];
  			x7 = vars[num+6];
  			x8 = vars[num+7];
  			x9 = vars[num+8];
  		}
  		
	  }
	  catch (Exception e) {
	  	return;
	  };
  	
  }
  
};