A NOVEL APPROACH: THREE-GROUP EXPLORATION STRATEGY ALGORITHM FOR SOLVING OPTIMIZATION PROBLEMS

Ayad Ali

doi:10.56327/ijiscs.v9i2.1774

A NOVEL APPROACH: THREE-GROUP EXPLORATION STRATEGY ALGORITHM FOR SOLVING OPTIMIZATION PROBLEMS

Ayad Ali⁽¹⁾,

(1) Department of Mathematics, College of Science, University of Zakho, Zakho, Kurdistan Region, Iraq.

Corresponding Author

Abstract

In this study, we present a novel optimization technique, known as the Three-Group Exploration Strategy (TGES) algorithm, specifically inspired by collaborative group dynamics often seen in problem-solving. We showed wide testing on 26 widely-recognized benchmark functions, providing a severe comparison between TGES and several well-established optimization algorithms. These results highlight TGES’s effectiveness in finding optimal solutions with high reliability and accuracy. Furthermore, the practical applications of TGES are demonstrated by successfully solving six interesting, real-world engineering problems, showcasing its adaptability and robustness. The experimental results indicate that TGES not only exhibits superior optimization performance, but it also achieves faster convergence and higher solution quality compared to several leading algorithms. This finds TGES algorithm as a strong and adaptable tool for solving a variety of engineering optimization problems.

Keywords

Swarm optimization, Group dynamics, Group Exploration Strategy Algorithm, benchmark test functions, convergence speed

References

J. Xue and B. Shen (2020 ), “A novel swarm intelligence optimization approach: sparrow search algorithm,” Syst. Sci. Control Eng., vol. 8, no. 1, pp. 22–34.

L. Ke, Q. Zhang, and R. Battiti ( 2013), “MOEA/D-ACO: A multiobjective evolutionary algorithm using decomposition and antcolony,” IEEE Trans. Cybern., vol. 43, no. 6, pp. 1845–1859.

J. Kennedy and R. Eberhart ( 1995), “Particle swarm optimization,” in Proceedings of ICNN’95-international conference on neural networks, ieee, pp. 1942–1948.

Y. Zhang (2020 ), “Coverage optimization and simulation of wireless sensor networks based on particle swarm optimization,” Int. J. Wirel. Inf. Networks, vol. 27, no. 2, pp. 307–316.

L. A. I. Yuan-wen and Z. Jie ( 2021), “Urban bus scheduling optimization based on simulated anneal-adaptive cuckoo search algorithm,” J. Transp. Syst. Eng. Inf. Technol., vol. 21, no. 1, p. 183.

S. Mirjalili, S. M. Mirjalili, and A. Lewis ( 2014), “Grey wolf optimizer,” Adv. Eng. Softw., vol. 69, pp. 46–61.

S. Mirjalili and A. Lewis, “The whale optimization algorithm ( 2016), ” Adv. Eng. Softw., vol. 95, pp. 51–67.

S. Kaur, L. K. Awasthi, A. L. Sangal, and G. Dhiman ( 2020), “Tunicate Swarm Algorithm: A new bio-inspired based metaheuristic paradigm for global optimization,” Eng. Appl. Artif. Intell., vol. 90, p. 103541.

E. Alba and B. Dorronsoro ( 2005), “The exploration/exploitation tradeoff in dynamic cellular genetic algorithms,” IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 126–142.

D. H. Wolpert and W. G. Macready ( 1997), “No free lunch theorems for optimization,” IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67–82.

A. Layeb, “New hard benchmark functions for global optimization ( 2022), ” arXiv Prepr. arXiv2202.04606.

M. Jamil and X.-S. Yang ( 2013), “A literature survey of benchmark functions for global optimisation problems,” Int. J. Math. Model. Numer. Optim., vol. 4, no. 2, pp. 150–194.

X.-S. Yang ( 2010), “Test problems in optimization, ” arXiv Prepr. arXiv1008.0549.

S.-E. K. Fateen and A. Bonilla-Petriciolet ( 2014), “Intelligent firefly algorithm for global optimization,” Cuckoo Search Firefly Algorithm Theory Appl., Springer, pp. 315–330.

K. Hussain, M. N. M. Salleh, S. Cheng, and R. Naseem ( 2017), “Common benchmark functions for metaheuristic evaluation: A review,” JOIV Int. J. Informatics Vis., vol. 1, no. 4–2, pp. 218–223.

G. Wu, R. Mallipeddi, and P. N. Suganthan ( 2017), “Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization,” Natl. Univ. Def. Technol. Chang. Hunan, PR China Kyungpook Natl. Univ. Daegu, South Korea Nanyang Technol. Univ. Singapore, Tech. Rep..

S. Mirjalili (2016), “SCA: a sine cosine algorithm for solving optimization problems,” Knowledge-based Syst., vol. 96, pp. 120–133.

A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, and H. Chen (2019), “Harris hawks optimization: Algorithm and applications,” Futur. Gener. Comput. Syst., vol. 97, pp. 849–872.

J. Lian et al.( 2024), “The educational competition optimizer,” Int. J. Syst. Sci., vol. 55, no. 15, pp. 3185–3222.

B. K. Kannan and S. N. Kramer (1994), “An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design,” Journal of Mechanical Design, vol. 116, pp. 405-411.

E. Rashedi, H. Nezamabadi-Pour, and S. Saryazdi (2009), “GSA: a gravitational search algorithm,” Inf. Sci. (Ny)., vol. 179, no. 13, pp. 2232–2248.

X. Yang and A. Hossein Gandomi (2012), “Bat algorithm: a novel approach for global engineering optimization,” Eng. Comput., vol. 29, no. 5, pp. 464–483.

T. Ray and P. Saini (2001), “Engineering design optimization using a swarm with an intelligent information sharing among individuals,” Eng. Optim., vol. 33, no. 6, pp. 735–748.

S. Mirjalili (2015), “Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm,” Knowledge-based Syst., vol. 89, pp. 228–249.

C. A. C. Coello (2000), “Use of a self-adaptive penalty approach for engineering optimization problems,” Comput. Ind., vol. 41, no. 2, pp. 113–127.

A. Sadollah, A. Bahreininejad, H. Eskandar, and M. Hamdi (2013), “Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems,” Appl. Soft Comput., vol. 13, no. 5, pp. 2592–2612.

K. Wansasueb, S. Panmanee, N. Panagant, N. Pholdee, S. Bureerat, and A. R. Yildiz (2022), “Hybridised differential evolution and equilibrium optimiser with learning parameters for mechanical and aircraft wing design,” Knowledge-Based Syst., vol. 239, p. 107955.

Full Text: PDF