Sparse Based Particle Swarm Optimization Algorithm
preprint
OA: closed
Abstract
Abstract Particle Swarm Optimization (PSO) is the well-known metaheuristic algorithm for optimization, inspired from swarm of species.PSO can be used in various problems solving related to engineering and science inclusive of but not restricted to increase the heat transfer of systems, to diagnose the health problem using PSO based on microscopic imaging. One of the limitations with Standard-PSO and other swarm based algorithms is large computational time as position vectors are dense. In this study, a sparse initialization based PSO (Sparse-PSO) algorithm has been proposed. Comparison of proposed Sparse-PSO with Standard-PSO has been done through evaluation over several standard benchmark objective functions. Our proposed Sparse-PSO method takes less computation time and provides better solution for almost all benchmark objective functions as compared to Standard-PSO method.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00