نوع مقاله : مقاله پژوهشی
نویسندگان
1 دانشگاه شهید بهشتی
2 گروه دینامیک پرواز و کنترل-فناوری های نوین و هوافضا- شهیدبهشتی تهران- تهران- ایران
3 دانشگاه معماری و هنر پارس
چکیده
کلیدواژه‌ها
موضوعات
عنوان مقاله [English]
نویسندگان [English]
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.
کلیدواژه‌ها [English]
)
ارسال نظر در مورد این مقاله