Home » Source Code » Ant colony optimization algorithms ACO

Ant colony optimization algorithms ACO

amin
2016-05-26 01:11:28
The author
View(s):
Download(s): 1
Point (s): 1 

Description

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food.

At first, the ants wander randomly. When an ant finds a source of food, it walks back to the colony leaving "markers" (pheromones) that show the path has food. When other ants come across the markers, they are likely to follow the path with a certain probability. If they do, they then populate the path with their own markers as they bring the food back. As more ants find the path, it gets stronger until there are a couple streams of ants traveling to various food sources near the colony.

Because the ants drop pheromones every time they bring food, shorter paths are more likely to be stronger, hence optimizing the "solution." In the meantime, some ants are still randomly scouting for closer food sources. A similar approach can be used find near-optimal solution to the traveling salesman problem.

Once the food source is depleted, the route is no longer populated with pheromones and slowly decays.

Because the ant-colony works on a very dynamic system, the ant colony algorithm works very well in graphs with changing topologies. Examples of such systems include computer networks, and artificial intelligence simulations of workers.

Sponsored links

File list

Tips: You can preview the content of files by clicking file names^_^
Name Size Date
ACO.m2.61 kB10-11-13|13:34
ACO_binary.m2.65 kB10-11-13|13:34
ACO_Elitist.m2.55 kB10-11-13|13:34
ACO_rank.m2.56 kB10-11-13|13:34
calculated_distance.m691.00 B10-11-13|13:33
data.mat358.00 B12-07-13|17:16
data.xlsx10.74 kB12-07-13|15:39
fitness.m644.00 B10-11-13|13:34
MMAS.m2.60 kB10-11-13|13:34
RouletteWheel.m599.00 B10-11-13|13:34
ACO.m2.14 kB12-07-13|16:48
ACO_Elitist.m2.05 kB12-07-13|15:25
ACO_rank.m2.06 kB12-07-13|15:39
calculated_distance.m186.00 B12-07-13|14:54
data.xlsx13.90 kB12-07-13|16:42
fitness.m105.00 B12-07-13|16:38
MMAS.m2.11 kB12-07-13|15:58
RouletteWheel.m94.00 B12-07-13|14:59
~$data.xlsx165.00 B12-07-13|15:31
ACO.m2.77 kB10-11-13|14:33
ACO_Elitist.m2.54 kB10-11-13|14:33
ACO_rank.m2.54 kB10-11-13|14:33
ACS.m2.60 kB10-11-13|14:33
calculated_distance.m687.00 B10-11-13|14:34
data.xlsx10.74 kB12-07-13|15:39
fitness.m613.00 B10-11-13|14:34
MMAS.m2.59 kB10-11-13|14:33
RouletteWheel.m595.00 B10-11-13|14:33
~$data.xlsx165.00 B12-07-13|15:31
ACO-knapsack0.00 B10-04-15|14:01
ACO-SPP0.00 B10-04-15|14:01
ACO-TSP0.00 B10-04-15|14:01
ACO0.00 B10-04-15|14:03
...
Sponsored links

Comments

(Add your comment, get 0.1 Point)
Minimum:15 words, Maximum:160 words
  • 1
  • Page 1
  • Total 1

Ant colony optimization algorithms ACO (42.82 kB)

Need 1 Point(s)
Your Point (s)

Your Point isn't enough.

Get 22 Point immediately by PayPal

Point will be added to your account automatically after the transaction.

More(Debit card / Credit card / PayPal Credit / Online Banking)

Submit your source codes. Get more Points

LOGIN

Don't have an account? Register now
Need any help?
Mail to: support@codeforge.com

切换到中文版?

CodeForge Chinese Version
CodeForge English Version

Where are you going?

^_^"Oops ...

Sorry!This guy is mysterious, its blog hasn't been opened, try another, please!
OK

Warm tip!

CodeForge to FavoriteFavorite by Ctrl+D