By Topic

Method to achieve better performance in genetic algorithms applied to time-constrained, multi-solution problems

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)
Dickens, T.P. ; Boeing Co., Seattle, WA ; Karr, C.L.

It has been demonstrated that a periodic complete reinitialization of a running genetic algorithm (GA) solution will result in a higher convergence rate for a series of problems. This technique, referred to as the “total-comet-strike” operator, has been applied to a number of multi-solution GA problems. Where it has been used, an improvement has been shown both in the number of cases that converge within an imposed time limit and in the average time required for each case

Published in:

Intelligence and Systems, 1998. Proceedings., IEEE International Joint Symposia on

Date of Conference:

21-23 May 1998