Mathematics and Statistics Faculty and Staff Publications

Document Type

Article

Publication Date

2016

Abstract

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

Publication Title

Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne

First Page

1

Last Page

26

DOI

http://doi.org/10.5281/zenodo.888833

Language (ISO)

English

Keywords

Dijkstra’s algorithm; Single valued neutrosophic number; Shortest path problem; Network

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS