A cultural algorithm for constrained optimization

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

Abstract

In this paper, we propose a technique that exploits knowledge extracted during the search to improve the performance of an evolutionary algorithm used for global optimization. The approach is based on a cultural algorithm combined with evolutionary programming and we show that produces highly competitive results at a relatively low computational cost.

Cite

CITATION STYLE

APA

Coello Coello, C. A., & Becerra, R. L. (2002). A cultural algorithm for constrained optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2313, pp. 98–107). Springer Verlag. https://doi.org/10.1007/3-540-46016-0_11

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