- 期刊
The Shortest Path Selection Based on Adaptive Amoeba Algorithm and D Numbers Theory
摘要
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.
延伸閱讀
- Liu, H. H. (1995). An Improved Algorithm for Computing the Network Reliability Based on Path Set Methods. 華岡工程學報, (8), 47-82. https://doi.org/10.29987/CCUHKJE.199503.0004
- Li, M., Zhang, F., & Fang, J. (2021). Optimal Path Solution based on Dijkstra Algorithm. Frontiers in Economics and Management, 2(6), 170-176. https://doi.org/10.6981/FEM.202106_2(6).0030
- Zhang, B., Guan, X., He, C., & Wang, S. (2013). Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance. Journal of Applied Mathematics, 2013(), 531-538-753. https://doi.org/10.1155/2013/847317
- Biswas, S. S., Alam, B., & Doja, M. N. (2013). An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph. Applied Computational Intelligence and Soft Computing, 2013(), 163-167. https://doi.org/10.1155/2013/970197
- Roan, J. (1999). An Optimal Algorithm for Linear Fractional Shortest Path Problem. Pan-Pacific Management Review, 2(2), 285-293. https://doi.org/10.30166/PPMR.199902.0008