Loading

A Novel Approach to Solve Gaussian Valued Neutrosophic Shortest Path Problems
Ranjan Kumar1, S A Edalatpanah2, Sripati Jha3, Ramayan Singh4

1Ranjan Kumar, Mathematics Department, National Institute of Technology, Adityapur, Jamshedpur (Jharkhand), India.
2S A Edalatpanah, Department of Industrial Engineering, Ayandegan Institute of Higher Education, Tonekabon, Iran
3Sripati Jha, Mathematics Department, National Institute of Technology, Adityapur, Jamshedpur (Jharkhand), India.
4Ramayan Singh, Mathematics Department, National Institute of Technology, Adityapur, Jamshedpur (Jharkhand), India.

Manuscript received on 18 February 2019 | Revised Manuscript received on 27 February 2019 | Manuscript published on 28 February 2019 | PP: 347-353 | Volume-8 Issue-3, February 2019 | Retrieval Number: C5899028319/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: We have exhibited a novel method for finding the neutrosophic shortest path problem (NSSPP) consid- ering Gaussian valued Neutrosophic number. We have used linear programming approach for finding the NSS- PP for Gaussian valued Neutrosophic number which is as per best of our information, hasn’t been used till date for any other research work. In this article, we have introdu- ced a novel method which deals Gaussian shaped neutro- sophic problem easily without using any ranking method. We have used this method to solve uncertain network pro-blems to find the shortest path which can help in taking crucial uncertain decisions. Finally, some numerical con- siderations are provided to show the effectiveness of the proposed model.
Keywords: Neutrosophic Fuzzy Numbers; Shortest Path Problem; Gaussian Valued Neutrosophic Number; Network; Programming Method.

Scope of the Article: Problem Solving and Planning