Solving of TSP with time restraints by memetic algorithm (Q3403221)
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 5670170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving of TSP with time restraints by memetic algorithm |
scientific article; zbMATH DE number 5670170 |
Statements
12 February 2010
0 references
traveling salesman problem
0 references
memetic algorithm
0 references
time restraints
0 references
greed recessive variation
0 references
recursive arc insertion
0 references
0.8015106320381165
0 references
0.786832869052887
0 references
0.7853796482086182
0 references
0.785260021686554
0 references
