QQ客服 官方微博 反馈留言

	A competitive analysis approach for route choice with uncertain travel times and blocked nodes
	Wu, Liyao[1]; Ma, Weimin[2]; Yang, Yan[3]; Wang, Ke[4]
刊名	JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING
	2019
卷号	10页码:345-355
关键词	Route choice Online routing Shortest path problem Uncertain competitive analysis Expected competitive ratio
ISSN号	1868-5137
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2164930
专题	上海大学
作者单位	1.[1]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China. 2.[2]Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China. 3.[3]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China. 4.[4]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China.
推荐引用方式 GB/T 7714	Wu, Liyao[1],Ma, Weimin[2],Yang, Yan[3],et al. A competitive analysis approach for route choice with uncertain travel times and blocked nodes[J]. JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING,2019,10:345-355.
APA	Wu, Liyao[1],Ma, Weimin[2],Yang, Yan[3],&Wang, Ke[4].(2019).A competitive analysis approach for route choice with uncertain travel times and blocked nodes.JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING,10,345-355.
MLA	Wu, Liyao[1],et al."A competitive analysis approach for route choice with uncertain travel times and blocked nodes".JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 10(2019):345-355.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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