ACO
于 2016-10-10 发布
文件大小:3KB
0 236
下载积分: 1
下载次数: 9
代码说明：
TSP问题的人工蚁群算法中，假设m只蚂蚁在图的相邻节点间移动，从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定：1、信息素质，也称信息素痕迹。2、可见度，即先验值。(Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem solution. Each ant transition probability is determined by the figure of two kinds of parameters for each edge: 1, the quality of information, also called pheromone trails. 2, visibility, ie priors.)
文件列表：
ACO
...\ACO_TSP.m,6323,2016-09-26
...\DrawRoute.m,271,2016-09-26
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
