A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem

doi:10.1109/access.2020.3035584

CIOMP OpenIR

	A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem
	M. J. Liu,Y. H. Li,A. Li,Q. Huo,N. Zhang,N. Qu,M. C. Zhu and L. H. Chen
	2020
发表期刊	Ieee Access
ISSN	2169-3536
卷号	8 页码:202508-202521
摘要	The Ant Colony Optimization (ACO) is easy to fall into the local optimum and its convergence speed is slow in solving the Travelling Salesman Problem (TSP). Therefore, a Slime Mold-Ant Colony Fusion Algorithm (SMACFA) is proposed in this paper. Firstly, an optimized path is obtained by Slime Mold Algorithm (SMA) for TSP; Then, the high-quality pipelines are selected from the path which is obtained by SMA, and the two ends of the pipelines are as fixed-point pairs; Finally, the fixed-point pairs are directly applied to the ACO by the principle of fixed selection. Hence, the SMACFA with fixed selection of high-quality pipelines is obtained. Through the test of the chn31 in Traveling Salesman Problem Library (TSPLIB), the result of path length was 15381 by SMACFA, and it was improved by 1.42% than ACO. The convergence speed and algorithm time complexity were reduced by 73.55 and 80.25% respectively. What's more, under the ten data sets of TSPLIB, SMACFA outperformed other algorithms in terms of the path length, convergence speed and algorithm time complexity by comparison experiments. It is fully verified that the performances of SMACFA is superior to others in solving TSP.
DOI	10.1109/access.2020.3035584
URL	查看原文
收录类别	SCI ; EI
语种	英语
引用统计
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/64892
专题	中国科学院长春光学精密机械与物理研究所
推荐引用方式 GB/T 7714	M. J. Liu,Y. H. Li,A. Li,Q. Huo,N. Zhang,N. Qu,M. C. Zhu and L. H. Chen. A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem[J]. Ieee Access,2020,8:202508-202521.
APA	M. J. Liu,Y. H. Li,A. Li,Q. Huo,N. Zhang,N. Qu,M. C. Zhu and L. H. Chen.(2020).A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem.Ieee Access,8,202508-202521.
MLA	M. J. Liu,Y. H. Li,A. Li,Q. Huo,N. Zhang,N. Qu,M. C. Zhu and L. H. Chen."A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem".Ieee Access 8(2020):202508-202521.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Liu-2020-A Slime Mol（3342KB）	期刊论文	出版稿	开放获取	CC BY-NC-SA	浏览下载