Ant Colony Optimization
340
浏览
0
关注

In computer science and operations research, the ant colony optimization algorithm (ACO) is a probability|probabilistic technique for solving computational problems which can be reduced to finding good paths through graph (mathematics)|graphs. This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their ant colony|colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants.
主要的会议/期刊
演化趋势
Chart will load here
Ant Colony Optimization文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜