resource_across.java~44~

这个是朋友作的毕业设计

package Resource_Selection;

import java.util.*;

public class resource_across {
  Random rd=new Random();
  classad classad = new classad();
  int rdget=0;
  int temp[][], father[];
  temp=new int[20][20];
  public resource_across(int a[][],int m, int n,classad que[]){
  int i=0, j=0;
  rank rank=new rank();
  int lv=0;

//随机取5个父体，将5个父体中适应度最高的保存下来，这样循环，取到足够个个体，n/5个
  while (i<n){
      rdget = Math.abs(rd.nextInt()) % n + 1;
      if (rank.rank(a,rdget,que,m)>lv) {
        lv=rank.rank(a,rdget,que,m);
        father[i/5] = rdget;
    }
    i++;
  }
  i=0;
  int min=rank.rank(a,0,que,m),min_no=0;
  while (i<m){
   int c=rank.rank(a,i,que,m);
   if (c<min){
     min=c;
     min_no=i;
   }
   i++;
  }

  i=0;
  while (i<n){
      temp[0][i]=a[father[i/5]][i];
      i++;
  }
  if (rank.rank(temp,0,que,m)>min) {
    for (i = 0; i < n; i++) {
      a[min_no][i] = temp[0][i];
    }
  }
  }

}