A Hybrid Algorithm for Identifying Global and Local Minima When Optimizing Functions with Many Minima

Salhi, Said and Queen, Nat M. (2004) A Hybrid Algorithm for Identifying Global and Local Minima When Optimizing Functions with Many Minima. European Journal of Operational Research, 155 (1). pp. 51-67. ISSN 0377-2217. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/S0377-2217(02)00871-8

Abstract

The problem of determining most global minima including some of the local ones for unconstrained non-convex functions is investigated. This is tackled using a hybrid approach that combines simulated annealing, tabu search and a descent method. This approach has the advantage of not requiring differentiability of the function. The special feature of this approach is that it produces not only all the global minima with a high frequency but also those good local minima which may be of relevance to the user. This is the first time such a view is put forward, especially in the context of functions of continuous variables. This method is tested on standard test functions used in the literature, and encouraging results are obtained.

Item Type: Article
Uncontrolled keywords: Global optimization; Tabu search; Simulated annealing; Hybrid algorithms
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 25 Sep 2008 12:45
Last Modified: 07 Apr 2014 13:11
Resource URI: http://kar.kent.ac.uk/id/eprint/5258 (The current URI for this page, for reference purposes)
  • Depositors only (login required):