Efficiency analysis of parallel swarm intelligence using rapid range search in Euclidean space

Authors

  • Łukasz Michalski Department of Computer Engineering, Wroclaw University of Technology, Poland
  • Andrzej Sołtysik Department of Computer Engineering, Wroclaw University of Technology, Poland
  • Marek Woda Department of Computer Engineering, Wroclaw University of Technology, Poland

DOI:

https://doi.org/10.24425/ijet.2025.153541

Abstract

Swarm intelligence algorithms are widely recognized for their efficiency in solving complex optimization problems. However, their scalability poses challenges, particularly with large problem instances. This study investigates the time performance of swarm intelligence algorithms by leveraging parallel computing on both central processing units (CPUs) and graphics processing units (GPUs). The focus is on optimizing algorithms designed for range search in Euclidean space to enhance GPU execution. Additionally, the study explores swarm-inspired solutions specifically tailored for GPU implementations, emphasising improving efficiency in video rendering and computer simulations. The findings highlight the potential of GPU-accelerated swarm intelligence solutions to address scalability challenges in large-scale optimization, offering promising advancements in the field.

Published

2025-04-07

How to Cite

Michalski, Łukasz, et al. “Efficiency Analysis of Parallel Swarm Intelligence Using Rapid Range Search in Euclidean Space”. International Journal of Electronics and Telecommunications, vol. 71, no. 1, Apr. 2025, doi:10.24425/ijet.2025.153541.

Issue

Section

Artykuły