Location:
Search - coloring ant
Search list
Description: 关于地图着色问题的蚁群搜索算法，启发式搜索算法的改进-Map Coloring Problem on ant colony search algorithm, heuristic search algorithm to improve
Platform: |
Size: 6144 |
Author: yurongguo |
Hits:
Description: 基于蚁群算法的图的着色问题的研究，毕业论文做的，还是挺好用的-Ant colony algorithm based on graph coloring problem of the studyThesis done, or very good use
Platform: |
Size: 1024 |
Author: chenhui |
Hits:
Description: 蚁群优化算法最初用于解决TSP问题，经过多年的发展，已经陆续渗透到其他领域中，比如图着色问题、大规模集成电路设计、通讯网络中的路由问题以及负载平衡问题、车辆调度问题等。-Ant colony optimization algorithm for solving the TSP problem initially, after years of development, has been gradually penetrate into other areas, such as graph coloring problem, VLSI design, communication network routing problems and load balancing, vehicle scheduling problems .
Platform: |
Size: 2048 |
Author: 天枢 |
Hits:
Description: 蚁群算法是一种群智能算法，也是启发式算法。基本原理来源于自然界蚂蚁觅食的最短路径原理。蚁群算法根据模拟蚂蚁寻找食物的最短路径行为来设计的仿生算法，因此一般而言，蚁群算法用来解决最短路径问题，并真的在旅行商问题（TSP，一个寻找最短路径的问题）上取得了比较好的成效。目前，也已渐渐应用到其他领域中去，在图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类分析等方面都有所应用。(Ant colony algorithm is a population intelligent algorithm, and it is also a heuristic algorithm. The basic principle comes from the shortest path principle of the ant foraging in nature. The ant colony algorithm based on the simulation of ants to find the shortest path algorithm to design the bionic food behavior, so in general, the ant colony algorithm to solve the shortest path problem, and really in the traveling salesman problem (TSP, a search for the shortest path problem) has made good effect. At present, it has gradually applied to other fields, and has been applied in graph coloring, vehicle scheduling, integrated circuit design, communication network, data clustering analysis and so on.)
Platform: |
Size: 145408 |
Author: wyj2277 |
Hits:
Description: 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法，它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点，本算法用来解决最短路径问题，并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intelligence behavior. It has the advantages of strong robustness, excellent distributed computer system, and easy combination with other methods. This algorithm is used to solve the shortest solution. Path problems, and achieved good results on TSP travel business issues. At the same time, it can also be referenced in such areas as image coloring, vehicle scheduling, integrated circuit design, communication networks, and data clustering.)
Platform: |
Size: 1835008 |
Author: 元气满满 |
Hits: