Wikipedia:Articles for deletion/Simplified swarm optimization: Difference between revisions

Revision as of 04:58, 25 July 2011

Revision as of 05:33, 25 July 2011

Line 23:

::::* The sources you refer to were written prior to the simplified forms existence according to what the article states. So either the article is incorrect or something else is up. I will check the sources myself tomorrow. [[User:Snaphat|snaphat]] ([[User talk:Snaphat|talk]]) 04:22, 25 July 2011 (UTC)

:::::* Yes these dates are suspect. I appreciate it that you check the sources too, tnx. --[[User:DeVerm|DeVerm]] ([[User talk:DeVerm|talk]]) 04:58, 25 July 2011 (UTC).

::::::* I took a look at each reference and none are specifically related to SSO. They contain algorithms similar to the one mentioned in the article, but do NOT contain the one mentioned in the article. As for what the references contain:

:::::::* Reference 2 - formulates the PSO method.

:::::::* Reference 3 - formulates a version of PSO that works on descrete binary variables (DPSO).

:::::::* Reference 4 - is simply an emperical study of the performance of the PSO method.

:::::::* Reference 5 - is a book on the subject of particle swarms in general.

::::::* The SSO of the article is a variant of the DPSO mentioned in reference 3. Essentially, the original DPSO is simply a a modification for the PSO to work in discrete ranges. The SSO introduces a special update mechanism for the particle position that doesn't exist in the original DPSO (the original is simply the particle position + particle velocity = particle position in next time step). Other than that, the procedure for computation is the same. Basically, there are many variants based on that first DPSO paper and there is nothing that makes this particular variant notable as per [[WP:N]]. [[User:Snaphat|snaphat]] ([[User talk:Snaphat|talk]]) 05:33, 25 July 2011 (UTC)