Zobrazeno 1 - 10
of 9 191
pro vyhledávání: '"Optimization problems"'
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-24 (2024)
Abstract The sand cat swarm optimization (SCSO) is a recently proposed meta-heuristic algorithm. It inspires hunting behavior with sand cats based on hearing ability. However, in the later stage of SCSO, it is easy to fall into local optimality and c
Externí odkaz:
https://doaj.org/article/9e7e48d6783c46cead42c8c25b941295
Publikováno v:
Complex & Intelligent Systems, Vol 10, Iss 5, Pp 6839-6865 (2024)
Abstract The primary objective of multi-objective evolutionary algorithms (MOEAs) is to find a set of evenly distributed nondominated solutions that approximate the Pareto front (PF) of a multi-objective optimization problem (MOP) or a many-objective
Externí odkaz:
https://doaj.org/article/a0011dfdaf454f1992ddd309c88fd138
Publikováno v:
Alexandria Engineering Journal, Vol 98, Iss , Pp 364-389 (2024)
There are many classic highly complex optimization problems in the world, therefore, it is still necessary to find an applicable and effective algorithm to solve these problems. In this paper, self-adaptive hybrid cross mutation slime mold algorithm
Externí odkaz:
https://doaj.org/article/bdd3c37137e347ed983f2ba201cd8c36
Autor:
Nejlaoui M.
Publikováno v:
Applied and Computational Mechanics, Vol 18, Iss 1, Pp 77-110 (2024)
Optimization is getting more and more important due to its application in real engineering problems. Recently, the vibrating particles system algorithm has been developed as an efficient method for mono-objective optimization. However, in multi- and
Externí odkaz:
https://doaj.org/article/f4d4b6df7e294aa4a59ee96fdbe25ca3
Publikováno v:
Jisuanji kexue yu tansuo, Vol 18, Iss 6, Pp 1526-1542 (2024)
The group theory-based optimization algorithm (GTOA) is a discrete evolutionary algorithm designed by group theory methods, which is very suitable for solving combinatorial optimization problems with integer vectors as feasible solutions. In order to
Externí odkaz:
https://doaj.org/article/2170a4740a6a49b58df98008957f5e88
Publikováno v:
Complex & Intelligent Systems, Vol 10, Iss 5, Pp 6009-6030 (2024)
Abstract Many surrogate-assisted evolutionary algorithms (SAEAs) have been shown excellent search performance in solving expensive constrained optimization problems (ECOPs) with continuous variables, but few of them focus on ECOPs with mixed-integer
Externí odkaz:
https://doaj.org/article/0aa097058a7d4271abdb2442acadcf0f
Publikováno v:
Journal of Inequalities and Applications, Vol 2024, Iss 1, Pp 1-24 (2024)
Abstract The alternating direction method of multipliers (ADMM) has been widely used to solve linear constrained problems in signal processing, matrix decomposition, machine learning, and many other fields. This paper introduces two linearized ADMM a
Externí odkaz:
https://doaj.org/article/532adba1ca0349a0b12d70623e483223