Applying Dijkstra algorithm for solving neutrosophic shortest path problem

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,...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Advanced Mechatronic Systems pp. 412 - 416
Main Authors Broumi, Said, Bakal, Assia, Talea, Mohamed, Smarandache, Florentin, Vladareanu, Luige
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2016
Subjects
Dijkstra's algorithm
Fuzzy sets
Information processing
Joining processes
Network
Shortest path problem
Single valued neutrosophic number
Terminology
Transportation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2325-0690
DOI:10.1109/ICAMechS.2016.7813483