A Hybrid Genetic Algorithm for Nonconvex Function Minimization

Authors:
M. F. Hussain;K. S. Al-Sultan
Affiliations:
Data Processing Center, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia/;Department of Systems Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
Venue:
Journal of Global Optimization
Year:
1997

Citing 4
Cited 2

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Stochastic global optimization methods. part 11: multi level methods

Mathematical Programming: Series A and B
Global optimization and simulated annealing

Mathematical Programming: Series A and B
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Parallelizing simulated annealing algorithms based on high-performance computer

Journal of Global Optimization
Global optimization of signomial mixed-integer nonlinear programming problems with free variables

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of minimizing a function in severalvariables which could be multimodal and may possess discontinuities. A newalgorithm for the problem based on the genetic technique is developed. Thealgorithm is hybrid in nature in the sense that it utilizes the genetictechnique to generate search directions, which are used in an optimizationscheme and is thus different from any other methods in the literature.The algorithm has been tested on the Rosenbrock valley functions in 2 and 4dimensions, and multimodal functions in 2 and 4 dimensions, which are of ahigh degree of difficulty. The results are compared with the Adaptive RandomSearch, and Simulated Annealing algorithms. The performance of the algorithmis also compared to recent global algorithms in terms of the number offunctional evaluations needed to obtain a global minimum and results show thatthe proposed algorithm is better than these algorithms on a set of standardtest problems. It seems that the proposed algorithm is efficient and robust.