PsoAlgorithm.java 13 KB

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