Volume 27 • Issue 2 • PP: 223-234 • 2026
Neutrosophic Approach in Route-Optimization of Traveling Salesman Problems
View PDF Abstract
The Travelling Salesman Problem (TSP) possesses a significant challenge in optimization, complicated by real-world uncertainties such as fluctuating traffic conditions, weather variability and inconsistent travel durations. Traditional mathematical formulation fails to adequately incorporate these uncertainties, thus limiting their effectiveness. This paper introduces a modified approach to solving the TSP by employing Single-Valued Triangular Neutrosophic Sets (SVTNS), which effectively manages the indeterminate and ambiguous data. The proposed methodology to transform the neutrosophic fuzzy data into crisp numbers using a specifically modified score function. A stepwise procedure is introduced, encompassing crisp conversion, range evaluation and iterative optimization processes to attain an optimal and practically viable solution. The proposed methodology is validated through numerical computation to demonstrate its efficiency in determining the minimal crisp travelling costs and optimizing travelling schedules under the various weighting scenarios. This research advances the applicability of neutrosophic sets in decision-making to provide a reliable framework to address the uncertainties inherent in practical travelling Salesman issues.
Keywords
References
[1] L. A. Zadeh, "Fuzzy sets," Inf. Control, vol. 8, no. 3, pp. 338–353, 1965, doi: 10.1016/S0019-9958(65)90241-X.
[2] K. T. Atanassov, "Intuitionistic fuzzy sets," Fuzzy Sets Syst., vol. 20, no. 1, pp. 87–96, 1986, doi: 10.1016/S0165-0114(86)80034-3.
[3] F. Smarandache, "Neutrosophic set—a generalization of the intuitionistic fuzzy set," Int. J. Pure Appl. Math., vol. 24, no. 3, pp. 287–297, 2005. [Online]. Available: https://ijpam.eu/contents/2005-24-3/1/1.pdf
[4] M. M. Ismail et al., "Magnetic optimization algorithm approach for travelling salesman problem," World Acad. Sci., Eng. Technol., vol. 62, pp. 1393–1397, 2012. [Online]. Available: https://www.academia.edu/27356966/
[5] Deli and Y. Subas, "Single valued neutrosophic numbers and their applications to multicriteria decision making problem," Neutrosophic Sets Syst., vol. 2, no. 1, pp. 1–13, 2014. [Online]. Available: https://fs.unm.edu/SN/Neutro-SingleValuedNeutroNumbers.pdf
[6] P. Biswas, S. Pramanik, and B. C. Giri, "Value and ambiguity index based ranking method of single-valued trapezoidal neutrosophic numbers and its application to multi-attribute decision making," Neutrosophic Sets Syst., vol. 12, no. 1, pp. 127–138, 2016. [Online]. Available: https://digitalrepository.unm.edu/nss_journal/vol12/iss1/17/
[7] N. Agatz, P. Bouman, and M. Schmidt, "Optimization approaches for the traveling salesman problem with drone," ERIM Rep. Ser. Ref. No. ERS-2015-011-LIS, 2016. [Online]. Available: http://dx.doi.org/10.2139/ssrn.2639672
[8] J. Chen, F. Ye, and Y. Li, "Travelling salesman problem for UAV path planning with two parallel optimization algorithms," in Proc. PIERS-FALL, 2017, pp. 832–837, doi: 10.1109/PIERS-FALL.2017.8293250.
[9] S. K. Prabha and S. Vimala, "Neutrosophic assignment problem via BnB algorithm," in Advances in Algebra and Analysis. Springer, 2018, pp. 323–330, doi: 10.1007/978-3-030-01120-8_37.
[10] Chakraborty et al., "Different forms of triangular neutrosophic numbers, de-neutrosophication techniques, and their applications," Symmetry, vol. 10, no. 8, p. 327, 2018, doi: 10.3390/sym10080327.
[11] S. Subasri and K. Selvakumari, "Neutrosophic travelling salesman problem in trapezoidal fuzzy number using branch and bound technique," J. Phys., Conf. Ser., vol. 1362, no. 1, p. 012098, 2019, doi: 10.1088/1742-6596/1362/1/012098.
[12] Dey et al., "A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs," Granular Comput., vol. 4, pp. 63–69, 2019, doi: 10.1007/s41066-018-0084-7.
[13] J. Fan, X. Jia, and M. Wu, "A new multi-criteria group decision model based on single-valued triangular neutrosophic sets and EDAS method," J. Intell. Fuzzy Syst., vol. 38, no. 2, pp. 2089–2102, 2020, doi: 10.3233/JIFS-190811.
[14] H. A. E. W. Khalifa, P. Kumar, and F. Smarandache, "On optimizing neutrosophic complex programming using lexicographic order," Infinite Study, 2020, doi: 10.5281/zenodo.3723173.
[15] V. Jangid and G. Kumar, "Matrix games with single-valued triangular neutrosophic numbers as pay-offs," Neutrosophic Sets Syst., vol. 45, no. 1, p. 14, 2021. [Online]. Available: https://digitalrepository.unm.edu/cgi/viewcontent.cgi?article=1915&context=nss_journal
[16] E. Çakir, Z. Ulukan, and T. Acarman, "Shortest fuzzy Hamiltonian cycle on transportation network using minimum vertex degree and time-dependent Dijkstra’s algorithm," IFAC-PapersOnLine, vol. 54, no. 2, pp. 348–353, 2021, doi: 10.1016/j.ifacol.2021.06.048.
[17] M. R. Seikh and S. Dutta, "Solution of matrix games with payoffs of single-valued trapezoidal neutrosophic numbers," Soft Comput., vol. 26, no. 3, pp. 921–936, 2022, doi: 10.1007/s00500-021-06559-7.
[18] Rajkumar and A. S. Richard, "A novel approach to solve the replacement problem using MATLAB programming in neutrosophic environment," in AIP Conf. Proc., vol. 2529, no. 1, 2022, doi: 10.1063/5.0103739.
[19] Karasan et al., "Customer-oriented product design using an integrated neutrosophic AHP & DEMATEL & QFD methodology," Appl. Soft Comput., vol. 118, p. 108445, 2022, doi: 10.1016/j.asoc.2022.108445.
[20] V. Nayagam, "A total order on single valued and interval valued neutrosophic triplets," Neutrosophic Sets Syst., vol. 55, no. 1, p. 23, 2023. [Online]. Available: https://digitalrepository.unm.edu/cgi/viewcontent.cgi?article=2301&context=nss_journal
[21] S. Sinika and G. Ramesh, "Effectiveness of new interval arithmetic operations in interval-valued neutrosophic assignment problem," in AIP Conf. Proc., vol. 2852, no. 1, 2023, doi: 10.1063/5.0164620.
[22] P. K. Raut et al., "Calculation of shortest path on Fermatean neutrosophic networks," Neutrosophic Sets Syst., vol. 57, no. 1, p. 22, 2023. [Online]. Available: https://fs.unm.edu/NSS/ShortestPathNeutrosophic22.pdf
[23] S. Srinivas and K. Prabakaran, "Optimization of single-valued triangular neutrosophic fuzzy travelling salesman problem," Neutrosophic Sets Syst., vol. 60, p. 366, 2023. [Online]. Available: https://digitalrepository.unm.edu/cgi/viewcontent.cgi?article=2468&context=nss_journal
[24] R. Mishra et al., "Assessing the sustainable energy storage technologies using single-valued neutrosophic decision-making framework with divergence measure," Expert Syst. Appl., vol. 238, p. 121791, 2024, doi: 10.1016/j.eswa.2023.121791.
[25] L. P. Mathew, L. Sebastian, and B. Thankachan, "Some operations on trapezoidal single valued neutrosophic fuzzy numbers," Int. J. Neutrosophic Sci., vol. 23, no. 3, 2024. [Online]. Available: https://americaspg.com/article/pdf/2459
[26] S. Dhouib, S. Broumi, and M. Talea, "Solving the minimum spanning tree problem under interval-valued Fermatean neutrosophic domain," Neutrosophic Sets Syst., vol. 67, no. 1, p. 2, 2024. [Online]. Available: https://fs.unm.edu/nss8/index.php/111/article/view/4422
[27] J. Jiang et al., "An adaptive neutrosophic large neighborhood search and its application," Neutrosophic Sets Syst., vol. 70, no. 1, p. 2, 2024. [Online]. Available: https://digitalrepository.unm.edu/nss_journal/vol70/iss1/2
[28] N. Kausar and M. Palanikumar, "Finding new similarities measures for Type-II Diophantine neutrosophic interval valued soft sets and its basic operations," Int. J. Neutrosophic Sci., vol. 1, p. 505, 2025. [Online]. Available: https://www.americaspg.com/article/pdf/3075
[29] W. Yang et al., "Triangular single valued neutrosophic data envelopment analysis: application to hospital performance measurement," Symmetry, vol. 12, no. 4, p. 588, 2020, doi: 10.3390/sym12040588.
[30] Almutairi, H. A. E. W. Khalifa, and B. E. El-Demerdash, "Incorporating neutrosophic uncertainty in data envelopment analysis," Neutrosophic Sets Syst., vol. 76, pp. 241–252, 2025. [Online]. Available: https://fs.unm.edu/nss8/index.php/111/article/view/5177
Cite This Article
Choose your preferred format