The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms. Finally, we concluded the best algorithm for certain environment.
Personality tests are most commonly objective type, where the users rate their behaviour. Instead of providing a single forced choice, they can be provided with more options. A person may not be in general capable to judge his/her behaviour very precisely and categorize it into a single category. Since it is self rating there is a lot of uncertain and indeterminate feelings involved. The results of...
In this paper, the authors propose an extended version of Dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
In this article, we extend the concept of neutrosophic graph-based multicriteria decision making method (NGMCDM) to the case of interval valued neutrosophic graph theory. The new concept is called interval valued neutrosophic graph-based multicriteria decision making method (IVNGMCDM for short). Finally, an illustrative example is given and a comparison analysis is conducted between the proposed approach...
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...
In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate...
The single valued neutrosophic graph is a new version of graph theory presented recently as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued neutrosophic graph (SVN-graph) is used when the relation between nodes (or vertices) in problems are indeterminate. In this paper, we examine the properties of various types of degrees, order and size of single valued neutrosophic...
Fuzzy sets and intuitionistic fuzzy sets can't handle imprecise, indeterminate, inconsistent, and incomplete information. Neutrosophic sets play an important role to overcome this difficulty. A neutrosophic set has a truth membership function, indeterminate membership function, and a falsehood membership functions that can handle all types of ambiguous information. New type of union and intersection...
In this paper, (1) one simplified the standard TOPSIS to new Multi-Criteria Decision-Making (MCDM) called Simplified-TOPSIS. Simplified-TOPSIS gives the same results and simplifies the calculation of the classical TOPSIS. An example is presented distinctions between Simplified-TOPSIS and classical TOPSIS are underlined. (2) extend the new Simplified-TOPSIS method to Neutrosophic-simplified-TOPSIS...
R-unions and R-intersections of T-external (Iexternal, F-external) neutrosophic cubic sets are considered. Examples to show that the R-intersection and R-union of Texternal (I-external, F-external) neutrosophic cubic sets may not be a T-external (I-external, F-external) neutrosophic cubic set are provided. Conditions for the R-union and R-intersection of T-external (I-external, F-external) neutrosophic...
Interval valued bipolar fuzzy weighted neutrosophic set(IVBFWN-set) is a new generalization of fuzzy set, bipolar fuzzy set, neutrosophic set and bipolar neutrosophic set so that it can handle uncertain information more flexibly in the process of decision making. Therefore, in this paper, we propose concept of IVBFWN-set and its operations. Also we give the IVBFWN-set weighted average operator and...
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.