文件名称:HolyMoley
介绍说明--下载内容均来自于网络,请自行研究使用
本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法,具有非常广的应用前景,越来越多的人开始学习蚁群算法,因此本软件也有推广前景。
本软件除了用于教学目的外,还可用于解决实际生活中的与TSP(即,旅行商问题)问题相关的问题。
TSP问题描述的是一个旅行商要到几个城市去,每个城市必须去一次且仅能去一次,要求满足这样条件的
最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
-the software used to help computer enthusiasts Ant learning algorithm to do the ant colony algorithm tests. Ant Algorithm as a good new algorithm has a very broad application prospects, more and more people begin to learn ant colony algorithm, the software also promote the prospects. In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues. TSP is a descr iption of the TSP to several cities, each city must go only to one that once such conditions are met the shortest path. Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.
本软件除了用于教学目的外,还可用于解决实际生活中的与TSP(即,旅行商问题)问题相关的问题。
TSP问题描述的是一个旅行商要到几个城市去,每个城市必须去一次且仅能去一次,要求满足这样条件的
最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
-the software used to help computer enthusiasts Ant learning algorithm to do the ant colony algorithm tests. Ant Algorithm as a good new algorithm has a very broad application prospects, more and more people begin to learn ant colony algorithm, the software also promote the prospects. In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues. TSP is a descr iption of the TSP to several cities, each city must go only to one that once such conditions are met the shortest path. Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
HolyMoley.jpx