Mapping the convergence of genetic algorithms (Q955480)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5369129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mapping the convergence of genetic algorithms |
scientific article; zbMATH DE number 5369129 |
Statements
Mapping the convergence of genetic algorithms (English)
0 references
20 November 2008
0 references
Summary: This paper examines the convergence of genetic algorithms using a cluster-analytic-type procedure. The procedure is illustrated with a hybrid genetic algorithm applied to the quadratic assignment problem. Results provide valuable insight into how population members are selected as the number of generations increases and how genetic algorithms approach stagnation after many generations.
0 references
convergence
0 references
genetic algorithms
0 references
quadratic assignment problem
0 references
0 references
0 references
0 references
0.772145688533783
0 references
0.7717318534851074
0 references
0.7714442610740662
0 references
