SUPER-SAPSO: A New SA-Based PSO Algorithm


Share/Save/Bookmark

Bahrepour, M. and Mahdipour, E. and Cheloi, R. and Yaghoobi, M. (2008) SUPER-SAPSO: A New SA-Based PSO Algorithm. In: Advances in Intelligent and Soft Computing, 10-28 Nov 2008, Online Conference.

[img]PDF
Restricted to UT campus only
: Request a copy
171Kb
Abstract:Swarm Optimisation (PSO) has been received increasing attention due to its simplicity and reasonable convergence speed surpassing genetic algorithm in some circumstances. In order to improve convergence speed or to augment the exploration area within the solution space to find a better optimum point, many modifications have been proposed. One of such modifications is to fuse PSO with other search strategies such as Simulated Annealing (SA) in order to make a new hybrid algorithm – so called SAPSO. To the best of the authors’ knowledge, in the earlier studies in terms of SAPSO, the researchers either assigned an inertia factor or a global temperature to particles decreasing in the each iteration globally. In this study the authors proposed a local temperature, to be assigned to the each particle, and execute SAPSO with locally allocated temperature. The proposed model is called SUPERSAPSO because it often surpasses the previous SAPSO model and standard PSO appropriately. Simulation results on different benchmark functions demonstrate superiority of the proposed model in terms of convergence speed as well as optimisation accuracy.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67863
Official URL:http://dx.doi.org/10.1007/978-3-540-89619-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page