2017
DOI: 10.1155/2017/5978375
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Support Structures for Offshore Wind Turbines Using Genetic Algorithm with Domain‐Trimming

Abstract: The powerful genetic algorithm optimization technique is augmented with an innovative "domain-trimming" modification. The resulting adaptive, high-performance technique is called Genetic Algorithm with Domain-Trimming (GADT). As a proof of concept, the GADT is applied to a widely used benchmark problem. The 10-dimensional truss optimization benchmark problem has well documented global and local minima. The GADT is shown to outperform several published solutions. Subsequently, the GADT is deployed onto three-di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
18
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 25 publications
(18 citation statements)
references
References 33 publications
0
18
0
Order By: Relevance
“…25 rived gradients. Other optimization approaches using meta-heuristic algorithms were reported by AlHamaydeh et al (2017) and Kaveh and Sabeti (2018), however, without realistic load assumptions. The problem of discrete design variables was addressed by Stolpe and Sandal (2018).…”
Section: Introductionmentioning
confidence: 99%
“…25 rived gradients. Other optimization approaches using meta-heuristic algorithms were reported by AlHamaydeh et al (2017) and Kaveh and Sabeti (2018), however, without realistic load assumptions. The problem of discrete design variables was addressed by Stolpe and Sandal (2018).…”
Section: Introductionmentioning
confidence: 99%
“…In principle, SQP can be seen as an adaption of Newton's method to nonlinear constrained optimization problems, computing the solution of the Karush-Kuhn-Tucker equations (necessary conditions for constrained problems). Here, a common approach is deployed, based on the works of Biggs (1975), Han (1977), and Powell (1978a, b). In the first step, the Hessian of the so-called Lagrangian (a term incorporating the objective and the sum of all constraints weighted by Lagrange multipliers) is approximated by the Broyden-Fletcher-Goldfarb-Shanno method (Fletcher, 1987).…”
Section: Sequential Quadratic Programming Methodsmentioning
confidence: 99%
“…In principle, SQP can be seen as an adaption of Newton's method to nonlinear constrained optimization problems, computing the solution of the Karush-Kuhn-Tucker equations (necessary conditions for constrained problems). Here, a common approach is deployed, based on the works of Biggs (1975), Han (1977), and Powell (1978a, b). In the first step, the Hessian of the so-called Lagrangian (a term incorporating the objective and the sum of all constraints weighted by Lagrange multipliers) is approximated by the Broyden-Fletcher-Goldfarb-Shanno method (Fletcher, 1987).…”
Section: Sequential Quadratic Programming Methodsmentioning
confidence: 99%