PsoAlgorithm.java 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412
  1. package algorithm.binary;
  2. import java.util.ArrayList;
  3. import java.util.List;
  4. import java.util.TreeSet;
  5. import java.util.stream.Collectors;
  6. import javax.swing.JFrame;
  7. import api.AlgorithmFrameworkFlex;
  8. public class PsoAlgorithm extends AlgorithmFrameworkFlex{
  9. //Parameter for Algo with default Values:
  10. private int swarmSize = 20;
  11. private int maxIterations = 100;
  12. private double dependency = 2.07;
  13. private int mutationInterval = 1;
  14. private boolean useIntervalMutation = true;
  15. private double mutationRate = 0.01;
  16. private double mutateProbabilityInterval = 0.01;
  17. private double maxMutationPercent = 0.01;
  18. private double c1, c2, w;
  19. private double maxVelocity = 4.0;
  20. private boolean moreInformation = false;
  21. public static void main(String[] args)
  22. {
  23. JFrame newFrame = new JFrame("exampleWindow");
  24. PsoAlgorithm instance = new PsoAlgorithm();
  25. newFrame.setContentPane(instance.getPanel());
  26. newFrame.pack();
  27. newFrame.setVisible(true);
  28. newFrame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
  29. }
  30. public PsoAlgorithm() {
  31. super();
  32. addIntParameter("swarmSize", swarmSize, intValue -> swarmSize = intValue, () -> swarmSize, 1);
  33. addIntParameter("maxIterations", maxIterations, intValue -> maxIterations = intValue, () -> maxIterations, 1);
  34. addDoubleParameter("dependency", dependency, doubleValue -> dependency = doubleValue, () -> dependency, 2.001, 2.4);
  35. addIntParameter("mutationInterval", mutationInterval, intValue -> mutationInterval = intValue, () -> mutationInterval, 0);
  36. addBooleanParameter("useIntervalMutation", useIntervalMutation, booleanValue -> useIntervalMutation = booleanValue);
  37. addDoubleParameter("mutateProbabilityInterval", mutateProbabilityInterval, doubleValue -> mutateProbabilityInterval = doubleValue, () -> mutateProbabilityInterval, 0.0, 1.0);
  38. addDoubleParameter("mutationRate", mutationRate, doubleValue -> mutationRate = doubleValue, () -> mutationRate, 0.0, 1.0);
  39. addDoubleParameter("maxMutationPercent", maxMutationPercent, doubleValue -> maxMutationPercent = doubleValue, () -> maxMutationPercent, 0.0, 1.0);
  40. addDoubleParameter("maxVelocity", maxVelocity, doubleValue -> maxVelocity = doubleValue, () -> maxVelocity, 0.0);
  41. addBooleanParameter("moreInformation", moreInformation , booleanValue -> moreInformation = booleanValue);
  42. }
  43. @Override
  44. protected int getProgressBarMaxCount() {
  45. return swarmSize * (maxIterations + 1)* rounds + rounds;
  46. }
  47. /**
  48. * <p>Algo from Paper:</p><font size="3"><pre>
  49. *
  50. * Begin
  51. * t = 0; {t: generation index}
  52. * initialize particles x<sub>p,i,j</sub>(t);
  53. * evaluation x<sub>p,i,j</sub>(t);
  54. * while (termination condition &ne; true) do
  55. * v<sub>i,j</sub>(t) = update v<sub>i,j</sub>(t); {by Eq. (6)}
  56. * x<sub>g,i,j</sub>(t) = update x<sub>g,i,j</sub>(t); {by Eq. (7)}
  57. * x<sub>g,i,j</sub>(t) = mutation x<sub>g,i,j</sub>(t); {by Eq. (11)}
  58. * x<sub>p,i,j</sub>(t) = decode x<sub>g,i,j</sub>(t); {by Eqs. (8) and (9)}
  59. * evaluate x<sub>p,i,j</sub>(t);
  60. * t = t + 1;
  61. * end while
  62. * End</pre></font>
  63. * <p>with:</p><font size="3">
  64. *
  65. * x<sub>g,i,j</sub>: genotype ->genetic information -> in continuous space<br>
  66. * x<sub>p,i,j</sub>: phenotype -> observable characteristics-> in binary space<br>
  67. * X<sub>g,max</sub>: is the Maximum here set to 4.<br>
  68. * Eq. (6):v<sub>i,j</sub>(t + 1) = wv<sub>i,j</sub>+c<sub>1</sub>R<sub>1</sub>(P<sub>best,i,j</sub>-x<sub>p,i,j</sub>(t))+c<sub>2</sub>R<sub>2</sub>(g<sub>best,i,j</sub>-x<sub>p,i,j</sub>(t))<br>
  69. * Eq. (7):x<sub>g,i,j</sub>(t + 1) = x<sub>g,i,j</sub>(t) + v<sub>i,j</sub>(t + 1)<br>
  70. * Eq. (11):<b>if(</b>rand()&lt;r<sub>mu</sub><b>)then</b> x<sub>g,i,j</sub>(t + 1) = -x<sub>g,i,j</sub>(t + 1)<br>
  71. * Eq. (8):x<sub>p,i,j</sub>(t + 1) = <b>(</b>rand() &lt; S(x<sub>g,i,j</sub>(t + 1))<b>) ?</b> 1 <b>:</b> 0<br>
  72. * Eq. (9) Sigmoid:S(x<sub>g,i,j</sub>(t + 1)) := 1/(1 + e<sup>-x<sub>g,i,j</sub>(t + 1)</sup>)<br></font>
  73. * <p>Parameter:</p>
  74. * w inertia, calculated from phi(Variable:{@link #dependency})<br>
  75. * c1: influence, calculated from phi(Variable:{@link #dependency}) <br>
  76. * c2: influence, calculated from phi(Variable:{@link #dependency})<br>
  77. * r<sub>mu</sub>: probability that the proposed operation is conducted defined by limit(Variable:{@link #limit})<br>
  78. *
  79. *
  80. */
  81. @Override
  82. protected Individual executeAlgo() {
  83. initDependentParameter();
  84. Individual globalBest = new Individual();
  85. globalBest.position = extractPositionAndAccess();
  86. globalBest.fitness = evaluatePosition(globalBest.position);
  87. console.println("Start Value:" + globalBest.fitness);
  88. int dimensions = globalBest.position.size();
  89. List<Particle> swarm= initializeParticles(dimensions);
  90. List<Double> runList = new ArrayList<Double>();
  91. runList.add(globalBest.fitness);
  92. evaluation(globalBest, swarm);
  93. runList.add(globalBest.fitness);
  94. for (int iteration = 0; iteration < maxIterations ; iteration++) {
  95. int mutationAllowed = iteration % mutationInterval;
  96. double bitsFlipped = 0;
  97. for (int particleNumber = 0; particleNumber < swarmSize; particleNumber++) {
  98. Particle particle = swarm.get(particleNumber);
  99. if(this.useIntervalMutation) {
  100. boolean allowMutation = (Random.nextDouble() < this.mutateProbabilityInterval);
  101. TreeSet<Integer> mutationLocationSet = null;
  102. if(allowMutation)mutationLocationSet = locationsToMutate(dimensions);
  103. for(int index = 0; index < dimensions; index++) {
  104. updateVelocity(particle, index, globalBest);
  105. updateGenotype(particle, index);
  106. if(allowMutation &&mutationAllowed == 0 && iteration != 0 && mutationLocationSet.contains(index))mutation(particle, index);
  107. decode(particle, index);
  108. }
  109. }else {
  110. int count = 0;
  111. for(int index = 0; index < dimensions; index++) {
  112. updateVelocity(particle, index, globalBest);
  113. updateGenotype(particle, index);
  114. if(mutationAllowed == 0 && iteration != 0 && Random.nextDouble() < mutationRate) {
  115. count++;
  116. mutation(particle, index);
  117. }
  118. decode(particle, index);
  119. }
  120. bitsFlipped += count;
  121. }
  122. }
  123. if(moreInformation) console.println("\t\t\t\t\t\tAvgBitsMutate: " + (bitsFlipped / (double)swarmSize));
  124. if(cancel)return null;
  125. evaluation(globalBest, swarm);
  126. runList.add(globalBest.fitness);
  127. if(moreInformation) console.println("------------------------");
  128. }
  129. console.println(" End Value:" + globalBest.fitness);
  130. this.runList = runList;
  131. return globalBest;
  132. }
  133. /**
  134. *
  135. * @param j maximum index of position in the particle
  136. * @return
  137. */
  138. private List<Particle> initializeParticles(int j) {
  139. List<Particle> swarm = new ArrayList<Particle>();
  140. //Create The Particle
  141. for (int particleNumber = 0; particleNumber < swarmSize; particleNumber++){
  142. //Create a Random position
  143. List<Boolean> aRandomPosition = new ArrayList<Boolean>();
  144. for (int index = 0; index < j; index++){
  145. aRandomPosition.add(Random.nextBoolean());
  146. }
  147. swarm.add(new Particle(aRandomPosition));
  148. }
  149. return swarm;
  150. }
  151. /**
  152. * Calculate w, c1, c2
  153. */
  154. private void initDependentParameter() {
  155. w = 1.0 / (dependency - 1 + Math.sqrt(dependency * dependency - 2 * dependency));
  156. c1 = c2 = dependency * w;
  157. }
  158. /**
  159. * Evaluate each particle and update the global Best position;
  160. * @param globalBest
  161. * @param swarm
  162. */
  163. private void evaluation(Individual globalBest, List<Particle> swarm) {
  164. for(Particle p: swarm) {
  165. double localEvaluationValue = evaluatePosition(p.xPhenotype);
  166. if(moreInformation) console.println("Fitness " + localEvaluationValue);
  167. p.checkNewEvaluationValue(localEvaluationValue);
  168. if(localEvaluationValue < globalBest.fitness) {
  169. globalBest.fitness = localEvaluationValue;
  170. globalBest.position = p.localBest.position;
  171. }
  172. }
  173. }
  174. /**
  175. * Eq. (6):v<sub>i,j</sub>(t + 1) = wv<sub>i,j</sub>+c<sub>1</sub>R<sub>1</sub>(P<sub>best,i,j</sub>-x<sub>p,i,j</sub>(t))+c<sub>2</sub>R<sub>2</sub>(g<sub>best,i,j</sub>-x<sub>p,i,j</sub>(t))<br>
  176. * @param particle
  177. * @param index
  178. * @param globalBest
  179. */
  180. private void updateVelocity(Particle particle, int index, Individual globalBest) {
  181. double r1 = Random.nextDouble();
  182. double r2 = Random.nextDouble();
  183. double posValue = particle.xPhenotype.get(index)?1.0:0.0;
  184. particle.velocity.set(index, clamp(w*particle.velocity.get(index) + c1*r1*((particle.localBest.position.get(index)?1.0:0.0) - posValue) + c2*r2*((globalBest.position.get(index)?1.0:0.0)- posValue)) );
  185. }
  186. /**
  187. * Eq. (7):x<sub>g,i,j</sub>(t + 1) = x<sub>g,i,j</sub>(t) + v<sub>i,j</sub>(t + 1)<br>
  188. * @param particle
  189. * @param index
  190. */
  191. private void updateGenotype(Particle particle, int index) {
  192. particle.xGenotype.set(index, clamp(particle.xGenotype.get(index) + particle.velocity.get(index)));
  193. }
  194. /**
  195. * Eq. (11):<b>if(</b>rand()&lt;r<sub>mu</sub><b>)then</b> x<sub>g,i,j</sub>(t + 1) = -x<sub>g,i,j</sub>(t + 1)<br>
  196. * @param particle
  197. * @param index
  198. */
  199. private void mutation(Particle particle, int index) {
  200. //if(Random.nextDouble() < limit)
  201. particle.xGenotype.set(index, -particle.xGenotype.get(index));
  202. }
  203. /**
  204. * Eq. (8):x<sub>p,i,j</sub>(t + 1) = <b>(</b>rand() &lt; S(x<sub>g,i,j</sub>(t + 1))<b>) ?</b> 1 <b>:</b> 0<br>
  205. * @param particle
  206. * @param index
  207. */
  208. private void decode(Particle particle, int index) {
  209. particle.xPhenotype.set(index, Random.nextDouble() < Sigmoid(particle.xGenotype.get(index)));
  210. }
  211. /**
  212. * Eq. (9) Sigmoid:S(x<sub>g,i,j</sub>(t + 1)) := 1/(1 + e<sup>-x<sub>g,i,j</sub>(t + 1)</sup>)<br></font>
  213. * @param value
  214. * @return
  215. */
  216. private double Sigmoid(double value) {
  217. return 1.0 / (1.0 + Math.exp(-value));
  218. }
  219. /**
  220. * To clamp X<sub>g,j,i</sub> and v<sub>i,j</sub> in Range [-X<sub>g,max</sub>|+X<sub>g,max</sub>] with {X<sub>g,max</sub>= 4}
  221. * @param value
  222. * @return
  223. */
  224. private double clamp(double value) {
  225. return Math.max(-maxVelocity, Math.min(maxVelocity, value));
  226. }
  227. private TreeSet<Integer> locationsToMutate(int dimensions) {
  228. TreeSet<Integer> mutationLocation = new TreeSet<Integer>(); //sortedSet
  229. int maximumAmountOfMutatedBits = Math.max(1, (int)Math.round(((double) dimensions) * this.maxMutationPercent));
  230. int randomUniformAmountOfMutatedValues = Random.nextIntegerInRange(1,maximumAmountOfMutatedBits + 1);
  231. for(int i = 0; i< randomUniformAmountOfMutatedValues; i++) {
  232. boolean success = mutationLocation.add(Random.nextIntegerInRange(0, dimensions));
  233. if(!success) i--; //can be add up to some series long loops if maximumAmountOfMutatedBits get closed to problemsize.
  234. }
  235. return mutationLocation;
  236. }
  237. @Override
  238. protected String algoInformationToPrint() {
  239. // private int swarmSize = 20;
  240. // private int maxIterations = 100;
  241. // private double limit = 0.01;
  242. // private double dependency = 2.07;
  243. // private int mutationInterval = 1;
  244. // private boolean useIntervalMutation = true;
  245. // private double mutateProbabilityInterval = 0.01;
  246. // private double maxMutationPercent = 0.01;
  247. return "PsoAlgo"+ " Rounds:" + rounds
  248. + " maxIterations:" + maxIterations
  249. + " swarmSize:" + swarmSize
  250. + " dependency:" + dependency
  251. + " mutationInterval:" + mutationInterval
  252. + " maxVelocity: " + maxVelocity
  253. + (useIntervalMutation?
  254. (" mutateProbabilityInterval:" + mutateProbabilityInterval
  255. + " maxMutationPercent:" + maxMutationPercent) : " mutationRate:" + mutationRate);
  256. }
  257. /**
  258. * Class to represent a Particle.
  259. */
  260. private class Particle{
  261. /**
  262. * The velocity of a particle.
  263. */
  264. public List<Double> velocity;
  265. /**
  266. * The positions genotype.
  267. */
  268. public List<Double> xGenotype;
  269. /**
  270. * The positions phenotype. Alias the current position.
  271. */
  272. public List<Boolean> xPhenotype;
  273. public Individual localBest;
  274. Particle(List<Boolean> position){
  275. this.xPhenotype = position;
  276. //Init velocity, xGenotype with 0.0 values.
  277. this.velocity = position.stream().map(bool -> 0.0).collect(Collectors.toList());
  278. this.xGenotype = position.stream().map(bool -> 0.0).collect(Collectors.toList());
  279. localBest = new Individual();
  280. localBest.fitness = Double.MAX_VALUE;
  281. }
  282. public void checkNewEvaluationValue(double newEvaluationValue) {
  283. if(newEvaluationValue < localBest.fitness) {
  284. localBest.fitness = newEvaluationValue;
  285. localBest.position = xPhenotype.stream().map(bool -> bool).collect(Collectors.toList());
  286. }
  287. }
  288. public String toString() {
  289. return "Particle with xPhenotype(Position), xGenotype, velocity:["
  290. + listToString(xPhenotype) + "],[" + listToString(xGenotype) + "],["
  291. + listToString(velocity) + "]";
  292. }
  293. private <Type> String listToString(List<Type> list) {
  294. return list.stream().map(Object::toString).collect(Collectors.joining(", "));
  295. }
  296. }
  297. @Override
  298. protected String plottFileName() {
  299. return "plottPsoAlgo.txt";
  300. }
  301. }