Record Details

GENETIC SEARCH ALGORITHMS AND THEIR RANDOMIZED OPERATORS

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title GENETIC SEARCH ALGORITHMS AND THEIR RANDOMIZED OPERATORS
 
Creator ARUNKUMAR, S
CHOCKALINGAM, T
 
Description Genetic algorithms are stochastic search procedures based on randomized operators such as crossover and mutation. Many of the earlier works that have attempted to analyse the behaviour of genetic algorithms have marginalized the role of these operators through gross abstractions. In this paper, we place in perspective these operators within the genetic search strategy. Certain important properties of these operators have been brought out through simple formalisms. The search behaviour of the genetic algorithm has been modeled in a Markovian framework and strong convergence proved. The limiting analysis of the algorithm reveals the vital interplay of the randomized operators.
 
Publisher PERGAMON-ELSEVIER SCIENCE LTD
 
Date 2011-08-24T12:25:39Z
2011-12-26T12:56:54Z
2011-12-27T05:46:24Z
2011-08-24T12:25:39Z
2011-12-26T12:56:54Z
2011-12-27T05:46:24Z
1993
 
Type Article
 
Identifier COMPUTERS & MATHEMATICS WITH APPLICATIONS, 25(5), 91-100
0898-1221
http://dx.doi.org/10.1016/0898-1221(93)90202-7
http://dspace.library.iitb.ac.in/xmlui/handle/10054/10885
http://hdl.handle.net/10054/10885
 
Language en