A new hybrid method for solving global optimization problem

doi:10.1016/j.amc.2011.08.066

Return

A new hybrid method for solving global optimization problem

2011-12-01

PRE

Samira El Moumen *

Rachid Ellaia

Rajae Aboulaïch

DOI：10.1016/j.amc.2011.08.066

Original

Original request for help

Save

Abstract

En 中文

In this paper we present a new hybrid method, called the SASP method. The purpose of this method is the hybridization of the simulated annealing (SA) with the descent method, where we estimate the gradient using simultaneous perturbation. Firstly, the new hybrid method finds a local minimum using the descent method, then SA is executed in order to escape from the currently discovered local minimum to a better one, from which the descent method restarts a new local search, and so on until convergence. The new hybrid method can be widely applied to a class of global optimization problems for continuous functions with constraints. Experiments on 30 benchmark functions, including high dimensional functions, show that the new method is able to find near optimal solutions efficiently. In addition, its performance as a viable optimization method is demonstrated by comparing it with other existing algorithms. Numerical results improve the robustness and efficiency of the method presented. (C) 2011 Elsevier Inc. All rights reserved.

Keywords:

Global optimization

Hybrid method

Simultaneous perturbation

Simulated annealing

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.