Deb, Kalyanmoy (1999) An introduction to genetic algorithms Sadhana (Academy Proceedings in Engineering Sciences), 24 (4-5). pp. 293-315. ISSN 0256-2499
|
PDF
- Publisher Version
2MB |
Official URL: http://www.ias.ac.in/j_archive/sadhana/24/4and5/29...
Related URL: http://dx.doi.org/10.1007/BF02823145
Abstract
Genetic algorithms (GAs) are search and optimization tools, which work differently compared to classical search and optimization methods. Because of their broad applicability, ease of use, and global perspective, GAs have been increasingly applied to various search and optimization problems in the recent past. In this paper, a brief description of a simple GA is presented. Thereafter, GAs to handle constrained optimization problems are described. Because of their population approach, they have also been extended to solve other search and optimization problems efficiently, including multimodal, multiobjective and scheduling problems, as well as fuzzy-GA and neuro-GA implementations. The purpose of this paper is to familiarize readers to the concept of GAs and their scope of application.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Indian Academy of Sciences. |
Keywords: | Genetic Algorithms; Optimization; Optimal Design; Nonlinear Programming |
ID Code: | 9428 |
Deposited On: | 02 Nov 2010 12:14 |
Last Modified: | 16 May 2016 19:14 |
Repository Staff Only: item control page