Репозиторий Dspace

Selecting Some Variables to Update-Based Algorithm for Solving Optimization Problems

Показать сокращенную информацию

dc.rights.license CC BY eng
dc.contributor.author Dehghani, Mohammad cze
dc.contributor.author Trojovský, Pavel cze
dc.date.accessioned 2025-12-05T10:51:42Z
dc.date.available 2025-12-05T10:51:42Z
dc.date.issued 2022 eng
dc.identifier.issn 1424-8220 eng
dc.identifier.uri http://hdl.handle.net/20.500.12603/1452
dc.description.abstract With the advancement of science and technology, new complex optimization problems have emerged, and the achievement of optimal solutions has become increasingly important. Many of these problems have features and difficulties such as non-convex, nonlinear, discrete search space, and a non-differentiable objective function. Achieving the optimal solution to such problems has become a major challenge. To address this challenge and provide a solution to deal with the complexities and difficulties of optimization applications, a new stochastic-based optimization algorithm is proposed in this study. Optimization algorithms are a type of stochastic approach for addressing optimization issues that use random scanning of the search space to produce quasi-optimal answers. The Selecting Some Variables to Update-Based Algorithm (SSVUBA) is a new optimization algorithm developed in this study to handle optimization issues in various fields. The suggested algorithm's key principles are to make better use of the information provided by different members of the population and to adjust the number of variables used to update the algorithm population during the iterations of the algorithm. The theory of the proposed SSVUBA is described, and then its mathematical model is offered for use in solving optimization issues. Fifty-three objective functions, including unimodal, multimodal, and CEC 2017 test functions, are utilized to assess the ability and usefulness of the proposed SSVUBA in addressing optimization issues. SSVUBA's performance in optimizing real-world applications is evaluated on four engineering design issues. Furthermore, the performance of SSVUBA in optimization was compared to the performance of eight well-known algorithms to further evaluate its quality. The simulation results reveal that the proposed SSVUBA has a significant ability to handle various optimization issues and that it outperforms other competitor algorithms by giving appropriate quasi-optimal solutions that are closer to the global optima. eng
dc.format p. "Article Number: 1795" eng
dc.language.iso eng eng
dc.publisher MDPI-Molecular diversity preservation international eng
dc.relation.ispartof Sensors, volume 22, issue: 5 eng
dc.subject optimization eng
dc.subject selected variables eng
dc.subject optimization problem eng
dc.subject population-based algorithm eng
dc.subject population updating eng
dc.title Selecting Some Variables to Update-Based Algorithm for Solving Optimization Problems eng
dc.type article eng
dc.identifier.obd 43878717 eng
dc.identifier.doi 10.3390/s22051795 eng
dc.publicationstatus postprint eng
dc.peerreviewed yes eng
dc.source.url https://www.mdpi.com/1424-8220/22/5/1795 cze
dc.relation.publisherversion https://www.mdpi.com/1424-8220/22/5/1795 eng
dc.rights.access Open Access eng


Файлы в этом документе

Данный элемент включен в следующие коллекции

Показать сокращенную информацию

Поиск в DSpace


Просмотр

Моя учетная запись