The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra’s algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.
CITATION STYLE
Neumann, T. (2016). The shortest path problem with uncertain information in transport networks. In Communications in Computer and Information Science (Vol. 640, pp. 475–486). Springer Verlag. https://doi.org/10.1007/978-3-319-49646-7_40
Mendeley helps you to discover research relevant for your work.