A new hybrid optimization algorithm framework to solve constrained optimization problem

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Evolutionary Computation made great success from the theory of natural selection devised by Charles Darwin. It was a process of randomly searching but not emphasizing each individuals respective functions. This paper proposed a hybrid optimization algorithm framework trying to incorporate natural selection and survival of the fittest and birds of a feather flock together. Aiming at balancing search results and search speed, we adopted the search strategy to classify the individuals by their fitness. Individuals classification differentiated respective function in search process, thats the excellent individuals mine the local optimal solution and others explore the search domain to find new local optimal solution. Experimental findings support the theoretical basis of the proposed framework. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Huang, Z., & Cheng, H. (2007). A new hybrid optimization algorithm framework to solve constrained optimization problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4490 LNCS, pp. 1005–1012). https://doi.org/10.1007/978-3-540-72590-9_153

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free