smith chart-based particle swarm optimization algorithm for multi-objective engineering problems

Particle swarm optimization (pso) is a widely recognized bio-inspired algorithm for systematically exploring solution spaces and iteratively iden-tifying optimal points. through updating local and global best solutions, pso effectively explores the search process, enabling the discovery of the most advantageous outcomes. this study proposes a novel smith chart-based particle swarm optimization to solve convex and nonconvex multi-objective engineering problems by representing complex plane values in a polar coordinate system. the main contribution of this paper lies in the utilization of the smith chart’s impedance and admittance circles to dynamically update the location of each particle, thereby effectively deter-mining the local best particle. the proposed method is applied to three test functions with different behaviors, namely concave, convex, noncon-tinuous, and nonconvex, and performance parameters are examined. the simulation results show that the proposed strategy offers successful conver-gence performance for multi-objective optimization applications and meets performance expectations with a well-distributed solution set.