Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (Q1348274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art |
scientific article; zbMATH DE number 1741979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art |
scientific article; zbMATH DE number 1741979 |
Statements
Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (English)
0 references
15 May 2002
0 references
The paper provides a comprehensive survey of the most popular constraint-handling techniques currently used in evolutionary algorithms. The author reviews approaches that go from simple variations of penalty function, to others, more sophisticated, that are biologically inspired by emulations of immune systems and by the study of culture or ant colonies. Besides briefly description of each of these approaches, some criticism is given regarding their highlights and drawbacks. Also the author provides some guidelines how to select the most appropriate constraint-handling techniques for certain applications. The paper can be interesting to students, engineers and scientists working in the area of structural optimization.
0 references
constraint-handling techniques
0 references
evolutionary algorithms
0 references
penalty function
0 references
structural optimization
0 references
0 references
0 references
0 references
0.8073816895484924
0 references
0.8017458319664001
0 references
0.8004343509674072
0 references
0.7984275221824646
0 references
