Local search algorithms based on benchmark test functions problem

Abstract

<p>Optimization process is normally implemented to solve several objectives in the form of single or multi-objectives modes. Some traditional optimization techniques are computationally burdensome which required exhaustive computational times. Thus, many studies have invented new optimization techniques to address the issues. To realize the effectiveness of the proposed techniques, implementation on several benchmark functions is crucial. In solving benchmark test functions, local search algorithms have been rigorously examined and employed to diverse tasks. This paper highlights different algorithms implemented to solve several problems. The capacity of local search algorithms in the resolution of engineering optimization problem including benchmark test functions is reviewed. The use of local search algorithms, mainly Simulated Annealing (SA) and Great Deluge (GD) according to solve different problems is presented. Improvements and hybridization of the local search and global search algorithms are also reviewed in this paper. Consequently, benchmark test functions are proposed to those involved in local search algorithm.</p>