By Topic

Reducing the search time of a steady state genetic algorithm using the immigration operator

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

3 Author(s)
M. C. Moed ; United Parcel Service, Danbury, CT, USA ; C. V. Stewart ; R. B. Kelly

An examination is made of the fundamental trade-off between exploration and exploitation in a genetic algorithm (GA). An immigration operator is introduced that infuses random members into successive GA populations. It is theorized that immigration maintains much of the exploitation of the GA while increasing exploration. To test this theory, a set of functions that often require the GA to perform an excessive number of evaluations to find the global optimum of the function is designed. For These functions, it is shown experimentally that a GA enhanced with immigration (1) reduces the number of trials that require an excessive number of evaluations and (2) decreases the average number of evaluations needed to find the optimum function

Published in:

Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on

Date of Conference:

10-13 Nov 1991