A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem (vol 8, 202508, 2020)

CIOMP OpenIR

	A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem (vol 8, 202508, 2020)
	M. J. Liu; Y. H. Li; A. Li; Q. Huo; N. Zhang; N. Qu; M. C. Zhu and L. H. Chen
	2021
发表期刊	Ieee Access (IF:3.745[JCR-2019],4.076[5-Year])
ISSN	2169-3536
卷号	9 页码:18549-18549
DOI	10.1109/access.2021.3054491
URL	查看原文
收录类别	SCI
引用统计	被引频次：0 [WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/65636
专题	中国科学院长春光学精密机械与物理研究所
推荐引用方式 GB/T 7714	M. J. Liu,Y. H. Li,A. Li,et al. A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem (vol 8, 202508, 2020)[J]. Ieee Access,2021,9:18549-18549.
APA	M. J. Liu.,Y. H. Li.,A. Li.,Q. Huo.,N. Zhang.,...&M. C. Zhu and L. H. Chen.(2021).A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem (vol 8, 202508, 2020).Ieee Access,9,18549-18549.
MLA	M. J. Liu,et al."A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem (vol 8, 202508, 2020)".Ieee Access 9(2021):18549-18549.