A Diversification Operator for Genetic Algorithms

Diptesh Ghosh ()

No WP2011-01-02, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: Conventional genetic algorithms suffer from a dependence on the initial generation used by the algorithm. In case the generation cosnsists of solutions which are not close enough to a global optimum but some of which are close to a relatively good local optimum, the algorithm is often guided a converge to the local optimum. In this paper, we provide a method which allows a genetic algorithm to search the solution space more effectively, and increases its chance to attain a global optimum. We provide computational experience with real-valued genetic algorithms on functions of two variables.

Date: 2011-01-10
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/2011-01-02Diptesh.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:9909

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().