Convergence and Empirical Performance  of Tanh-Based Adaptive Particle Swarm Optimization

Joko Riyono; Aina Latifa Riyana Putri; Sofia Debi  Puspa; Supriyadi Supriyadi; Christina Eni  Pujiastuti; Fayza Nayla Riyana Putri

doi:10.29207/resti.v10i3.7247

Authors

Joko Riyono Universitas Trisakti
Aina Latifa Riyana Putri Telkom University
Sofia Debi Puspa Universitas Trisakti
Supriyadi Supriyadi Universitas Trisakti
Christina Eni Pujiastuti Universitas Trisakti
Fayza Nayla Riyana Putri Universitas Muhammadiyah Semarang

DOI:

https://doi.org/10.29207/resti.v10i3.7247

Keywords:

acceleration coefficient, convergence, particle swarm optimization, tanh function

Abstract

Particle Swarm Optimization (PSO) is a widely used population-based optimization method but faces challenges in premature convergence, leading to suboptimal solutions. To address this issue, this study proposes a Tanh-Based Acceleration Coefficient PSO (TB-PSO), where the acceleration coefficients are modified using the hyperbolic tangent (tanh) function. The smooth and continuous behavior of tanh enables gradual coefficient updates, limits excessive particle velocities, and maintains swarm diversity, thereby improving convergence stability and balancing exploration and exploitation. The convergence theorem analysis confirms that TB-PSO meets stability criteria before being evaluated on unimodal and multimodal benchmark functions in 10 and 30 dimensions. Its performance is compared against several PSO variants, including TVAC-PSO, SCAC-PSO, NDAC-PSO, and SAC-PSO. In the 10-dimensional experiments, TB-PSO achieves the best overall final ranking based on the average and standard deviation of best solution, ranking first for functions f₃ and f₅, second for f₂ with only a marginal difference from the best-performing method, and remaining competitive for f₁ and f₄. These results indicate superior solution quality and stable convergence. For the 30-dimensional benchmark functions, TB-PSO ranks first for f₂, second for f₅, and third for f₁, f₃, and f₄ based on the same evaluation criteria. Although its ranking decreases compared to the 10-dimensional case, TB-PSO remains competitive, reflecting the increased complexity of high-dimensional optimization problems. Overall, the results demonstrate that the tanh-based acceleration coefficient modification effectively enhances PSO performance, particularly in lower-dimensional search spaces, while maintaining robustness in higher-dimensional scenarios.

Downloads

Download data is not yet available.

References

J. Zhang et al., “Capacity estimation for series-connected battery pack based on partial charging voltage curve segments,” Journal of Energy Storage, vol. 95, p. 112576, Aug. 2024, doi: https://doi.org/10.1016/j.est.2024.112576.

Y.-L. Chen, J. Cheng, C. Lin, X. Wu, Y. Ou, and Y. Xu, “Classification-based learning by particle swarm optimization for wall-following robot navigation,” Neurocomputing, vol. 113, pp. 27–35, Aug. 2013, doi: https://doi.org/10.1016/j.neucom.2012.12.037.

K. Deligkaris, “Particle Swarm Optimization and Random Search for Convolutional Neural Architecture Search,” IEEE Access, vol. 12, pp. 91229–91241, 2024, doi: https://doi.org/10.1109/access.2024.3420870.

E. Siivola, A. Paleyes, J. González, and A. Vehtari, “Good practices for Bayesian optimization of high dimensional structured spaces,” Applied AI Letters, vol. 2, no. 2, May 2021, doi: https://doi.org/10.1002/ail2.24.

F. VANDENBERGH and A. ENGELBRECHT, “A study of particle swarm optimization particle trajectories,” Information Sciences, vol. 176, no. 8, pp. 937–971, Apr. 2006, doi: https://doi.org/10.1016/j.ins.2005.02.003.

L. Wu, D. Zhao, X. Zhao, and Y. Qin, “Nonlinear Adaptive Back-Stepping Optimization Control of the Hydraulic Active Suspension Actuator,” Processes, vol. 11, no. 7, p. 2020, Jul. 2023, doi: https://doi.org/10.3390/pr11072020.

X. Li and A. P. Engelbrecht, “Particle swarm optimization,” Jul. 2007, doi: https://doi.org/10.1145/1274000.1274118.

D. Tian, X. Zhao, and Z. Shi, “Chaotic particle swarm optimization with sigmoid-based acceleration coefficients for numerical function optimization,” Swarm and evolutionary computation, vol. 51, pp. 100573–100573, Dec. 2019, doi: https://doi.org/10.1016/j.swevo.2019.100573.

C.-Y. Tsai and I-Wei. Kao, “Particle swarm optimization with selective particle regeneration for data clustering,” Expert Systems with Applications, vol. 38, no. 6, pp. 6565–6576, Jun. 2011, doi: https://doi.org/10.1016/j.eswa.2010.11.082.

Ponnuthurai Nagaratnam Suganthan, “Particle swarm optimiser with neighbourhood operator,” Jan. 2003, doi: https://doi.org/10.1109/cec.1999.785514.

A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, “Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 240–255, Jun. 2004, doi: https://doi.org/10.1109/tevc.2004.826071.

K. Chen, F. Zhou, L. Yin, S. Wang, Y. Wang, and F. Wan, “A hybrid particle swarm optimizer with sine cosine acceleration coefficients,” vol. 422, pp. 218–241, Jan. 2018, doi: https://doi.org/10.1016/j.ins.2017.09.015.

G. Xu, “An adaptive parameter tuning of particle swarm optimization algorithm,” Applied Mathematics and Computation, vol. 219, no. 9, pp. 4560–4569, Jan. 2013, doi: https://doi.org/10.1016/j.amc.2012.10.067.

Y. Tang, Z. Wang, and J. Fang, “Feedback learning particle swarm optimization,” Applied Soft Computing, vol. 11, no. 8, pp. 4713–4725, Dec. 2011, doi: https://doi.org/10.1016/j.asoc.2011.07.012.

J. Kennedy and R. Eberhart, “Particle swarm optimization,” Proceedings of ICNN’95 - International Conference on Neural Networks, vol. 4, pp. 1942–1948, 1995, doi: https://doi.org/10.1109/icnn.1995.488968.

N. Lynn and P. N. Suganthan, “Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation,” Swarm and Evolutionary Computation, vol. 24, pp. 11–24, Oct. 2015, doi: https://doi.org/10.1016/j.swevo.2015.05.002.

E. Siivola, A. Paleyes, J. González, and A. Vehtari, “Good practices for Bayesian optimization of high dimensional structured spaces,” Applied AI Letters, vol. 2, no. 2, May 2021, doi: https://doi.org/10.1002/ail2.24.

M. Lin, Z. Wang, F. Wang, and D. Chen, “Improved Simplified Particle Swarm Optimization Based on Piecewise Nonlinear Acceleration Coefficients and Mean Differential Mutation Strategy,” IEEE Access, pp. 1–1, 2020, doi: https://doi.org/10.1109/access.2020.2994984.

H. Noriega, R. Lazzari, and L. Piegari, “Particle Swarm Optimization for the Sizing of a Battery and Hydrogen Storage System for Residential Buildings,” 2024 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM), pp. 1142–1147, Jun. 2024, doi: https://doi.org/10.1109/speedam61530.2024.10609206.

C. Gong, N. Zhou, S. Xia, and S. Huang, “Quantum particle swarm optimization algorithm based on diversity migration strategy,” Future Generation Computer Systems, vol. 157, pp. 445–458, Apr. 2024, doi: https://doi.org/10.1016/j.future.2024.04.008.

Absalom El-Shamir Ezugwu, “Metaheuristic Optimization for Sustainable Unrelated Parallel Machine Scheduling: A concise overview with a proof-of-concept study,” IEEE access, pp. 1–1, Jan. 2023, doi: https://doi.org/10.1109/access.2023.3347047.

M. Jain, V. Saihjpal, N. Singh, and S. B. Singh, “An Overview of Variants and Advancements of PSO Algorithm,” Applied Sciences, vol. 12, no. 17, p. 8392, Aug. 2022, doi: https://doi.org/10.3390/app12178392.

B. Gao, W. Shen, H. Guan, L. Zheng, and W. Zhang, “Research on Multistrategy Improved Evolutionary Sparrow Search Algorithm and its Application,” IEEE Access, vol. 10, pp. 62520–62534, 2022, doi: https://doi.org/10.1109/access.2022.3182241.

M. Al-Shalabi, M. Shehab, M. T. Alshammari, M. Alazmi, R. O. Alrawashdeh, and M. A. Mahdi, “Enhanced lotus effect optimization algorithm for efficient problem-solving in high-dimensional complex landscapes,” Case Studies in Thermal Engineering, vol. 73, p. 106437, Sep. 2025, doi: https://doi.org/10.1016/j.csite.2025.106437.

S. Helwig and R. Wanka, “Particle Swarm Optimization in High-Dimensional Bounded Search Spaces,” Apr. 2007, doi: https://doi.org/10.1109/sis.2007.368046.