By Topic

Multilevel distributed genetic algorithms

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 $33
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)
P. Osmera ; Brno Tech. Univ. ; I. Simonik ; J. Roupec

Some problems are very difficult to solve by mathematical programming approaches. A genetic algorithm (GA) is an extremely powerful optimization technique that could be used to solve such problems, but its efficiency is dependent on its ability to do a large number of evaluations in a reasonable amount of time. A classical GA contains three basic operators-reproduction, crossover and mutation. To increase the efficiency of a genetic algorithm the influence of migration in a multilevel distributed GA (MDGA) was tested. Several different structures of PC computers connected in a local area network (LAN) were used for the MDGAs. MDGAs use the power of the computers better than one-level distributed GAs. The problem of communication between the computers in the MDGAs was dealt with in two different ways, with files on a server or by sending packets

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995