中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A new model for path planning with interval data

文献类型:期刊论文

作者Chen, Xujin; Hu, Jie; Hu, Xiaodong
刊名COMPUTERS & OPERATIONS RESEARCH
出版日期2009-06-01
卷号36期号:6页码:1893-1899
关键词Path planning Minimum risk-sum Interval data
ISSN号0305-0548
DOI10.1016/j.cor.2008.06.002
英文摘要In this paper, we establish a new model for path planning with interval data which arises in a variety of applications. It is formulated as minimum risk-sum path problem: given a source-destination pair in a network G = (V, E), traveling on each link e in G may take time x(e) in a prespecified interval [l(e), u(e)] and take risk (u(e) - x(e))/(u(e) - l(e)), the goal is to find a path in G from the source to the destination, together with an allocation of travel times along each link on the path, so that the total travel time of links on the path is no more than a given time bound and the risk-sum over the links on the path is minimized. Our study shows that this new model has two features that make it different from the existing models. First, the minimum risk-sum path problem is polynomial-time solvable, and second, it provides many solutions that vary with time bounds and risk sums and leaves the choice for decision makers. Therefore, the new model is more flexible and easier to use for the path planning with interval data. (C) 2008 Elsevier Ltd. All rights reserved.
WOS研究方向Computer Science ; Engineering ; Operations Research & Management Science
语种英语
WOS记录号WOS:000262120300019
出版者PERGAMON-ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/7577]  
专题应用数学研究所
通讯作者Chen, Xujin
作者单位Chinese Acad Sci, Inst Appl Math, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Chen, Xujin,Hu, Jie,Hu, Xiaodong. A new model for path planning with interval data[J]. COMPUTERS & OPERATIONS RESEARCH,2009,36(6):1893-1899.
APA Chen, Xujin,Hu, Jie,&Hu, Xiaodong.(2009).A new model for path planning with interval data.COMPUTERS & OPERATIONS RESEARCH,36(6),1893-1899.
MLA Chen, Xujin,et al."A new model for path planning with interval data".COMPUTERS & OPERATIONS RESEARCH 36.6(2009):1893-1899.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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