An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers
Algorithms · 06.05.2024 · 17 (5) · 195
DOI: 10.3390/a17050195 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 06.05.2024. Verfasst von Shiva Kumar Kannan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm incorporating Sobol and Halton random number samplings. It evaluates the enhanced PSO’s performance against conventional PSO employing Monte Carlo random number samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The results reveal consistent enhancements achieved by the enhanced PSO utilizing Sobol/Halton samplings across the benchmark problems. Particularly noteworthy are the Sobol-based PSO improvements in iterations and the computational times for the benchmark problems. These findings underscore the efficacy of employing Sobol and Halton random number generation methods to enhance algorithm efficiency.
Zitieren
APA
Kannan, S. K., & Diwekar, U. (2024). An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers. Algorithms, 17(5), 195. https://doi.org/10.3390/a17050195
Vancouver
Kannan SK, Diwekar U. An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers. Algorithms. 2024;17(5):195. doi:10.3390/a17050195
BibTeX
@article{Kannan2024,
author = {Kannan, Shiva Kumar and Diwekar, Urmila},
title = {An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers},
journal = {Algorithms},
year = {2024},
volume = {17},
number = {5},
pages = {195},
doi = {10.3390/a17050195}
}
EUVIMED