.png){kind=icon}
.png){kind=icon}
Return
Genetic algorithms in computer aided design
.png){kind=icon}
PRE
AI
DOI：10.1016/S0010-4485(03)00003-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Design is a complex engineering activity, in which computers are more and more involved. The design task can often be seen as an optimization problem in which the parameters or the structure describing the best quality design are sought. Genetic algorithms constitute a class of search algorithms especially suited to solving complex optimization problems. In addition to parameter optimization, genetic algorithms are also suggested for solving problems in creative design, such as combining components in a novel, creative way. Genetic algorithms transpose the notions of evolution in Nature to computers and imitate natural evolution. Basically, they find solution(s) to a problem by maintaining a population of possible solutions according to the 'survival of the fittest' principle. We present here the main features of genetic algorithms and several ways in which they can solve difficult design problems. We briefly introduce the basic notions of genetic algorithms, namely, representation, genetic operators, fitness evaluation, and selection. We discuss several advanced genetic algorithms that have proved to be efficient in solving difficult design problems. We then give an overview of applications of genetic algorithms to different domains of engineering design. (C) 2003 Elsevier Science Ltd. All rights reserved.
Keywords:
CAD
genetic algorithms
optimization
geometric design
conceptual design
mechanism design
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K
Organization
No organization information available