Home » Source Code » Basic process of Ant Colony algorithm

Basic process of Ant Colony algorithm

hisby
2013-09-30 08:49:23
The author
View(s):
Download(s): 1
Point (s): 1 
Category Category:
AlgorithmAlgorithm MatlabMatlab

Description

Ant (Ant Colony Optimization, ACO), also known as Ant algorithm Are used in the map to find optimal path algorithm for the chance of. By Marco Dorigo in 1992 in his PhD thesis proposed that inspired behavior discovering the path of the ants in search of food. Ant Colony algorithm is a simulation of evolutionary algorithms, preliminary studies indicate that the algorithm has many excellent properties. PID controller parameter optimization problem, Ant Colony algorithm design results compare with the results of genetic algorithm design, simulation results show that ant colony algorithm with a new value of the validity and application of simulated evolutionary optimization method
Sponsored links

File list

Tips: You can preview the content of files by clicking file names^_^
Name Size Date
Untitled.m3.98 kB17-09-13 08:47
...
Sponsored links

Comments

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

Basic process of Ant Colony algorithm (1.98 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