Roulette Wheel Particle Swarm Optimization
Smythe, Jared Michael Dean
MetadataShow full item record
In this paper a new probability-based multi-valued Particle Swarm Optimization algorithm is developed for problems with nominal variables. The algorithm more explicitly contextualizes probability updates in terms of roulette wheel probabilities. It is first applied to three forest planning problems, and its performance is compared to the performance of a forest planning algorithm, as well as to results from other algorithms in other papers. The new algorithm outperforms the others except in a single case, where a customized forest planning algorithm obtains superior results. Finally, the new algorithm is compared to three other probability-based Particle Swarm Optimization algorithms via analysis of their probability updates. Three intuitive but fully justified requirements for generally effective probability updates are presented, and through single iteration and balance convergence tests it is determined that the new algorithm violates these requirements the least.
Showing items related by title, author, creator and subject.
Madhavan-Nambiar, Padmanand (uga, 2015-05)Designing an experiment is important, since good designs are required to ensure the efficient estimation of a model that explains the relationship between response and explanatory variables. The reliability of conclusions ...
Zhuang, Chao (uga, 2008-08)Optimizations play an increasingly indispensable role in financial decisions and financial models. Many problems in mathematical finance, such as asset allocation, trading strategy, and derivative pricing, are now routinely ...
Campbell, Walton B. (2014-10-24)