Title: Hybrid genetic algorithm with quick convergence
Abstract: Premature convergence and low converging speed are the distinct weaknesses of genetic algorithms. A hybrid algorithm that can quickly converge to the optimal set is proposed and its convergence is analyzed. Some hybrid genetic algorithms use the genetic algorithms as the main body and directly act on the solution space of the problem. They are different from the hybrid algorithm, because the hybrid algorithm implements indirect search, that is, the search direction is generated by using GAs. On the one hand, the global search capability of GAs is utilized to guarantee the convergence of the hybrid algorithm. On the other hand, Nelder-Mead Simplex is used to strong the local search and fast convergence of the hybrid algorithm. Computed results and theory analysis indicate that the method is a robust and efficient algorithm with global optimization.
Publication Year: 2002
Publication Date: 2002-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot