A Hybrid Genetic Algorithm for Nonconvex Function Minimization |
| |
Authors: | M F Hussain K S Al-Sultan |
| |
Institution: | (1) Data Processing Center, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia;(2) Department of Systems Engineering, King Fahd University of Petroleum and Minerals, Dhahran, 31261, Saudi Arabia |
| |
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. |
| |
Keywords: | Nonconcex function global optimization genetic algorithms searchdirection Rosenbrock functions |
本文献已被 SpringerLink 等数据库收录! |
|