Optimization of engineering problems with discrete and continuous constraints using dynamic adaptive meta-heuristic algorithms

Document Type : Original Article

Authors

sayedMostafa mousavi ¹

Alireza Toloei ¹

mohammadhosein Toloei ²

¹ Shahid Beheshti University of Tehran, Tehran.

² Tehran University of Arts, Tehran.

10.22067/jacsm.2024.86041.1232

Abstract

The purpose of this article is to implement different methods of meta-heuristic algorithms to solve five engineering problems. these engineering problems have been optimized using five meta-heuristic algorithms of firefly, colonial competition, frog, ants and gray wolf with the aim of reducing the costs of engineering problems. in each of the algorithms, a dynamic adaptive factor is introduced to balance the convergence rate and absolute optimal search ability by adjusting the search speed during the search process. Investigations show that in each of the algorithms techniques are used to leave the local optimum, which makes the answers converge to the absolute optimum. To evaluate the quality and accuracy of the algorithms, the sensitivity test and the comparison of the convergence numbers for the results of the implementation of each algorithm on the data have been used. The results show that the firefly algorithm in spring tension problem, frog algorithm in three-bar truss problem, the colonial competition algorithm in the speed reducer and gear design problems, and the gray wolf algorithm in the pressure tank problem provided more accurate performance in finding the absolute optimum. . In fact, these algorithms make it easy to achieve the optimal solution by generating a random population, creating a neighborhood and choosing the best neighbor, provided that the constraints of the variables of the problem are satisfied. As a result, this paper shows that any meta-heuristic algorithm can perform better in a specific engineering problem, depending on the type of problem and environmental conditions.

Keywords

Constrained engineering design optimization problems

continuous and discrete design variables

meta-heuristics

Imperialist Competitive

ants

Frog

grey wolf

firefly

Subjects

• Optimization

---

References

[1] N. B. Guedria, “Improved accelerated PSO algorithmform echanical engineering optimization problems,” Applied Soft Computing, vol. 40, pp. 455–467, 2016. https://doi.org/10.1016/j.asoc.2015.10.048.

 [2] J. Kennedy, R. Eberhart, “Particle swarm optimization,” In Proceedings of ICNN'95-international conference on neural networks, vol. 4, pp. 1942-1948, 1995,  .  https://doi.org/10.1109/ICNN.1995.488968.

[3] J. H. Holland, “Outline for a logical theory of adaptive systems,” Journal of the ACM (JACM), vol. 9, no. 3, pp. 297-314, 1962. https://doi.org/10.1145/321127.321128.

[4] J. D. Bagley, “The behavior of adaptive systems which employ genetic and correlation algorithms,” Ann Arbor, MI: Dissertation Abstracts International, University of Michigan, 1967.

[5] S. Mirjalili, S. M. Mirjalili and A. Lewis, “Grey wolf optimizer,” Advances in engineering software, vol. 69, pp. 46-61, 2014. https://doi.org/10.1016/j.advengsoft.2013.12.007.

[6]  Y. Li, W. Sun and S. Guan, “A firefly inspired controller placement algorithm in software defined network,” In 2019 IEEE 2nd international conference on computer and communication engineering technology (CCET), 2019.  pp. 254-258. https://doi.org/10.1109/CCET48361.2019.8989320.

[7] M. Dorigo, M. Birattari and T. Stutzle, “Ant colony optimization artificial ants as a computational intelligence technique,” IEEE Comput Intell M, vol. 1, no. 4, pp. 28–39, 2006. https://doi.org/10.1109/MCI.2006.329691.

[8] D. Karaboga and B. Basturk, “Artificial bee colony (ABC) optimization algorithm for solving constrained  optimization,” Foundations of fuzzy logic and soft computing, Lecture Notes in Computer Science, vol. 4529, 2007, pp.789–798. https://doi.org/10.1007/978-3-540-72950-1_77.

[9]  M. A. Ahandani, R. Banimahd and N. P. Shrjoposht, “Solving the parameter identification problem using shuffled frog leaping with opposition-based initialization,” In 2011 1st International eConference on Computer and Knowledge Engineering (ICCKE), 2011, pp. 49-53. https://doi.org/10.1109/ICCKE.2011.6413323.

[10] B. Xing, W. J. Gao, “Imperialist competitive algorithm,” in Innovative computational intelligence: A rough guide to 134 clever algorithms, pp. 203-209 . 2014.

[11]  A. Kalananda, V. K.Reddy, and V. L. Narayana Komanapalli, “A competitive learning-based Grey wolf Optimizer for engineering problems and its application to multi-layer perceptron training,” Multimedia Tools and Applications, vol. 82, pp. 1-59, 2023. https://doi.org/10.1007/s11042-023-15146-x.

[12] W. T. Lunardi, H. Voos and L. H. Cherri, “An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem,” In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019, pp. 204-211. https://doi.org/10.1145/3297280.3297302.

 [13] R. Rajabioun, E. Atashpaz-Gargari and C. Lucas, “Colonial competitive algorithm as a tool for Nash equilibrium point achievement,” In Computational Science and Its Applications–ICCSA 2008: International Conference, 2008, pp. 680-695.  https://doi.org/10.1007/978-3-540-69848-7_55.

[14] M. Eusuff, K. Lansey and F. Pasha, “Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization,” Engineering optimization, vol. 38, no. 2, pp. 129-154, 2006. https://doi.org/10.1080/03052150500384759.

 [15] B. B. Maaroof, T. A. Rashid, J. M. Abdulla, B. A. Hassan, A. Alsadoon, M. Mohammadi, M. Khishe and S. Mirjalili, “Current studies and applications of shuffled frog leaping algorithm: a review,” Archives of Computational Methods in Engineering, vol. 29, no. 5, pp. 3459-3474, 2022. https://doi.org/10.1007/s11831-021-09707-2.

[16]  M. Eusuff, K. Lansey, and F. Pasha, “Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization,” Engineering optimization, vol. 38, no. 2, pp. 129-154, 2006. https://doi.org/10.1080/03052150500384759.

[17] X. Yang, X. He, “Firefly algorithm: recent advances and applications,” International journal of swarm intelligence, vol. 1, no. 1, pp. 36-50, 2013. https://doi.org/10.1504/IJSI.2013.055801.

[18] N. F. Johari, et al. and A. Udin, “Firefly algorithm for optimization problem,” Applied Mechanics and Materials, vol. 421, pp. 512-517, 2013. https://doi.org/10.4028/www.scientific.net/AMM.421.512.

[19] X. Yang, “Firefly algorithm, stochastic test functions and design optimisation,” International journal of bio-inspired computation, vol. 2, no. 2, pp. 78-84, 2010. https://doi.org/10.1504/IJBIC.2010.032124.

 [20] S. Farahani, A. A. Abshouri, B. Nasiri, and M. R. Meybodi, “A Gaussian firefly algorithm,” International Journal of Machine Learning and Computing, vol. 1, no. 5, p. 448, 2011.

[21] V. Kumar, D. Kumar, “A systematic review on firefly algorithm: past, present, and future,” Archives of Computational Methods in Engineering, vol. 28, pp. 3269-3291, 2021. https://doi.org/10.1007/s11831-020-09498-y.

 [22] X. Yang, “Firefly algorithms for multimodal optimization,” International symposium on stochastic algorithms, Springer, 2009, pp. 169-178. https://doi.org/10.1007/978-3-642-04944-6_14.

[23] M. H. Alizadeh, A. Toloei, “Designing Pitch Angle Compensator for an UAV and Robustification it with Bee Colony Optimization Algorithm,” Technology in Aerospace Engineering, pp. 1-13, 2023. https://doi.org/10.22034/jtae.2024.8.1.1.

[24] B. Attaran, M. Zarchi and A. R. Toloei, “Numerical survey of vibrational model for third aircraft based on HR suspension system actuator using two bee algorithm objective functions,” International Journal of Engineering, vol. 30, no. 6, pp. 887-894, 2017.

[25] A. R. Toloei, M. Zarchi and B. Attaran, “Application of active suspension system to reduce aircraft vibration using pid technique and bees algorithm,” International Journal of Computer Applications, vol. 98, no. 6, 2014. 10.5120/17187-7368.

[26] A. R. Toloei, M. Zarchi and B. Attaran, “Vibration control of aircraft semi-active suspension system using PID-bees technique,” International Journal of Computer Applications, vol. 99, no. 10, 2014. https://doi.org/10.5120/17408-7980.

[27] M. Ameri and E. Behrouzian Nejad, “Presenting a clustering method based on colonial competition algorithm to increase network lifetime in wireless sensor networks,” In 2^nd international conference on Research in Engineering, Science and Technology, 2005. (InPersian)

[28] Z. Ghafari Moghadam, M. Hashemi Tabar, and E. Moradi, “Water DemandManagement Using Dynamic Firefly Optimization Algorithm: A Case Study of Hirmand River,” Scientific Quarterly Journal of Water Resources Engineering, vol. 13, no. 46, pp. 85-98, 2020. (InPersian)

[29] H. Zhu, Y. Hu and W. Zhu, “A dynamic adaptive particle swarm optimization and genetic algorithm for different constrained engineering design optimization problems,” Advances in Mechanical Engineering, vol. 11, no. 3, 2019. https://doi.org/10.1177/1687814018824930.

[30] C. I. Okonta, et al. and E. D. Okelue, “A heuristic based ant colony optimization algorithm for energy efficient smart homes,” In Proc. 5^th International  Conference Exhib. Clean Energy, pp. 1-12, 2016.