ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On modeling genetic algorithms for functions of unitation

Srinivas, M and Patnaik, LM (1996) On modeling genetic algorithms for functions of unitation. In: IEEE Transactions on Systems Man And Cybernetics Part B-Cybernetics, 26 (6). pp. 809-821.

[img] PDF
On_Modeling.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/wrapper.jsp?arnu...


We discuss a novel model for analyzing the working of Genetic Algorithms (GA's), when the objective function is a function of unitation. The model is exact (not approximate), and is valid for infinite populations, Functions of unitation depend only on the number of 1's in any string, Hence, we only need to model the variations in the distribution of strings with respect to the number of 1's in the strings, We introduce the notion of a Binomial Distributed Population (BDP) as the building block of our model, and we show that the effect of uniform crossover on BDP's is to generate two other BDP's, We demonstrate that a population with any general distribution may be decomposed into several BDP's, We also show that a general multipoint crossover may be considered as a composition of several uniform crossovers, Based on these results, the effects of mutation and crossover on the distribution of strings have been characterized, and the model has been defined, GASIM - a Genetic Algorithm Simulator for functions of unitation - has been implemented based on the model, and the exactness of the results obtained from GASIM has been verified using actual Genetic Algorithm runs, The time complexity of the GA simulator derived from the model is O(l(3)) (where l is the string length), a significant improvement over previous models with exponential time complexities, As an application of GASIM, we have analyzed the effect of crossover rate on deception in trap functions, a class of deceptive functions of unitation, We have obtained interesting results - we are led to believe that increasing values of pc, the crossover rate, increase the probability of the GA converging to the local optimum of the trap function.

Item Type: Journal Article
Publication: IEEE Transactions on Systems Man And Cybernetics Part B-Cybernetics
Publisher: IEEE
Additional Information: Copyright 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 08 Jan 2010 11:58
Last Modified: 19 Sep 2010 05:26
URI: http://eprints.iisc.ac.in/id/eprint/19042

Actions (login required)

View Item View Item