A cultural algorithm with differential evolution to solve constrained optimization problems

36Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A cultural algorithm is proposed in this paper. The main novel feature of this approach is the use of differential evolution as a population space. Differential evolution has been found to be very effective when dealing with real valued optimization problems. The knowledge sources contained in the belief space of the cultural algorithm are specifically designed according to the differential evolution population. Furthermore, we introduce an influence function that selects the source of knowledge to apply the evolutionary operators. Such influence function considerably improves the performance when compared to a previous version of the algorithm (developed by the same authors). We use a well-known set of test functions to validate the approach, and compare the results with respect to the best constraint-handling technique known to date in evolutionary optimization. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Becerra, R. L., & Coello Coello, C. A. (2004). A cultural algorithm with differential evolution to solve constrained optimization problems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 881–890). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_88

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