By Topic

The lightweight genetic search algorithm: an efficient genetic algorithm for small search range 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)
Chun-Hung Lin ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ja-Ling Wu,

In this paper, the effectiveness of the genetic operations of the common genetic algorithms, such as crossover and mutation, are analyzed for small search range situations. As expected, the thus-obtained efficiency/performance of the genetic operations is quite different from that of their large search range counterparts. To fill this gap, a lightweight genetic search algorithm is presented to provide an efficient way for generating near-optimal solutions for these kinds of applications

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998