PSO粒子群优化算法

package pso;


import java.util.Random;


public class Particle {


public double fitness;
public double[] X;
double[] v;
double pbest;// 历史最优解
double ppos[];// 历史最优位置


public static double w;
public static double c1;
public static double c2;
public static Random random = new Random();
public static double[] gpos;
public static int dims;
public static double lower;
public static double upper;


public Particle(double lower, double upper) {
X = new double[dims];
v = new double[dims];
ppos = new double[dims];
for (int i = 0; i < dims; i++) {
X[i] = random.nextDouble() * (upper - lower) + lower;
ppos[i] = X[i];
v[i] = random.nextDouble() * (upper - lower) + lower;
}
pbest = 1e8;
}


/**
* 评估粒子找到的适应值,若发现更好的,则保留为历史最优解
*/
public void