By Topic

Reducing execution time on genetic algorithm in real-world applications using fitness prediction: parameter optimization of SRM control

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

4 Author(s)
Mutoh, A. ; Nagoya Inst. of Technol., Japan ; Nakamura, T. ; Kato, S. ; Itoh, H.

Genetic algorithm (GA) is an effective method of solving combinatorial optimization problems. Generally speaking most of search algorithms require a large execution time in order to calculate some evaluation value, especially in real-world applications as well. Crossover is very important in GA because discovering a good solution efficiently requires that the good characteristics of the parent individuals be recombined. The multiple crossover per couple (MCPC) is a method that permits a number of children for each mating pair, and MCPC generates a huge amount of execution time to find a good solution. This paper proposes a novel approach to reduce time needed for fitness evaluation by "prenatal diagnosis" using fitness prediction. In the experiments based on actual problems, the proposed method found an optimum solution about 50% faster than the conventional method did. The experimental results from standard test functions show that the proposed method is applicable to other problem as well.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:1 )

Date of Conference:

8-12 Dec. 2003