Reliability theory model and expected life shortest path in stochastic and time-dependent networks | |
Tan, GZ; Xia, XF; Gao, W | |
刊名 | COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS |
2003 | |
卷号 | 2660页码:829-838 |
ISSN号 | 0302-9743 |
英文摘要 | We consider the priori expected shortest path problem from a single origin to a single destination for each departure time in stochastic and time-dependent networks. Such problem requires more than standard shortest path techniques. First, we transform this problem into the problem of systemic reliability, and identify a weaker consistent reliability condition that insures the validity of generalized dynamic-programming method based on reliability priority. Furthermore, we propose a new dominance discriminance, which makes the parameter in traditional discriminance drop from two dimensions to one dimension and reduces the possibility of not doing dominance compare among paths. Finally, we present the expected life shortest path algorithm. |
WOS研究方向 | Computer Science |
语种 | 英语 |
出版者 | SPRINGER-VERLAG BERLIN |
WOS记录号 | WOS:000184832100085 |
内容类型 | 期刊论文 |
源URL | [http://119.78.100.204/handle/2XEOYT63/13715] |
专题 | 中国科学院计算技术研究所期刊论文_英文 |
通讯作者 | Tan, GZ |
作者单位 | 1.Dalian Univ Technol, Dept Comp Sci & Engn, Dalian 116024, Peoples R China 2.Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Tan, GZ,Xia, XF,Gao, W. Reliability theory model and expected life shortest path in stochastic and time-dependent networks[J]. COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS,2003,2660:829-838. |
APA | Tan, GZ,Xia, XF,&Gao, W.(2003).Reliability theory model and expected life shortest path in stochastic and time-dependent networks.COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS,2660,829-838. |
MLA | Tan, GZ,et al."Reliability theory model and expected life shortest path in stochastic and time-dependent networks".COMPUTATIONAL SCIENCE - ICCS 2003, PT IV, PROCEEDINGS 2660(2003):829-838. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论