Below are some drafts and source codes. Note that some items are not specific to PSO, but more generally about optimisation. No parameters to “guess”, and you can add your own objective function. NEW: you can now solve Graph Reflection math worksheet pdf Problems.
Also, you can generate a data file for post-mortem animation. If you want, you can try some options like local queens or Guided Random Generation. A small animation showing how a swarm generates subswarms around suboptima for Alpine function. Many local optima, just one maximum. The paper has been presented atCEC99. Fuzzy set computation tools to prepare a fuzzy PSO.
Big paper about Algebraic and Analytical views, with examples. Published by IEEE in 2002, so I can give you here just the draft. PSO can work on finite state spaces and with non continuous functions. Here is an example: looking for shortest cycles in a valuated graph. The last version is more clean, and strictly written in ANSI C. A very short paper formally proving that ACO, as defined by Marco Dorigo in 1999, does not really use swarm intelligence. The underlying idea is to analyze ACO in order to see if some principles could be useful to improve PSO.
It is not the case with the present version thanks to two techniques: hyperspheres instead of hyperparallelepipeds for proximity areas, some of them are so crazy that they might work. The page you are trying to access has moved. Result are slightly better than the best published ones, but they are all symmetrical. A short paper explains how to do, more or less. The parametric PSO I used for the Semi, ” succinctly explaining why and how the stochastic aspect of optimization could be avoided in some cases.