Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: 2nd International Scientific Conference on Advanced Technologies in Aerospace, Mechanical and Automation Engineering, MIST: Aerospace 2019
Год издания: 2020
Идентификатор DOI: 10.1088/1757-899X/734/1/012141
Аннотация: This work presents a new global optimization algorithm based on the behavior of orb-web spiders. The spider method is a heuristic competitive iterative method of random search whose main idea is to model the behavior of Garden orb-web spiders. The paper describes a solution search strategy based on the features of building a web and competitive behavior; the step-by-step algorithm for solving the problem is presented. The concept of the method is simple; the algorithm does not contain complex calculations. The positions of spiders and flies (test points) are generated randomly, herewith, due to the correct selection of the obtained values, the search for an optimum lead to a rather accurate result. The article describes all the parameters used in the method and presents recommendations for changing settings. The selection of the optimal parameters for various classes of test functions is performed. Parameter settings were performed on three classes of test functions: unimodal, ravine, and multiextremal. As part of the work, a computational experiment was conducted to study the effectiveness of the developed method as well. We compared the proposed method with other proven metaheuristic optimization algorithms. The method showed good results both when working with simple (unimodal) functions, and when finding the optimum of functions with a more complex landscape (multiextremal functions). Based on the above advantages, the spider method can be adapted to solve applied problems with relative ease. © Published under licence by IOP Publishing Ltd.
Журнал: IOP Conference Series: Materials Science and Engineering
Выпуск журнала: Vol. 734, Is. 1
ISSN журнала: 17578981
Издатель: Institute of Physics Publishing 012141
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.