chrom.java

遗传算法 JAVA SQL2000

package com;

//个体
public class Chrom {
	public Chrom(int[] lSubChrom, int[] qNum){
		for(int i=0;i<3; i++){
			for(int j=0; j<lSubChrom[i]; j++){
				chrom[i][j][0] = j;
				chrom[i][j][1] = 0;
			}
			for(int j=0; j<lSubChrom[i]; j++){
				int temp = chrom[i][j][0];
				int m = (int)(Math.random()*180);
				chrom[i][j][0] = chrom[i][m][0];
				chrom[i][m][0] = temp;
			}
			for(int m=0; m<qNum[i]; m++){
				int temp = 0;
				do{
					temp = (int)(Math.random()*180);
				}while(chrom[i][temp][1] == 1);
				chrom[i][temp][1] = 1;
			}
		}
	}
	public void setElement(int qType, int[][] element){
		chrom[qType] = element;
	}
	public int[][] getElement(int qType){
		return chrom[qType];
	}
	public void setFitness(double fitness){
		this.fitness = fitness;
	}
	public double getFitness(){
		return fitness;
	}
	/*
	public void setElement1(int qType, int m, int b){
		chrom[qType][m][0] = b; 		//设置qType类题的第i题的附加码
	}
	public void setParent1(int parent1){
		this.parent1 = parent1;
	}
	public void setParent2(int parent2){
		this.parent2 = parent2;
	}
	public int getParent1(){
		return parent1;
	}
	public int getParent2(){
		return parent2;
	}
	public void setX(double x){
		this.x = x;
	}
	public double getX(){
		return x;
	}
	public void setAppendCode(int i, int a[]){
		appendCode[i] = a;
	}
	public int[][] getAppendCode(){
		return appendCode;
	}
	public void setXSite(int xsite){
		this.xsite = xsite;
	}
	public int getXSite(){
		return xsite;
	}
	 */
	
	private int[][][] chrom = new int[3][180][2];
	//private int[][] appendCode;		//染色体的附加码
	//private double x;
	private double fitness;
	//private int parent1,parent2;
	//xsite;
}