文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 The Shortest Path Selection Based on Adaptive Amoeba Algorithm and D Numbers Theory
卷期 28:6
作者 Ning-kui WangDai-jun Wei
頁次 038-051
關鍵字 adaptive amoeba algorithmD numbers theoryincompletenessshortest path selectionuncertaintyEIMEDLINEScopus
出刊日期 201712
DOI 10.3966/199115992017122806004

中文摘要

英文摘要

Many methods have been applied to solve the shortest path problem in the transportation system when the evaluation of each period of road is precise. However, in practical applications, the information regarding the road usually changes over time, which results in the variability of traveling time for the same road segment. One critical issue is the quantification of the uncertainty and incompleteness during the information changes. D numbers theory is useful tool to characterize the uncertain and incomplete information. In this paper, we incorporate D numbers theory with adaptive amoeba algorithm to address the route optimization problem in the presence of uncertainty and incompleteness. Two numerical examples of transportation networks are used to illustrate the efficiency of the proposed method.

本卷期文章目次

相關文獻