A new ranking approach for ordering of single valued triangular neutrosophic numbers

2020 ◽  
Vol 33 (02) ◽  
Author(s):  
K Radhika ◽  
◽  
K Arun Prakash ◽  
V Yamuna ◽  
◽  
...  

Author(s):  
Mohamed Bisher Zeina ◽  
◽  
Omar Zeitouny ◽  
Fatina Masri ◽  
Fatima Kadoura ◽  
...  

In this paper, we present a Maple package called Neutrosophic, which allows users to do operations on trapezoidal and triangular neutrosophic numbers including summation, subtraction, division, and multiplication based on -cuts and plots the results, also the package allows users to rank numbers depending on ambiguity index and value index. This package is very useful in neutrosophic decision-making problems, neutrosophic probabilities, neutrosophic statistics, and in many other fields of neutrosophic researches.



2020 ◽  
pp. 28-35
Author(s):  
Shilpi Pal ◽  
◽  
◽  
Avishek Chakraborty

In this paper, we applied the concept of triangular Neutrosophic number from a special viewpoint. Additionally, we utilized specific varieties of linear triangular Neutrosophic numbers and de-neutrosofication idea which could be very critical for uncertainty concept. Here, an EOQ model has been developed for a linearly dependent demand of non-instantaneous items under shortages. The paper considers holding cost as triangular neutrosophic number (TNN) and optimizes the model. A comparative study is done under crisps and neutrosophic domain and the model gives better result under the later domain. This noble notion will assist us to resolve a plethora of realistic existence problems in neutrosophic area.



2021 ◽  
pp. 559-573
Author(s):  
Gözde Koca ◽  
Ezgi Demir ◽  
Özgür İcan ◽  
Çağlar Karamaşa


2019 ◽  
Vol 11 (1) ◽  
pp. 1
Author(s):  
Florentin Smarandache ◽  
Mohamed Abdel Basset ◽  
Mai Mohamed




Author(s):  
Said Broumi ◽  
Shio Gai Quek ◽  
Ganeshsree Selvachandran ◽  
Florentin Smarandache ◽  
Assia Bakali ◽  
...  

In this chapter, the authors study a kind of network where the edge weights are characterized by single-valued triangular neutrosophic numbers. First, rigorous definitions of nodes, edges, paths, and cycles of such a network were proposed, which are then defined in algebraic terms. Then, characterization on the length of paths in such a network were presented. This is followed by the presentation of an algorithm for finding the shortest path length between two given nodes on the network. The proposed algorithm gives the shortest path length from source node to destination node based on a ranking method that takes both the length of edges and the number of nodes into account. Finally, a numerical example based on a real-life scenario is also presented to illustrate the efficiency and usefulness of the proposed approach.



2017 ◽  
Vol 22 (20) ◽  
pp. 6629-6643 ◽  
Author(s):  
Mohamed Abdel-Basset ◽  
Mai Mohamed ◽  
Abdel-Nasser Hussien ◽  
Arun Kumar Sangaiah


2019 ◽  
Vol 11 (1) ◽  
pp. 1
Author(s):  
Mohamed Abdel Basset ◽  
Mai Mohamed ◽  
Florentin Smarandache




Sign in / Sign up

Export Citation Format

Share Document