Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem (Q3175271)
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: Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem |
scientific article; zbMATH DE number 6907529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem |
scientific article; zbMATH DE number 6907529 |
Statements
18 July 2018
0 references
cuckoo search
0 references
traveling salesman problem
0 references
Metropolis acceptance criterion
0 references
Lévy flight
0 references
0.758048415184021
0 references
0.7369374632835388
0 references
0.7315487861633301
0 references
0.7297293543815613
0 references
0.7260230183601379
0 references
