2004
DOI: 10.1016/j.apm.2004.04.004
|View full text |Cite
|
Sign up to set email alerts
|

Generalized extremal optimization: An application in heat pipe design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0
3

Year Published

2007
2007
2023
2023

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 56 publications
(23 citation statements)
references
References 12 publications
0
20
0
3
Order By: Relevance
“…To make the EO method applicable to a broad class of design optimization problems, the generalized extremal optimization (GEO) was proposed by Sousa et al [18]. It is developed to operate on bit strings, capable of tackle continuous, discrete and/or integer variables without concern to how the fitness of the design variables is assigned.…”
Section: Generalized Extremal Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…To make the EO method applicable to a broad class of design optimization problems, the generalized extremal optimization (GEO) was proposed by Sousa et al [18]. It is developed to operate on bit strings, capable of tackle continuous, discrete and/or integer variables without concern to how the fitness of the design variables is assigned.…”
Section: Generalized Extremal Optimizationmentioning
confidence: 99%
“…To enhance EO, other extended EO methods are also presented with the proceed of research. In order to make fitness define more easily a generalization of the EO method was devised and implemented by De Sousa et al [18]. In that new algorithm, which is named generalized extremal optimization (GEO), the fitness is assigned to a population of species of bits and the binary bit to mutate is chosen according to probability distribution over the ranked bit order.…”
Section: Introductionmentioning
confidence: 99%
“…A detailed explanation of GEO can be found in [25,26], while examples of applications to real complex design problems can be found in [10,[25][26][27].…”
Section: D03mentioning
confidence: 99%
“…This algorithm was developed to be easily applicable to a broad class of nonlinear constrained optimization problems, with the presence of any combination of continuous, discrete and integer values, while having only one free parameter to be adjusted. Its efficacy to tackle complex design spaces has been demonstrated with test functions and real design problems [10,[24][25][26][27]. Nonetheless, being a new algorithm, many of its features remain to be explored, such as parallelization, hybridization with other optimization algorithms, or different types of representation for the design variables.…”
Section: Introductionmentioning
confidence: 99%
“…GEO algorithm is a global search meta-heuristic that generalizes the extremal optimization (EO) method [4] inspired by a model of natural evolution. GEO is specially devised to be used in constrained or unconstrained problems, non-convex or even disjoint design spaces, with any combination of continuous, discrete or integer variables [8,9].…”
Section: Solution Representationmentioning
confidence: 99%