QQ客服 官方微博 反馈留言

	Multiple Traveling Salesman Problem with precedence constraints based on modified Dynamic Tabu Artificial Bee Colony algorithm
	Zhong, Wenqi[1]; Shan, Huifeng[1]; Chen, Ziyue[2]; Xia, Linyi[1]
	2014
卷号	11期号:4页码:1225
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4639758
专题	暨南大学
作者单位	1.[1] Electrical and Information School, Jinan University, Jinan 519070, China 2.[2] International Business School, Jinan University, Jinan 519070, China
推荐引用方式 GB/T 7714	Zhong, Wenqi[1],Shan, Huifeng[1],Chen, Ziyue[2],et al. Multiple Traveling Salesman Problem with precedence constraints based on modified Dynamic Tabu Artificial Bee Colony algorithm[J],2014,11(4):1225.
APA	Zhong, Wenqi[1],Shan, Huifeng[1],Chen, Ziyue[2],&Xia, Linyi[1].(2014).Multiple Traveling Salesman Problem with precedence constraints based on modified Dynamic Tabu Artificial Bee Colony algorithm.,11(4),1225.
MLA	Zhong, Wenqi[1],et al."Multiple Traveling Salesman Problem with precedence constraints based on modified Dynamic Tabu Artificial Bee Colony algorithm".11.4(2014):1225.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。