Ant colony optimization
From DDL Wiki
(Difference between revisions)
| Line 1: | Line 1: | ||
| - | + | Ant Colony Optimization (ACO) is a probabalistic technique inspired by the way ants make and find paths from the colony to food. The technique is used to solve computational problems that can be reduced to finding good paths through graphs. | |
| + | |||
| + | ==History== | ||
| + | |||
| + | ==Real World Ant Behavior== | ||
| + | |||
| + | ==Application== | ||
| + | |||
| + | ==External Links== | ||
| + | |||
| + | ==References== | ||
Revision as of 12:02, 29 November 2006
Ant Colony Optimization (ACO) is a probabalistic technique inspired by the way ants make and find paths from the colony to food. The technique is used to solve computational problems that can be reduced to finding good paths through graphs.
Contents |
