scholarly journals Meta-optimization method of search optimization algorithms

Author(s):  
Karpenko ◽  
Svianadze
2021 ◽  
Vol 30 (2) ◽  
pp. 354-364
Author(s):  
Firas Al-Mashhadani ◽  
Ibrahim Al-Jadir ◽  
Qusay Alsaffar

In this paper, this method is intended to improve the optimization of the classification problem in machine learning. The EKH as a global search optimization method, it allocates the best representation of the solution (krill individual) whereas it uses the simulated annealing (SA) to modify the generated krill individuals (each individual represents a set of bits). The test results showed that the KH outperformed other methods using the external and internal evaluation measures.


Author(s):  
Mohamed B. Trabia ◽  
Xiao Bin Lu

Abstract Optimization algorithms usually use fixed parameters that are empirically chosen to reach the minimum for various objective functions. This paper shows how to incorporate fuzzy logic in optimization algorithms to make the search adaptive to various objective functions. This idea is applied to produce a new algorithm for minimization of a function of n variables using an adaptive form of the simplex method. The search starts by generating a simplex with n+1 vertices. The algorithm replaces the point with the highest function value by a new point. This process comprises reflecting the point with the highest function value in addition to expanding or contracting the simplex using fuzzy logic controllers whose inputs incorporate the relative weights of the function values at the simplex points. The efficiency of the algorithm is studied using a set of standard minimization test problems. This algorithm generally results in a faster convergence toward the minimum. The algorithm is also applied successfully to two engineering design problems.


1973 ◽  
Vol 99 (1) ◽  
pp. 19-31
Author(s):  
Ying-San Lai ◽  
Jan D. Achenbach

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 145469-145488
Author(s):  
Habeeb Bello-Salau ◽  
Adeiza James Onumanyi ◽  
Adnan M. Abu-Mahfouz ◽  
Achonu O. Adejo ◽  
Muhammed Bashir Mu'Azu

2003 ◽  
Vol 38 (6) ◽  
pp. 507-517 ◽  
Author(s):  
S. N Akour ◽  
J. F Nayfeh ◽  
D. W Nicholson

Stress concentrations associated with circular holes in pure shear-loaded plates can be reduced by up to 13.5 per cent by introducing elliptical auxiliary holes along the principal stress directions. These holes are introduced in the areas of low stresses near the main circular hole in order to smooth the principal stress trajectories. A systematic study based on univariate search optimization method is undertaken by using finite element analysis (FEA) to determine the optimum size and location for an auxiliary defence hole system. The results are validated using RGB (red-green-blue) photoelasticity.


2019 ◽  
Vol 2019 ◽  
pp. 1-23 ◽  
Author(s):  
Amir Shabani ◽  
Behrouz Asgarian ◽  
Saeed Asil Gharebaghi ◽  
Miguel A. Salido ◽  
Adriana Giret

In this paper, a new optimization algorithm called the search and rescue optimization algorithm (SAR) is proposed for solving single-objective continuous optimization problems. SAR is inspired by the explorations carried out by humans during search and rescue operations. The performance of SAR was evaluated on fifty-five optimization functions including a set of classic benchmark functions and a set of modern CEC 2013 benchmark functions from the literature. The obtained results were compared with twelve optimization algorithms including well-known optimization algorithms, recent variants of GA, DE, CMA-ES, and PSO, and recent metaheuristic algorithms. The Wilcoxon signed-rank test was used for some of the comparisons, and the convergence behavior of SAR was investigated. The statistical results indicated SAR is highly competitive with the compared algorithms. Also, in order to evaluate the application of SAR on real-world optimization problems, it was applied to three engineering design problems, and the results revealed that SAR is able to find more accurate solutions with fewer function evaluations in comparison with the other existing algorithms. Thus, the proposed algorithm can be considered an efficient optimization method for real-world optimization problems.


Sign in / Sign up

Export Citation Format

Share Document