Application of a modified imperialist competitive algorithm for solving the traveling salesman problem (Q2939876)
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 6390036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Application of a modified imperialist competitive algorithm for solving the traveling salesman problem |
scientific article; zbMATH DE number 6390036 |
Statements
23 January 2015
0 references
traveling salesman problem
0 references
imperialist competitive algorithm
0 references
NP-hard problems
0 references
0.914276957511902
0 references
0.8882461190223694
0 references
0.8783709406852722
0 references
0.8071232438087463
0 references
0.7784136533737183
0 references
