Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.
DOI: 10.1109/enc.2004.1342621
|View full text |Cite
|
Sign up to set email alerts
|

Culturizing differential evolution for constrained optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(15 citation statements)
references
References 13 publications
0
15
0
Order By: Relevance
“…(ii) each chromosome is compared with the Situational Knowledge homologue chromosome; (iii) if they are equals, the electric component is not changed and is stored in the new individual homologue chromosome of the population, while its parameter value is calculated with a differential evolution technique [22], [23]; (iv) if they are different, the new electrical component and its numerical value are assigned randomly. The update function u s compares the best individual with the current one and, if better, stores it in the domain.…”
Section: B the Cupbesmentioning
confidence: 99%
See 1 more Smart Citation
“…(ii) each chromosome is compared with the Situational Knowledge homologue chromosome; (iii) if they are equals, the electric component is not changed and is stored in the new individual homologue chromosome of the population, while its parameter value is calculated with a differential evolution technique [22], [23]; (iv) if they are different, the new electrical component and its numerical value are assigned randomly. The update function u s compares the best individual with the current one and, if better, stores it in the domain.…”
Section: B the Cupbesmentioning
confidence: 99%
“…In recent soft computing applications, this problem has been faced by cultural algorithms (CAs) [20]- [23]: during the evolution, the information on the search advance acquired by most promising individual is shared with the entire population of potential solutions. This goal is achieved by means of a dynamic mechanism (belief space) of information selection (best solution acceptance), processing (knowledge update), and diffusion (evolution influence).…”
Section: Introductionmentioning
confidence: 99%
“…Lipmann equation gives the electric charge per unit area of the interface [1,2]: a7I aIVT,P,ui /u -0S where y is the interfacial tension, V is the applied voltage, a is the charge on unit area of the interface, T is the temperature, p is the external pressure and t j I is the chemical potential of the combination of species I, whose net charge is 0. Here, 0(0) is the contact angle without externally applied electrical potential, 0(V) is the contact angle under the electrical potential of V, E is the electric permittivity of the dielectric layer beneath the droplet, Ylg is the interfacial tension between liquid droplet and surrounding gas, and d is the thickness of dielectric layer.…”
Section: The Electrowetting Effectmentioning
confidence: 99%
“…The process of creating new candidates is described in the pseudocode as shown in Fig. 4, [1] [13], [15][16][17]. …”
Section: ) Mutation and Recombination To Create New Vectorsmentioning
confidence: 99%
“…6. [1], [13], [15][17]. Generate and evaluate initial population Loop while the termination criteria is not met (e.g.…”
Section: ) Selection and The Overall Dementioning
confidence: 99%