An improved particle swarm algorithm based on cultural algorithm for constrained optimization

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

Abstract

This paper develops an improved particle swarm optimization algorithm based on cultural algorithm for constrained optimization problems. Firstly, chaos method is utilized in the initialization process of single swarm in population space to assure the searching breadth, and evolves with standard particle swarm optimization (PSO). Secondly, fixed proportion elites are selected from population space to construct the swarm of belief space through acceptance function. Then, the belief space updates its normative knowledge and situational knowledge according to the elite particles, and the elite-swarm in the belief space performs PSO operation according to the update knowledge and generates new particles. After that, the belief space renews the knowledge again, and passes down the new knowledge which has been updated twice to give better guidance to all the particles in the population space. The efficiency of the initialization strategy and the double evolving knowledge strategy are verified in six constrained optimization problems. © 2012 Springer-Verlag GmbH Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, L., Cao, C., Xu, Z., & Gu, X. (2012). An improved particle swarm algorithm based on cultural algorithm for constrained optimization. In Advances in Intelligent and Soft Computing (Vol. 135, pp. 453–460). https://doi.org/10.1007/978-3-642-27708-5_62

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