The aim of each company/industry is to provide a final product to customers at the minimum possible cost, as well as to protect the environment from degradation. Ensuring the shortest travel distance between involved locations plays an important role in achieving the company’s/industry’s objective as (i) the cost of a final product can be minimized by minimizing the total distance travelled (ii) finding the shortest distance between involved locations will require less fuel than the longest distance between involved locations. This will eventually result in lesser degradation of the environment. Hence, in the last few years, various algorithms have been proposed to solve different types of shortest path problems. A recently proposed algorithm for solving interval-valued Pythagorean fuzzy shortest path problems requires excessive computational efforts. Hence, to reduce the computational efforts, in this paper, firstly, an alternative lexicographic method is proposed for comparing interval-valued Pythagorean fuzzy numbers. Then, using the proposed lexicographic comparing method, a new approach (named as Mehar approach) is proposed to solve interval-valued Pythagorean fuzzy shortest path problems. Furthermore, the superiority of the proposed lexicographic comparing method, as well as the proposed Mehar approach, is discussed.
Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm
