Simple and Adaptive Particle Swarms
The substantial advances that have been made to both the theoretical and practical aspects of particle\ud swarm optimization over the past 10 years have taken it far beyond its original intent as a biological\ud swarm simulation. This thesis details and explains these advances in the context of what has been\ud achieved to this point, as well as what has yet to be understood or solidified within the research community.\ud Taking into account the state of the modern field, a standardized PSO algorithm is defined for\ud benchmarking and comparative purposes both within the work, and for the community as a whole.\ud \ud This standard is refined and simplified over several iterations into a form that does away with potentially\ud undesirable properties of the standard algorithm while retaining equivalent or superior performance\ud on the common set of benchmarks. This refinement, referred to as a discrete recombinant swarm (PSODRS)\ud requires only a single user-defined parameter in the positional update equation, and uses minimal\ud additive stochasticity, rather than the multiplicative stochasticity inherent in the standard PSO. After a\ud mathematical analysis of the PSO-DRS algorithm, an adaptive framework is developed and rigorously\ud tested, demonstrating the effects of the tunable particle- and swarm-level parameters. This adaptability\ud shows practical benefit by broadening the range of problems which the PSO-DRS algorithm is wellsuited\ud to optimize.
42 references, page 1 of 5
views in local repository
downloads in local repository
The information is available from the following content providers: