Weightless Swarm Algorithm (WSA) for Dynamic Optimization Problems

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.
Type de document :
Communication dans un congrès
James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.508-515, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_60〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01551365
Contributeur : Hal Ifip <>
Soumis le : vendredi 30 juin 2017 - 10:36:13
Dernière modification le : vendredi 1 décembre 2017 - 01:09:56
Document(s) archivé(s) le : lundi 22 janvier 2018 - 20:21:23

Fichier

978-3-642-35606-3_60_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

T. Ting, Ka Man, Sheng-Uei Guan, Mohamed Nayel, Kaiyu Wan. Weightless Swarm Algorithm (WSA) for Dynamic Optimization Problems. James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.508-515, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_60〉. 〈hal-01551365〉

Partager

Métriques

Consultations de la notice

87

Téléchargements de fichiers

48