粒子群算法优化算法资源-CSDN文库

需积分: 9 52 浏览量 2016-01-11 11:20:14 上传评论 2 收藏 142KB DOC 举报

资源推荐

资源详情

资源评论

河南理工大学

计算机科学与技术学院

课程设计报告

2015— 2016 学年第一学期

课程名称 Java

语言程序设计

设计题目利用粒子群算法优化函数

姓名任晓兵

学号 321509010205

专业班级计算机（本） 1502

指导教师刘志中

2015 年 1 月 6 日

1
目录
一．课程设计内容.............................................................................................................................12
(一)课程设计题目......................................................................................................................12
 (二)课程设计目的.....................................................................................................................12
(三)课程设计要求......................................................................................................................12
二．算法相关知识.............................................................................................................................12
(一) 粒子群算法简介.................................................................................................................12
PSO 算法............................................................................................................................12
 (二) 粒子群算法的运算流程....................................................................................................12
三.算法的 JAVA 实现.........................................................................................................................13
 比较编辑：........................................................................................................................................13
演化计算技术.....................................................................................................................................13
(二)主要程序代码......................................................................................................................15
1.主函数..............................................................................................................................15
 3.代码实现.........................................................................................................................15
//package noah;...........................................................................................................................15
.....................................................................................................................................................15
import java.io.BufferedReader;..................................................................................................15
import java.io.FileInputStream;..................................................................................................15
import java.io.IOException;........................................................................................................15
import java.io.InputStreamReader;.............................................................................................15
import java.util.ArrayList;..........................................................................................................15
import java.util.Random;............................................................................................................15
.....................................................................................................................................................15
public class PSO {.......................................................................................................................15
.....................................................................................................................................................15
 private int bestNum;...................................................................................................................15
 private float w;...........................................................................................................................15
 private int MAX_GEN;// 迭代次数..........................................................................................15
 private int scale;// 种群规模......................................................................................................16
.....................................................................................................................................................16
 private int cityNum; // 城市数量，编码长度...........................................................................16
 private int t;// 当前代数.............................................................................................................16
.....................................................................................................................................................16
 private int[][] distance; // 距离矩阵..........................................................................................16
.....................................................................................................................................................16
 private int[][] oPopulation;// 粒子群.........................................................................................16
 private ArrayList<ArrayList<SO>> listV;// 每科粒子的初始交换序列.................................16
.....................................................................................................................................................16
 private int[][] Pd;// 一颗粒子历代中出现最好的解，............................................................16

2
 private int[] vPd;// 解的评价值.................................................................................................16
.....................................................................................................................................................16
 private int[] Pgd;// 整个粒子群经历过的的最好的解，每个粒子都能记住自己搜索到的最
好解.............................................................................................................................................16
 private int vPgd;// 最好的解的评价值.....................................................................................16
 private int bestT;// 最佳出现代数.............................................................................................16
.....................................................................................................................................................16
 private int[] fitness;// 种群适应度，表示种群中各个个体的适应度....................................16
.....................................................................................................................................................16
 private Random random;............................................................................................................16
.....................................................................................................................................................16
 public PSO() {............................................................................................................................16
.....................................................................................................................................................16
 }..................................................................................................................................................16
.....................................................................................................................................................16
 /**...............................................................................................................................................16
 * constructor of GA....................................................................................................................16
 *..................................................................................................................................................16
 * @param n................................................................................................................................16
 * 城市数量.................................................................................................................................16
 * @param g................................................................................................................................16
 * 运行代数.................................................................................................................................16
 * @param w...............................................................................................................................16
 * 权重.........................................................................................................................................16
 **/...............................................................................................................................................16
 public PSO(int n, int g, int s, float w) {.....................................................................................16
 this.cityNum = n;........................................................................................................................16
 this.MAX_GEN = g;..................................................................................................................16
 this.scale = s;..............................................................................................................................16
 this.w = w;..................................................................................................................................16
 }..................................................................................................................................................16
.....................................................................................................................................................16
 // 给编译器一条指令，告诉它对被批注的代码元素内部的某些警告保持静默...............16
 @SuppressWarnings("resource")...............................................................................................17
 /**...............................................................................................................................................17
 * 初始化 PSO 算法类................................................................................................................17
 * @param filename 数据文件名，该文件存储所有城市节点坐标数据..............................17
 * @throws IOException.............................................................................................................17
 */.................................................................................................................................................17
 private void init(String filename) throws IOException {..........................................................17
 // 读取数据.................................................................................................................................17
 int[] x;.........................................................................................................................................17
 int[] y;.........................................................................................................................................17
 String strbuff;.............................................................................................................................17

3
 BufferedReader data = new BufferedReader(new InputStreamReader(...................................17
 new FileInputStream(filename)));.............................................................................................17
 distance = new int[cityNum][cityNum];....................................................................................17
 x = new int[cityNum];................................................................................................................17
 y = new int[cityNum];................................................................................................................17
 for (int i = 0; i < cityNum; i++) {..............................................................................................17
 // 读取一行数据，数据格式 1 6734 1453...............................................................................17
 strbuff = data.readLine();...........................................................................................................17
 // 字符分割.................................................................................................................................17
 String[] strcol = strbuff.split(" ");..............................................................................................17
 x[i] = Integer.valueOf(strcol[1]);// x 坐标.................................................................................17
 y[i] = Integer.valueOf(strcol[2]);// y 坐标.................................................................................17
 }..................................................................................................................................................17
 // 计算距离矩阵........................................................................................................................17
 // ，针对具体问题，距离计算方法也不一样，此处用的是 att48 作为案例，它有 48 个城
市，距离计算方法为伪欧氏距离，最优值为 10628.............................................................17
 for (int i = 0; i < cityNum - 1; i++) {.........................................................................................17
 distance[i][i] = 0; // 对角线为 0................................................................................................17
 for (int j = i + 1; j < cityNum; j++) {.........................................................................................17
 double rij = Math........................................................................................................................17
 .sqrt(((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]).............................................................................17
 * (y[i] - y[j])) / 10.0);.................................................................................................................17
 // 四舍五入，取整....................................................................................................................17
 int tij = (int) Math.round(rij);.....................................................................................................17
 if (tij < rij) {................................................................................................................................17
 distance[i][j] = tij + 1;................................................................................................................17
 distance[j][i] = distance[i][j];.....................................................................................................17
 } else {........................................................................................................................................17
 distance[i][j] = tij;......................................................................................................................17
 distance[j][i] = distance[i][j];.....................................................................................................17
 }..................................................................................................................................................17
 }..................................................................................................................................................17
 }..................................................................................................................................................17
 distance[cityNum - 1][cityNum - 1] = 0;...................................................................................18
.....................................................................................................................................................18
 oPopulation = new int[scale][cityNum];...................................................................................18
 fitness = new int[scale];.............................................................................................................18
.....................................................................................................................................................18
 Pd = new int[scale][cityNum];...................................................................................................18
 vPd = new int[scale];.................................................................................................................18
.....................................................................................................................................................18
 /*.................................................................................................................................................18
 * for(int i=0;i<scale;i++) { vPd[i]=Integer.MAX_VALUE; }..................................................18
 */.................................................................................................................................................18

4
.....................................................................................................................................................18
 Pgd = new int[cityNum];...........................................................................................................18
 vPgd = Integer.MAX_VALUE;.................................................................................................18
.....................................................................................................................................................18
 // nPopulation = new int[scale][cityNum];................................................................................18
.....................................................................................................................................................18
 bestT = 0;....................................................................................................................................18
 t = 0;...........................................................................................................................................18
.....................................................................................................................................................18
 random = new Random(System.currentTimeMillis());.............................................................18
 /*.................................................................................................................................................18
 * for(int i=0;i<cityNum;i++) { for(int j=0;j<cityNum;j++) {...................................................18
 * System.out.print(distance[i][j]+","); } System.out.println(); }..............................................18
 */.................................................................................................................................................18
.....................................................................................................................................................18
 }..................................................................................................................................................18
.....................................................................................................................................................18
 // 初始化种群，多种随机生成办法........................................................................................18
 void initGroup() {......................................................................................................................18
 int i, j, k;.....................................................................................................................................18
 for (k = 0; k < scale; k++)// 种群数...........................................................................................18
 {..................................................................................................................................................18
 oPopulation[k][0] = random.nextInt(65535) % cityNum;........................................................18
 for (i = 1; i < cityNum;)// 粒子个数..........................................................................................18
 {..................................................................................................................................................18
 oPopulation[k][i] = random.nextInt(65535) % cityNum;.........................................................18
 for (j = 0; j < i; j++) {.................................................................................................................18
 if (oPopulation[k][i] == oPopulation[k][j]) {............................................................................18
 break;..........................................................................................................................................18
 }..................................................................................................................................................18
 }..................................................................................................................................................18
 if (j == i) {..................................................................................................................................18
 i++;.............................................................................................................................................18
 }..................................................................................................................................................19
 }..................................................................................................................................................19
 }..................................................................................................................................................19
.....................................................................................................................................................19
 /*.................................................................................................................................................19
 * for(i=0;i<scale;i++) { for(j=0;j<cityNum;j++) {...................................................................19
 * System.out.print(oldPopulation[i][j]+","); } System.out.println(); }.....................................19
 */.................................................................................................................................................19
 }..................................................................................................................................................19
.....................................................................................................................................................19
 void initListV() {........................................................................................................................19