Introduction to Optimum Design 2004
DOI: 10.1016/b978-012064155-0/50012-4
|View full text |Cite
|
Sign up to set email alerts
|

Introduction to Optimum Design with MATLAB

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
780
0
23

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 695 publications
(806 citation statements)
references
References 0 publications
3
780
0
23
Order By: Relevance
“…This problem was first described by Belegundu [8] and Arora [9]. The design objective is to minimize the weight of a tension/compression spring subject to constraints on shear stress, surge frequency and minimum deflections as shown in Figure 1.…”
Section: Design Of Tension/compression Springmentioning
confidence: 99%
“…This problem was first described by Belegundu [8] and Arora [9]. The design objective is to minimize the weight of a tension/compression spring subject to constraints on shear stress, surge frequency and minimum deflections as shown in Figure 1.…”
Section: Design Of Tension/compression Springmentioning
confidence: 99%
“…In this work, two optimizations algorithms of HAWTOPT are used: The sequential linear programming (SLP) method of Arora 14 and the simple genetic algorithm (SGA) of Goldberg. 15 The main reason for selecting these algorithm is that the authors had good experience working with them for wind turbine rotor optimization in previous works.…”
Section: Optimization Algorithmsmentioning
confidence: 99%
“…The move-limits are adaptive and automatically adjusted according to the convergence toward an optimum on basis of the rate of convergence. 14 The SLP approach typically has an attractive rate of convergence and is therefore efficient in terms of the number of cost function evaluations required. However, this is at the expense of being sensitive to local minima.…”
Section: Sequential Linear Programmingmentioning
confidence: 99%
“…Mutation is the third step that safeguards the process from a complete premature loss of valuable genetic material during selection and crossover. The foregoing three steps are repeated for successive generations of the population until no further improvement in fitness is attainable [14,15,16]. applied.…”
Section: A Genetic Algorithmsmentioning
confidence: 99%