By Topic

Multipoint Organizational Evolutionary Algorithm for Globally Minimizing Functions of Many Variables

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

3 Author(s)
Yanping Lu ; Xiamen Univ., Xiamen ; Shaozi Li ; Changle Zhou

In this paper, we design a variant of the organizational evolutionary algorithm (OEA), called the multipoint organizational evolutionary algorithm (mOEA), for global optimization of multimodal functions. Our objective is to apply crossover strategy of multiple points to enhance the OEA, so that the resulting algorithm can improve the precision of the solutions and have a fast convergence rate. In the mOEA, crossover among many leaders enables the diversity of the leader swarm to be preserved to discourage premature convergence. Another new organizational operator, the integrating operation replacing Annexing manipulation, guarantees members of each organization to converge to the leader fast and also have a good diversity due to mutation. Experiments on six complex optimization benchmark functions with 30 or 100 dimensions and very large numbers of local minima show that, comparing with the original OEA and CLPSO, mOEA effectively converges faster, results in better optima, is more robust.

Published in:

Pervasive Computing and Applications, 2007. ICPCA 2007. 2nd International Conference on

Date of Conference:

26-27 July 2007