By Topic

More efficient genetic algorithm for solving optimization 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
$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

2 Author(s)
S. Ghoshray ; Dept. of Electr. & Comput. Eng., Florida Int. Univ., Miami, FL, USA ; K. K. Yen

Genetic algorithms (GA) are stochastic search techniques based on mechanics of natural selection and natural genetics. By using genetic operators and cumulative information, genetic algorithms prune the search space and generate a set of plausible solutions. This paper describes an efficient genetic algorithm defined as modified genetic algorithms (MGA). The proposed algorithms is developed by hybridising simple genetic algorithms (SGA) with simulated annealing (SA). In this proposed algorithm, all the conventional genetic operators, such as, selection, reproduction, crossover, mutation, have been used. But they have been modified by a set of new functions such as a selection function 1, a selection function 2, a mutation function, etc., which utilizes the concept of successive descent as seen in simulated annealing. In this way, MGA can be implemented to solve various optimization problems more accurately and quickly

Published in:

Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century., IEEE International Conference on  (Volume:5 )

Date of Conference:

22-25 Oct 1995