Ant Colony algorithm for optimization of computing
2016-08-23
0 0 0
4.0
Other
Earn points
ACO (Ant Colony Algorithm,ACA) from Italy scholars M.Dorigo, in in the early 1990 of the 20th century's a new evolutionary algorithm, which simulate the foraging behavior of ant colonies in nature. M.Dorigo, who applied it to solve the traveling salesman problem (Traveling Salesman Problem,TSP) and achieved good results.
In recent years, many experts and scholars dedicated to research of Ant Colony algorithm and its application in areas such as transportation, telecommunications, chemical industry, electric power, succeeded in solving some combinatorial optimization problems, such as scheduling problems (job-shop Scheduling Problem), the assignment problem (Quadratic Assignment Problem), TSP (Traveling Salesman Problem) and so on.
In recent years, many experts and scholars dedicated to research of Ant Colony algorithm and its application in areas such as transportation, telecommunications, chemical industry, electric power, succeeded in solving some combinatorial optimization problems, such as scheduling problems (job-shop Scheduling Problem), the assignment problem (Quadratic Assignment Problem), TSP (Traveling Salesman Problem) and so on.
Click the file on the left to start the preview,please
!The preview only provides 20% of the code snippets, the complete code needs to be downloaded
Report
matlab
算法
tsp
优化
计算
蚁群
问题
旅行
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment