遗传算法JAVA.docx

?java常用代码---遗传算法标签：?javadistancecalendarstringrandom算法2011-11-17 18:23?5815人阅读?评论(1)?收藏?举报?分类：?数据结构与算法实践（23）??import java.util.*;public class Tsp {?private String cityName[]={北京,上海,天津,重庆,哈尔滨,长春,沈阳,呼和浩特,石家庄,太原,济南,郑州,西安,兰州,银川,西宁,乌鲁木齐,合肥,南京,杭州,长沙,南昌,武汉,成都,贵州,福建,台北,广州,海口,南宁,昆明,拉萨,香港,澳门};//private String cityEnd[]=new String[34];private int cityNum=cityName.length; //城市个数private int popSize = 50; //种群数量private int maxgens = 20000; //迭代次数private double pxover = 0.8; //交叉概率private double pmultation = 0.05; //变异概率private long[][] distance = new long[cityNum][cityNum];private int range = 2000; //用于判断何时停止的数组区间private class genotype {int city[] = new int[cityNum]; //单个基因的城市序列long fitness; //该基因的适应度double selectP; //选择概率double exceptp; //期望概率int isSelected; //是否被选择}private genotype[] citys = new genotype[popSize];/*** 构造函数，初始化种群*/public Tsp() {for (int i = 0; i popSize; i++) {citys[i] = new genotype();int[] num = new int[cityNum];for (int j = 0; j cityNum; j++)num[j] = j;int temp = cityNum;for (int j = 0; j cityNum; j++) {int r = (int) (Math.random() * temp);citys[i].city[j] = num[r];num[r] = num[temp - 1];temp--;}citys[i].fitness = 0;citys[i].selectP = 0;citys[i].exceptp = 0;citys[i].isSelected = 0;}initDistance();}/*** 计算每个种群每个基因个体的适应度，选择概率，期望概率，和是否被选择。*/public void CalAll(){for( int i = 0; i popSize; i++){citys[i].fitness = 0;citys[i].selectP = 0;citys[i].exceptp = 0;citys[i].isSelected = 0;}CalFitness();CalSelectP();CalExceptP();CalIsSelected();}/*** 填充，将多选的填充到未选的个体当中*/public void pad(){int best = 0;int bad = 0;while(true){?while(citys[best].isSelected = 1 bestpopSize-1)best ++;while(citys[bad].isSelected != 0 badpopSize-1)bad ++;for(int i = 0; i cityNum; i++)citys[bad].city[i] = citys[best].city[i];citys[best].isSelected --;citys[bad].isSelected ++;bad ++;?if(best == popSize ||bad == popSize)break;}}/*** 交叉主体函数*/public void crossover() {int x;int y;int pop = (int)(popSize* pxover /2);while(pop0){x = (int)(Math.random()*popSize);y = (int)(Math.random()*popSize);execute