Cart (Loading....) | Create Account
Close category search window
 

A new coevolutionary programming using operators of single-point and particle swarm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xin Zhang ; Dept. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China ; Hongbin Dong

This paper proposes using single-point and particle swarm operators in evolutionary programming. The single-point operator has a good global optimizing ability and accuracy, however, its convergence speed decrease. Compared to the single-point operator, the features of particle swarm operator are in the direct opposite. The two operators are complementary to each other. In this paper, the two mutation operators cooperate under a mixed strategy in order to obtain a better performance. Simulation results show that the proposed coevolutionary algorithm is superior to several popular algorithms proposed in recent years.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:5 )

Date of Conference:

22-24 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.