Interval Valued Neutrosophic Linear Programming with Trapezoidal Numbers
Interval Valued Neutrosophic Linear Programming with Trapezoidal Numbers

Author: Stephy Stephen

Publisher: Infinite Study

Published:

Total Pages: 10

ISBN-13:

DOWNLOAD EBOOK

In the real world problems, we are always dealing with uncertainty in almost all fields of approach. Neutrosophic sets helps us to deal with problems where inconsistent data are available. Application of Neutrosophic sets to real world problems, which are the generalized form of fuzzy sets is a platform where we can overcome this concept of uncertainty and obtain optimal results which can be relied on. In this paper, interval valued neutrosophic numbers are used to take into account the uncertainty in a still deeper way and Interval valued neutrosophic linear programming problem is solved with the help of the proposed ranking function and optimal results are obtained.

A New Method for Solving Interval Neutrosophic Linear Programming Problems
A New Method for Solving Interval Neutrosophic Linear Programming Problems

Author: Amir Hossein Nafei

Publisher: Infinite Study

Published:

Total Pages: 18

ISBN-13:

DOWNLOAD EBOOK

Because of uncertainty in the real-world problems, achieving to the optimal solution is always time consuming and even sometimes impossible. In order to overcome this drawback the neutrosophic sets theory which is a generalization of the fuzzy sets theory is presented that can handle not only incomplete information but also indeterminate and inconsistent information which is common in real-world situations.

Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm
Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

Author: S. Krishna Prabha

Publisher: Infinite Study

Published: 2020-10-01

Total Pages: 9

ISBN-13:

DOWNLOAD EBOOK

Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.

Solving fully neutrosophic linear programming problem with application to stock portfolio selection
Solving fully neutrosophic linear programming problem with application to stock portfolio selection

Author: Hamiden Abd El-Wahed Khalifa

Publisher: Infinite Study

Published:

Total Pages: 13

ISBN-13:

DOWNLOAD EBOOK

Neutrosophic set is considered as a generalized of crisp set, fuzzy set, and intuitionistic fuzzy set for representing the uncertainty, inconsistency, and incomplete knowledge about the real world problems. In this paper, a neutrosophic linear programming (NLP) problem with single-valued trapezoidal neutrosophic numbers is formulated and solved. A new method based on the so-called score function to find the neutrosophic optimal solution of fully neutrosophic linear programming (FNLP) problem is proposed.

A novel method for solving the fully neutrosophic linear programming problems
A novel method for solving the fully neutrosophic linear programming problems

Author: Mohamed Abdel-Basset

Publisher: Infinite Study

Published:

Total Pages: 11

ISBN-13:

DOWNLOAD EBOOK

The most widely used technique for solving and optimizing a real-life problem is linear programming (LP), due to its implicity and efficiency. However, in order to handle the impreciseness in the data, the neutrosophic set theory plays a vital role which makes a simulation of the decision-making process of humans by considering all aspects of decision (i.e., agree, not sure and disagree).

International Journal of Neutrosophic Science (IJNS) Volume 11, 2020
International Journal of Neutrosophic Science (IJNS) Volume 11, 2020

Author: Broumi Said

Publisher: Infinite Study

Published:

Total Pages: 114

ISBN-13:

DOWNLOAD EBOOK

International Journal of Neutrosophic Science (IJNS) is a peer-review journal publishing high quality experimental and theoretical research in all areas of Neutrosophic and its Applications. Papers concern with neutrosophic logic and mathematical structures in the neutrosophic setting. Besides providing emphasis on topics like artificial intelligence, pattern recognition, image processing, robotics, decision making, data analysis, data mining, applications of neutrosophic mathematical theories contributions to economics, finance, management, industries, electronics, and communications are promoted.

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Author: Said Broumi

Publisher: Infinite Study

Published:

Total Pages: 14

ISBN-13:

DOWNLOAD EBOOK

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.

A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems
A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems

Author: Ranjan Kumar

Publisher: Infinite Study

Published:

Total Pages: 16

ISBN-13:

DOWNLOAD EBOOK

Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely different applications in real world eventualities. However, the uncertainty related to the inconsistent information and indeterminate information isn't properly expressed by fuzzy set.

A Novel Method for Neutrosophic Assignment Problem by using Interval-Valued Trapezoidal Neutrosophic Number
A Novel Method for Neutrosophic Assignment Problem by using Interval-Valued Trapezoidal Neutrosophic Number

Author: Hamiden Abd El-Wahed Khalifa

Publisher: Infinite Study

Published: 2020-10-01

Total Pages: 13

ISBN-13:

DOWNLOAD EBOOK

Assignment problem (AP) is well- studied and important area in optimization. In this research manuscript, an assignment problem in neutrosophic environment, called as neutrosophic assignment problem (NAP), is introduced. The problem is proposed by using the interval-valued trapezoidal neutrosophic numbers in the elements of cost matrix. As per the concept of score function, the interval-valued trapezoidal neutrosophic assignment problem (IVTNAP) is transformed to the corresponding an interval-valued AP. To optimize the objective function in interval form, we use the order relations. These relations are the representations of choices of decision maker. The maximization (or minimization) model with objective function in interval form is changed to multi- objective based on order relations introduced by the decision makers' preference in case of interval profits (or costs). In the last, we solve a numerical example to support the proposed solution methodology.

Operators on Single Valued Trapezoidal Neutrosophic Numbers and SVTN-Group Decision Making
Operators on Single Valued Trapezoidal Neutrosophic Numbers and SVTN-Group Decision Making

Author: Irfan Deli

Publisher: Infinite Study

Published:

Total Pages: 20

ISBN-13:

DOWNLOAD EBOOK

In this paper, we first introduce single valued trapezoidal neutrosophic (SVTN) numbers with their properties. We then define some operations and distances of the SVTN-numbers. Based on these new operations, we also define some aggregation operators, including SVTN-ordered weighted geometric operator, SVTN-hybrid geometric operator, SVTN-ordered weighted arithmetic operator and SVTN-hybrid arithmetic operator. We then examine the properties of these SVTN-information aggregation operators. By using the SVTN-weighted geometric operator and SVTN-hybrid geometric operator, we also define a multi attribute group decision making method, called SVTN-group decision making method. We finally give an illustrative example and comparative analysis to verify the developed method and to demonstrate its practicality and effectiveness.