resource_across.java

这个是朋友作的毕业设计

package Resource_Selection;

import java.util.*;

public class resource_across {
  Random rd=new Random();
  classad classad = new classad();
  int rdget=0;
  int temp[][]=new int[20][20] ,father[]=new int[20];
  rank rank_across = new rank();
  int i = 0, j = 0;
  int lv = 0;
  int min, min_no = 0,c;
   void resource_across(int a[][],int m, int n,classad que[]){
//随机取5个父体，将5个父体中适应度最高的保存下来，这样循环，取到足够个个体，n/5个
     for(i=0;i<temp.length;i++){
       temp[0][i]=0;
     }
     i=0;
     min = rank_across.rank(a, 0, que, n);
    while (i < n) {
      rdget = Math.abs(rd.nextInt()) % n;
      if (rank_across.rank(a, rdget, que, n) > lv) {
        lv = rank_across.rank(a, rdget, que, n);
        father[i / 5] = rdget;
      }
      i++;
    }
    i = 0;
    while (i < m) {
      c = rank_across.rank(a, i, que, n);
      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_across.rank(temp, 0, que, n) > min) {
      for (i = 0; i < n; i++) {
        a[min_no][i] = temp[0][i];
      }
    }
  }
}