Chaotic-search-based cultural algorithm for solving unconstrained optimization problem

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

For premature convergence and instability of cultural algorithm in solving function optimization problem, based on cultural algorithm and chaos search optimization, a chaos cultural algorithm (CCA) is proposed. The algorithm model consists of a chaos-based population space and a knowledge-storing belief space, uses normative knowledge and situational knowledge for chaos search and chaos perturbation, respectively, effectively avoids premature convergence of cultural algorithm, and overcomes chaos search optimization's sensitivity to initial values and poor efficiency. Test results show that this algorithm is strong in global search and has good performance in searching efficiency, precision, and stability, especially in solving high-dimensional optimization problem. Copyright © 2011 Jianjia He and Fuyuan Xu.

Cite

CITATION STYLE

APA

He, J., & Xu, F. (2011). Chaotic-search-based cultural algorithm for solving unconstrained optimization problem. Modelling and Simulation in Engineering, 2011. https://doi.org/10.1155/2011/239743

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