1. An Enhanced Particle Swarm Optimization (PSO) Algorithm Employing Quasi-Random Numbers.
- Author
-
Kannan, Shiva Kumar and Diwekar, Urmila
- Subjects
- *
PARTICLE swarm optimization , *TRAVELING salesman problem , *STATISTICAL sampling , *ALGORITHMS , *BENCHMARK problems (Computer science) , *RANDOM numbers - Abstract
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. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF