Efficient Modified Meta-Heuristic Technique for Unconstrained Optimization Problems
In this paper, a new Modified Meta-Heuristic algorithm is proposed. This method contains some modifications to improve the performance of the simulated-annealing algorithm (SA). Most authors who deal with improving the SA algorithm presented some improvements and modifications to one or more of the...
Main Authors: | Khalid Abdulaziz Alnowibet, Ahmad M. Alshamrani, Adel Fahad Alrasheedi, Salem Mahdi, Mahmoud El-Alem, Abdallah Aboutahoun, Ali Wagdy Mohamed |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-09-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/11/9/483 |
Similar Items
-
A Hybrid Stochastic Deterministic Algorithm for Solving Unconstrained Optimization Problems
by: Ahmad M. Alshamrani, et al.
Published: (2022-08-01) -
A Family of Hybrid Stochastic Conjugate Gradient Algorithms for Local and Global Minimization Problems
by: Khalid Abdulaziz Alnowibet, et al.
Published: (2022-10-01) -
Modified shifted variable metric algorithms for solving unconstrained minimization problems
by: Abbas Y. AL-Bayati, et al.
Published: (2010-09-01) -
Modified the CG-Algorithm for Unconstrained Non-Linear Optimization by Using Oren’s Update
by: Abbas Al-Bayati, et al.
Published: (2005-12-01) -
Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver
by: Keisuke Otaki, et al.
Published: (2023-03-01)