Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833)
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: Hybridizing evolutionary algorithms with variable-depth search to overcome local optima |
scientific article; zbMATH DE number 5871661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybridizing evolutionary algorithms with variable-depth search to overcome local optima |
scientific article; zbMATH DE number 5871661 |
Statements
Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (English)
0 references
30 March 2011
0 references
evolutionary algorithms
0 references
hybridization
0 references
iterated local search
0 references
memetic algorithms
0 references
simulated annealing
0 references
runtime analysis
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9041224
0 references
0.8982889
0 references
0.8945583
0 references
0.89063483
0 references
