site stats

Shortest path in neutrosophic environment

SpletShortest path problem using Bellman algorithm under neutrosophic environment Florentin Smarandache An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in … SpletThe subsequent integer valued neutrosophic shortest path (IVNSSP) issue is changed over into a multi objec-tive linear programming (MOLP) issue. At that point, a lexicographic methodology is utilized to acquire the productive ar- ... MOLP under neutrosophic environment .Therefore, there is a need to establish a neutrosophic version multi

Shortest path problem in fuzzy, intuitionistic fuzzy and …

SpletIn 2010, Gani also established MST problem in a bipolar neutrosophic environment. a technique to identify intuitionistic fuzzy shortest path Mullai et al. solved SPP by minimal spanning tree (MST) (IFSP) for a given … Splet30. mar. 2024 · In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosphic number using score … southwest airlines start alcohol flights https://ventunesimopiano.com

Hub-and-spoke network design for container shipping in inland …

Splet25. dec. 2024 · In this paper, a novel method is proposed to find the shortest path problem (SPPr) in the interval-valued neutrosophic environment, where the uncertain/indeterminate data is expressed as three independent variables i.e., truth membership, indeterminate membership, and false membership. To validate the proposed method, a hypothetical … SpletThe neutrosophic shortest path (NSP) remains the same, namely 1 → 2 → 5 → 6, but the neutrosophic shortest path length (NSPL) differs, namely respectively. From here we come to the conclusion that there exists no unique method for comparing neutrosophic numbers and different methods may satisfy different desirable criteria. Splet25. dec. 2024 · In this paper, a novel method is proposed to find the shortest path problem (SPPr) in the interval-valued neutrosophic environment, where the … team blue shirt

Research on the Shortest Path Solution Method of Interval Valued ...

Category:computing minimum spanning tree in interval valued bipolar …

Tags:Shortest path in neutrosophic environment

Shortest path in neutrosophic environment

Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy …

Splet06. nov. 2024 · The shortest path problem is a well-known combinatorial optimisation problem in the field of graph theory due to its various applications. Uncertainty is present … Splet04. jan. 2024 · The problem of finding the minimum spanning tree (MST) is one of the most studied and important combinatorial optimisation problems in graph theory. Several …

Shortest path in neutrosophic environment

Did you know?

SpletNew Theories in neutrosophic theory focusing on algorithm for decision making data mining, e-learning, topolagy and more. Broumi Said [10] in 2024 introduced the shortest path problem (SPP) in neutrsophic graph and introduced the algorithm to solve SPP under Neutrosophic environment. 2 Preliminaries SpletThe subsequent integer valued neutrosophic shortest path (IVNSSP) issue is changed over into a multi objec-tive linear programming (MOLP) issue. At that point, a lexicographic …

http://www.americaspg.com/articlesvoulume/21 SpletAbstract. The transportation problem (TP) is popular in operation research due to its versatile applications in real life. Uncertainty exists in most of the real-life problems, …

Splet04. jan. 2024 · The neutrosophic set is an efficient tool to model and deal with the uncertainties in information due to inconsistent and indeterminate. In this study, the authors use triangular neutrosophic numbers to represent the edge weights of a neutrosophic graph for the MST problem in the neutrosophic environment. SpletThe authors present a new algorithm for solving the shortest path problem (SPP) in a mixed fuzzy environment. With this algorithm, the authors can solve the problems with different sets of fuzzy numbers e.g., normal, trapezoidal, triangular, and LR …

SpletHere we consider a problem in PNN environment to compute the shortest path in a very simple way. Shortest path Search Algorithm is one of the best and popular skills used in …

SpletFurther when the information about the path is indetermined, uncertain and unreliable, neutrosophic concept has been implemented and obtained the solution for neutrosophic … southwest airlines special credit card offersSpletTherefore, in this study, a novel-integrated solution method based on Neutrosophic Criteria Importance Through Inter-Criteria Correlation (N-CRITIC) and Neutrosophic Additive Ratio ASsessment (N-ARAS) methods is developed for the MCDM problems by integrating Single-Valued Neutrosophic Numbers (SVNNs) into CRITIC and ARAS methods. southwest airlines special pricesSpletthis day, only a few papers dealing with shortest path problem in neutrosophic environment. The paper proposed by Broumi et al. is one of the first on this subject. The … southwest airlines standby tickets