No label defined (Q4934634)
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 1390344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1390344 |
Statements
16 November 2001
0 references
traveling Salesman problem
0 references
ANT algorithm
0 references
0.9738144
0 references
0.8926211
0 references
0.8830811
0 references
0.87996733
0 references
0.87870795
0 references
The paper surveys applications of the Ant Colony Optimization (ACO) metaheuristic to the travelling salesman problem. Parameter settings and experimental results are mentioned. Further a short outlook to other applications of ACO algorithms, as for quadratic assignment problems, vehicle routing, and other combinatorial optimization problems is given. For the entire collection see [Zbl 0922.00027].
0 references
