1
School of Computer Science and Engineering, VIT-AP University, Amaravati, Andhra Pradesh 522237, India
(arindam84nit@gmail.com)
2
Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, B.P 7955, Morocco.
(broumisaid78@gmail.com)
3
VIT-AP University, Amaravati, Andhra Pradesh 522237, India
(ranjank.nit52@gmail.com)
4
Department of Computer Science and Engineering, Budge Budge Institute of Technology, Nishchintapur, Budge Budge, Kolkata–700137, West Bengal, India
(jpratihar7974@gmail.com)
Abstract :
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.
Keywords :
DA; Fuzzy Set; Neutrosophic set; SRP
References :
[1] G. allo, and S. Pallottino, Shortest path algorithms, Annals of operations research, vol. 13, pp. 1–79, 1988.
[2] S. Okada, and T. Soper, A shortest path problem on a network with fuzzy arc lengths, Fuzzy Sets and Systems, vol. 109, no. 1, pp. 129–140, 2000.
[3] L. A. Zadeh, Fuzzy sets, Information and control, vol. 3 , pp. 338–353, 1965.
[4] D. Dubois, and H. Parde, Fuzzy sets and systems: Theory and Applications, vol. 144, 1980.
[5] S. Chen, M. Yang, S. Yang, and T. Sheu, and C. Liau, Multicriteria fuzzy decision making based on interval-valued intuitionistic fuzzy sets, Expert Systems with Applications, vol.39, pp. 12085–12091, 2012.
[6] K. T. Atanassov, On intuitionistic fuzzy sets theory, Springer, vol. 283, 2012.
[7] S. Broumi, S. Mohanaselvi, T. Witczak, M. Talea, A. Bakali, F. Smarandache, Complex fermatean neutrosophic graph and application to decision making, Decision Making: Applications in Management and Engineering, vol. 6, pp. 474–501, 2023.
[8] S. Chanas and J. Kamburowski, The fuzzy shortest route problem, Interval and Fuzzy Mathematics, Proc. Polish Symp, Technical University of Poznan, Poznan, pp. 35–41, 1983.
[9] Y. Gao, Shortest path problem with uncertain arc lengths, Computers & Mathematics with Applications, vol. 57, pp. 2591–2600, 2011.
[10] R. Hassanzadeh, I. Mahdavi, Nezam and A. Tajdin, A genetic algorithm for solving fuzzy shortest path problems with mixed fuzzy arc lengths, Mathematical and Computer Modelling, vol. 62, pp. 84–99, 2013.
[11] F. Herrera, V. Herrera, Enrique and J. Verdegay, A sequential selection process in group decision making with a linguistic assessment approach, Information Sciences, vol. 85, pp. 223–239, 1995.
[12] R. Yager, Pythagorean membership grades in multi criteria decision making, IEEE Transactions on fuzzy systems, vol. 22, pp. 958–965, 2013.
[13] F. Smarandache, A unifying field in logics. neutrosophy: Neutrosophic probability, set and logic, American Research Press, Rehoboth, 1999.
[14] T. Senapati, and R. Yager, Fermatean fuzzy sets, Journal of Ambient Intelligence and Humanized Computing, vol. 11, pp. 663–674, 2020.
[15] K. Vidhya, and A. Saraswathi, An improved A search algorithm for the shortest path under intervalvalued Pythagorean fuzzy environment, Granular Computing, vol. 8, pp. 241–251, 2023.
[16] Aydemir, Salih Berkan and Yilmaz Gunduz, Sevcan,Fermatean fuzzy TOPSIS method with Dombi aggregation operators and its application in multi-criteria decision making, Journal of Intelligent & Fuzzy Systems, vol.39, pp. 851–869, 2020.
[17] Okada, Shinkoh, Fuzzy shortest path problems incorporating interactivity among paths, Fuzzy Sets and Systems, vol.142, pp. 335–357, 2004.
[18] Broumi, Said and Sundareswaran, R and Shanmugapriya, M and Bakali, Assia and Talea, Mohamed, Theory and Applications of Fermatean Neutrosophic Graphs, Neutrosophic Sets and Systems,
[19] Ganie, Abdul Haseeb, Multicriteria decision-making based on distance measures and knowledge measures of Fermatean fuzzy sets, Granular Computing, vol.7, pp. 979–998, 2022.
[20] Broumi, Said and Smarandache, Florentin and Talea, Mohamed and Bakali, Assia, An introduction to bipolar single valued neutrosophic graph theory, Applied Mechanics and Materials, vol. 841, pp. 184– 191, 2022.
[21] Anirudh, A and Kannan, R Aravind and Sriganesh, R and Sundareswaran, R and Kumar, S Sampath and Shanmugapriya, M and Broumi, Said, Reliability Measures in Neutrosophic Soft Graphs, Neutrosophic Sets and Systems, vol. 49, pp. 239–252, 2022.
[22] Keshavarz-Ghorabaee, Mehdi and Amiri, Maghsoud and Hashemi-Tabatabaei, Mohammad and Zavadskas, Edmundas Kazimieras and Kaklauskas, Arturas, A new decision-making approach based on Fermatean fuzzy sets and WASPAS for green construction supplier evaluation, Mathematics, vol. 8, pp. 2202, 2020.
[23] Broumi, Said and Sundareswaran, Raman and Shanmugapriya, Marayanagaraj and Singh, Prem Kumar and Voskoglou, Michael and Talea, Mohamed, Faculty performance evaluation through multi-criteria decision analysis using interval-valued fermatean neutrosophic sets, Mathematics, vol. 11, pp. 3817, 2023.
[24] Broumi, Said and Nagarajan, Deivanayagampillai and Lathamaheswari, Malayalan and Talea, Mohamed and Bakali, Assia and Smarandache, Florentin, Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis, CAAI Transactions on Intelligence Technology, vol. 5, pp. 88–93, 2020.
[25] Dey, Arindam and Pal, Anita and Pal, Tandra, Interval type 2 fuzzy set in fuzzy shortest path problem, Mathematics, vol. 4, pp. 62, 2016.
[26] Ebrahimnejad, Ali and Tabatabaei, Somayeh and Santos-Arteaga, Francisco J, A novel lexicographic optimization method for solving shortest path problems with interval-valued triangular fuzzy arc weights, Journal of Intelligent & Fuzzy Systems, vol. 39, pp. 1277–1287, 2020.
[27] Singh, Vishnu Pratap and Sharma, Kirti and Jain, Udit, Solving Fuzzy Shortest Path Problem with Decision Maker’s Perspective, Recent Advancements in Civil Engineering: Select Proceedings of ACE 2020, pp. 645–657, 2022.
[28] Jan, Naeem and Aslam, Muhammad and Ullah, Kifayat and Mahmood, Tahir and Wang, Jun, An approach towards decision making and shortest path problems using the concepts of interval-valued Pythagorean fuzzy information, International Journal of Intelligent Systems, vol. 34, pp. 2403–2428, 2019.
[29] Sweety, C Antony Crispin and Jansi, R, Fermatean Neutrosophic Sets, Int. J. Adv. Res. Comput. Commun. Eng, vol. 10, pp. 24–27, 2021.
[30] Basha, MAsim and Jabarulla, MMohammed and others, Neutrosophic Pythagorean Fuzzy Shortest Path in a Network, Journal of Neutrosophic and Fuzzy Systems, vol. 6, pp. 21–1, 2023.
[31] Sasikala, D and Divya, B, A Newfangled Interpretation on Fermatean Neutrosophic Dombi Fuzzy Graphs, Neutrosophic Systems With Applications, vol. 7, pp. 36–53, 2023.
[32] Mary, Francis Remigius Perpetua and Mohanaselvi, Swaminathan and Broumi, Said, A solution approach to minimum spanning tree problem under fermatean fuzzy environment, Bulletin of Electrical Engineering and Informatics, vol. 12, pp. 1738–1746, 2023.
[33] Broumi, Said and Sundareswaran, Raman and Shanmugapriya, Marayanagaraj and Nordo, Giorgio and Talea, Mohamed and Bakali, Assia and Smarandache, Florentin, Interval-valued fermatean neutrosophic graphs, Collected Papers. Volume XIII: On various scientific topics, pp. 496, 2022.
[34] Raut, Prasanta Kumar and Behera, Siva Prasad and Broumi, Said and Mishra, Debdas, Calculation of shortest path on Fermatean Neutrosophic Networks, Neutrosophic Sets and Systems, vol. 57, pp. 22, 2023.
[35] Kumar, Ranjan and Edaltpanah, SA and Jha, Sripati and Broumi, Said and Dey, Arindam, Neutrosophic Shortest Path Problem, Neutrosophic Sets and Systems vol. 23, pp. 5–15, 2018.
| Style | # |
|---|---|
| MLA | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar. "Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm." International Journal of Neutrosophic Science, Vol. 23, No. 3, 2024 ,PP. 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |
| APA | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar. (2024). Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm. Journal of International Journal of Neutrosophic Science, 23 ( 3 ), 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |
| Chicago | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar. "Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm." Journal of International Journal of Neutrosophic Science, 23 no. 3 (2024): 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |
| Harvard | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar. (2024). Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm. Journal of International Journal of Neutrosophic Science, 23 ( 3 ), 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |
| Vancouver | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar. Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm. Journal of International Journal of Neutrosophic Science, (2024); 23 ( 3 ): 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |
| IEEE | Arindam Dey, Said Broumi, Ranjan Kumar, Jayanta Pratihar, Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm, Journal of International Journal of Neutrosophic Science, Vol. 23 , No. 3 , (2024) : 288-295 (Doi : https://doi.org/10.54216/IJNS.230323) |