International Journal of Neutrosophic Science IJNS 2690-6805 2692-6148 10.54216/IJNS https://www.americaspg.com/journals/show/2530 2020 2020 School of Computer Science and Engineering, VIT-AP University, Amaravati, Andhra Pradesh 522237, India Arindam Arindam Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, B.P 7955, Morocco. Said Broumi VIT-AP University, Amaravati, Andhra Pradesh 522237, India Ranjan Kumar Department of Computer Science and Engineering, Budge Budge Institute of Technology, Nishchintapur, Budge Budge, Kolkata–700137, West Bengal, India Jayanta Pratihar Dijkstra’s algorithm (DA) is a very popular approach for finding the shortest route (SR) in the shortest route problem (SRP). The SRP becomes a challenging and complex problem in real life scenarios. The Fermatean neutrosophic set is a mathematical model that combines Fermatean sets with neutrosophic sets. It can handle the unclear, ambiguous, inconsistent, confusing, and uncertain information that comes from real-world problems. Decision-makers face difficulty accurately determining the precise membership (MG) and non membership levels due to the lack of appropriate data available. The FNS can handle this problem. In this study, we consider the interval FNS to describe the arc weight of a neutrosophic graph (NG). This SRP is called an interval Fermatean neutrosophic shortest route problem (IFNSRP). A modified DA is presented to solve this IFNSRP in an uncertain environment. The effectiveness of the presented method is illustrated with a numerical instance of a neutrosophic network. 2024 2024 288 295 10.54216/IJNS.230323 https://www.americaspg.com/articleinfo/21/show/2530