The use of dynamic programming in genetic algorithms for permutation problems (Q1268271)
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: The use of dynamic programming in genetic algorithms for permutation problems |
scientific article; zbMATH DE number 1212248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The use of dynamic programming in genetic algorithms for permutation problems |
scientific article; zbMATH DE number 1212248 |
Statements
The use of dynamic programming in genetic algorithms for permutation problems (English)
0 references
18 October 1998
0 references
dynamic programming
0 references
genetic algorithm
0 references
single machine scheduling
0 references
optimal linear arrangement
0 references
traveling salesman
0 references
0 references
0.89602864
0 references
0.8786849
0 references
0.87428766
0 references
0.86971915
0 references
0.85625803
0 references
0.85625803
0 references
0.8542077
0 references
