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 …

Many organizations are currently seeking to contract services from cloud computing rather
than owing the possessions to supply those services. Due to the fast expansion of cloud …

The most widely used technique for solving and optimizing a real-life problem is linear
programming (LP), due to its simplicity and efficiency. However, in order to handle the …

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It
has been demonstrated to deal indeterminacy in a decision-making problem. Real-world …

Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path
problem (SPP). This paper introduces the SPP from a source node to a destination node on …

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 …

The transportation problem has been widely studied in the field of supply chain
management where circulation of products with a minimal transportation cost is an important …

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 …

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, which cause it …

Travelling salesman problem (TSP) is a prominent computational problem where trail
technique is used to calculate all the possible travel and choose the best one. Since there is …