A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem

doi:10.3390/app10186180

CIOMP OpenIR

	A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem
	M. J. Liu; Y. H. Li; Q. Huo; A. Li; M. C. Zhu; N. Qu; L. H. Chen and M. Y. Xia
	2020
发表期刊	Applied Sciences-Basel
卷号	10 期号:18 页码:15
摘要	Featured Application The design of this article can be applied to Travelling Salesman Problem and related problems. In order to solve the problem of poor local optimization of the Slime Mold Algorithm (SMA) in the Travelling Salesman Problem (TSP), a Two-way Parallel Slime Mold Algorithm by Flow and Distance (TPSMA) is proposed in this paper. Firstly, the flow between each path point is calculated by the "critical pipeline and critical culture" model of SMA; then, according to the two indexes of flow and distance, the set of path points to be selected is obtained; finally, the optimization principle with a flow index is improved with two indexes of flow and distance and added random strategy. Hence, a two-way parallel optimization method is realized and the local optimal problem is solved effectively. Through the simulation of Traveling Salesman Problem Library (TSPLIB) on ulysses16, city31, eil51, gr96, and bier127, the results of TPSMA were improved by 24.56, 36.10, 41.88, 49.83, and 52.93%, respectively, compared to SMA. Furthermore, the number of path points is more and the optimization ability of TPSMA is better. At the same time, TPSMA is closer to the current optimal result than other algorithms by multiple sets of tests, and its time complexity is obviously better than others. Therefore, the superiority of TPSMA is adequately proven.
DOI	10.3390/app10186180
URL	查看原文
收录类别	SCI
语种	英语
引用统计
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/64982
专题	中国科学院长春光学精密机械与物理研究所
推荐引用方式 GB/T 7714	M. J. Liu,Y. H. Li,Q. Huo,et al. A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem[J]. Applied Sciences-Basel,2020,10(18):15.
APA	M. J. Liu.,Y. H. Li.,Q. Huo.,A. Li.,M. C. Zhu.,...&L. H. Chen and M. Y. Xia.(2020).A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem.Applied Sciences-Basel,10(18),15.
MLA	M. J. Liu,et al."A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem".Applied Sciences-Basel 10.18(2020):15.

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