| 一种改进的并行蚁群优化求解算法 |
| |
| 引用本文： | 雷筱珍,赖万钦.一种改进的并行蚁群优化求解算法[J].甘肃联合大学学报(自然科学版),2009,23(1). |
| |
| 作者姓名： | 雷筱珍 赖万钦 |
| |
| 作者单位： | 福建交通职业技术学院,福建,福州,350007 |
| |
| 摘 要： | 为了提高并行蚁群优化算法的求解性能,对ACO算法进行了改进.针对有明显聚类特征的大规模TSP问题,充分利用问题本身所具有的特征,提出了一种带聚类处理的蚁群算法,该算法比较ACS算法可以在更短的时间内找到相同质量的解,而且在相同的运行时间内,该改进算法总能找到最好的解.在VC++环境下进行仿真实验,求解了TSP库中的实例pr136、pr107,分别得到了其最短距离,结果表明了编程思路的正确性及高效性.
|
| 关 键 词： | 蚁群算法 并行优化改进 VC 6.0实现 |
An Improved Parallel Ant Colony Optimization Zlgorithm |
| |
| LEI Xiao-zhen,LAI Wan-qin.An Improved Parallel Ant Colony Optimization Zlgorithm[J].Journal of Gansu Lianhe University :Natural Sciences,2009,23(1). |
| |
| Authors: | LEI Xiao-zhen LAI Wan-qin |
| |
| Institution: | Fujian Communications Technical College;Fuzhou 350007;China |
| |
| Abstract: | In order to impoove the capability of parallel ant colony algorithm(ACA),ACO is improved.To tackle large-scale traveling salesman problem(TSP) with characteristic of clear clustering,a new ACA algorithm is proposed by making full use of the issue itself which has the characteristics.Comparing ACS this improved algorithm cannot only find the same quality of the solution within a shorter period of time but also obtain the best solution within the same time.The simulation in the VC++environment that applied th... |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
