Weightless Swarm Algorithm (WSA) for Dynamic Optimization Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Weightless Swarm Algorithm (WSA) for Dynamic Optimization Problems

(1) , (1) , (1) , (1) , (1)
1

Abstract

In this work the well-known Particle Swarm Optimization (PSO) algorithm is applied to some Dynamic Optimization Problems (DOPs). The PSO algorithm is improved by simplification instead of introducing additional strategies into the algorithm as done by many other researchers in the aim of improving an algorithm. Several parameters (w, Vmax, Vmin and c2) are being excluded from the conventional PSO. This algorithm is called Weightless Swarm Algorithm (WSA) as the prominent parameter, inertia weight w does not exist in this proposed algorithm. Interestingly, WSA still works effectively via swapping strategy found from countless trials and errors. We then incorporate the proven clustering technique from literature into the framework of the algorithm to solve the six dynamic problems in literature. From the series of tabulated results, we proved that WSA is competitive as compared to PSO. As only one parameter exists in WSA, it is feasible to carry out parameter sensitivity to find the optimal acceleration coefficient, c1 for each problem set.
Fichier principal
Vignette du fichier
978-3-642-35606-3_60_Chapter.pdf (714.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01551365 , version 1 (30-06-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

T. O. Ting, Ka Lok Man, Sheng-Uei Guan, Mohamed Nayel, Kaiyu Wan. Weightless Swarm Algorithm (WSA) for Dynamic Optimization Problems. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.508-515, ⟨10.1007/978-3-642-35606-3_60⟩. ⟨hal-01551365⟩
63 View
169 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More