Design optimization with advanced genetic search strategies
β Scribed by C.-Y. Lin; P. Hajela
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 1000 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0965-9978
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Suppose x is an n-bit integer. By a comparison question we mean a question of the form "does x satisfy either condition a <x< b or c<x<d?". We describe strategies to find x using the smallest possible number q(n) of comparison questions, and allowing up to two of the answers to be erroneous. As pro
Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method