By Topic

Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorithm

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
$33 $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)
E. Bagheri ; University of New Bruswick, Canada ; H. Deldari

Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually increase algorithm performance [4]. Fuzzy control as another optimization solution along with genetic algorithms can significantly increase algorithm performance. Two variations for genetic algorithm and fuzzy system composition exist. In the first approach Genetic algorithms are used to optimize and model the structure of fuzzy systems through knowledge base or membership function design while the second approach exploits fuzzy to dynamically supervise genetic algorithm performance by speedily reaching an optimal solution. In this paper we propose a new method for fuzzy parallel genetic algorithms, in which a parallel client-server single population fuzzy genetic algorithm is configured to optimize the performance of the first three Dejong functions in order to reach a global solution in the least possible iterations. Simulations show much improvement in genetic algorithm performance evaluation.

Published in:

11th IEEE Symposium on Computers and Communications (ISCC'06)

Date of Conference:

26-29 June 2006