Solve uncertain TSP problems by hybrid approach based on ant algorithm (Q3501412)
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: Solve uncertain TSP problems by hybrid approach based on ant algorithm |
scientific article; zbMATH DE number 5284143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solve uncertain TSP problems by hybrid approach based on ant algorithm |
scientific article; zbMATH DE number 5284143 |
Statements
3 June 2008
0 references
uncertain programming
0 references
uncertain traveling salesman problem
0 references
ant algorithm
0 references
0.8128137588500977
0 references
0.7956902980804443
0 references
0.7783065438270569
0 references
0.7750025391578674
0 references
