文件名称:蚁群算法
介绍说明－－下载内容均来自于网络，请自行研究使用
求解单旅行商问题的智能算法，蚁群算法。
输入城市间赋权向量（城市间路程），即可输出经过所有城市且总路程最短的最小哈密顿环。(telligent algorithm for solving single traveling salesman problem, ant colony algorithm.
By inputting the weight vector between cities (the distance between cities), the minimum Hamiltonian ring of all cities and the shortest total distance can be output.)
输入城市间赋权向量（城市间路程），即可输出经过所有城市且总路程最短的最小哈密顿环。(telligent algorithm for solving single traveling salesman problem, ant colony algorithm.
By inputting the weight vector between cities (the distance between cities), the minimum Hamiltonian ring of all cities and the shortest total distance can be output.)
相关搜索： ACA
(系统自动生成,下载前可以参看下载内容)
下载文件列表
蚁群算法\ACA.m
蚁群算法\Chap9_citys_data.xlsx
蚁群算法
蚁群算法\Chap9_citys_data.xlsx
蚁群算法