Optimization of Travelling Salesman Problem on Single Valued Triangular Neutrosophic Number using Dhouib-Matrix-TSP1 Heuristic

Document Type : Original Article


Department of Industrial Management, Higher Institute of Industrial Management, University of fax, Tunisia


The Travelling Salesman Problem is one of the fundamental operational research problems where the objective is to generate the cheapest route for a salesman starting from a given city, visiting all the other cities only once and finally returning to the starting city.
In this paper, we study the Travelling Salesman Problem in uncertain environment. Particularly, the single valued triangular neutrosophic environment is considered viewing that it is more realistic and general in real-world industrial problems. Each element in the distance matrix of the Travelling Salesman Problem is presented as a single valued triangular neutrosophic number. To solve this problem, we enhance our novel column-row heuristic Dhouib-Matrix-TSP1 by the means of the center of gravity ranking function and the standard deviation metric. In fact, the center of gravity ranking function is applied for defuzzification in order to convert the single valued triangular neutrosophic number to crisp number.
A stepwise application of several numerical Travelling Salesman Problems on the single valued triangular neutrosophic environment shows that the optimal or a near optimal solution can be easily reached thanks to the Dhouib-Matrix-TSP1 heuristic enriched with the center of gravity ranking function and the standard deviation metric.


  1. Smarandache F., "A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics", Infinite Study, (2005), DOI: 10.5281/zenodo.8792.
  2. Ibrahem A. N., Elghareeb H., Farahat F. F. and AboElfotouh A., "Comparative Mathematical Model for Predicting of Financial Loans Default using Altman Z-Score and Neutrosophic AHP Methods", Neutrosophic Sets and Systems, Vol. 43, (2021), DOI: 10.5281/zenodo.4914802.
  3. Khalifa Abd El-Wahed H. and Kumar P., "A Novel Method for Solving Assignment Problem by Using Interval-Valued Trapezoidal Neutrosophic Number”, Neutrosophic Sets and Systems, Vol. 36, (2020), 24-36, DOI: 10.5281/zenodo.4065363.
  4. Hamiden Khalifa, "An Approach to The Optimization of Multi-Objective Assignment Problems with Neutrosophic Numbers", International Journal of Industrial Engineering & Production Research, Vol. 31, No. 2, (2020), 287-294, DOI: 10.22068/ijiepr.31.2.287.
  5. Prabha K. S. and Vimala S., "Neutrosophic Assignment Problem via BnB Algorithm", Advances in Algebra and Analysis, Trends in Mathematics, (2019), 323-330, DOI: 10.1007/978-3-030-01120-8_37.
  6. Chakraborty A., Broumi S. and Singh K. P., "Some properties of Pentagonal Neutrosophic Numbers and its Applications in Transportation Problem Environment", Neutrosophic Sets and Systems, Vol. 28, (2019), 200-215, DOI: 10.5281/zenodo.3382542.
  7. Subasri S. and Selvakumari K., "Neutrosophic Travelling Salesman Problem in Trapezoidal Fuzzy number using Branch and Bound Technique", Journal of Physics: Conference Series, (2019), DOI:10.1088/1742-6596/1362/1/012098.
  8. Subasri S. and Selvakumari K., "Solving Neutrosophic Travelling Salesaman Problem in Triangular Fuzzy Number Using Ones Assignment Method", Eurasian Journal of Analytical Chemistry, Vol. 13, (2018), 285-291, DOI: 10.5281/zenodo.3133798.
  9. Abbasi M. and Rafiee M., “Efficient Parallelization of a Genetic Algorithm Solution on the Traveling Salesman Problem with Multi-core and Many-core Systems”, International Journal of Engineering, Transactions A: Basics, 33, No. 7, (2020), 1257-1265, DOI: 10.5829/ije.2020.33.07a.12.
  10. Dhouib S., "A New Column-Row Method for Traveling Salesman Problem: The Dhouib-Matrix-TSP1", International Journal of Recent Engineering Science, Vol. 8, No. 1, (2021), 6-10, DOI: 10.14445/23497157/IJRES-V8I1P102.
  11. Deli I., and Şubaş Y., “A ranking method of single valued neutrosophic numbers and its applications to multi-attribute decision making problems”, International Journal of Machine Learning and Cybernetics, 8, (2017), 1309-1322, DOI: 10.1007/s13042-016-0505-3.
  12. Wang H., Smarandache F., Zhang Y. and Sunderraman R., “Single valued neutrosophic sets”, Technical Sciences and Applied Mathematics, Vol. 4, (2010), 10-14, DOI: 10.1007/s13042-016-0505-3.
  13. Dhouib Sa. and Dhouib S., "Optimizing the Trapezoidal Fuzzy Travelling Salesman Problem Through Dhouib-Matrix-TSP1 Method Based on Magnitude Technique", International Journal of Scientific Research in Mathematical and Statistical Sciences, 8, No. 2, (2021), 1-4, DOI: 10.26438/ijsrmss/v8i2.14.
  14. Miledi M., Dhouib S. and Loukil T., "Dhouib-Matrix-TSP1 Method to Optimize Octagonal Fuzzy Travelling Salesman Problem Using α-Cut Technique", International Journal of Computer and Information Technology, Vol. 10, No. 3, (2021), 130-133, DOI: 10.24203/ijcit.v10i3.105.
  15. Dhouib S., "Minimizing the Total Distance for the Supply Chain Problem Using Dhouib-Matrix-TSP2 Method", International Journal of Advanced Research in Engineering and Technology, V 12, No. 5, (2021), 1-12, DOI: 10.34218/IJARET.12.5.2021.001.
  16. Dhouib S., "A Novel Heuristic for the Transportation Problem: Dhouib-Matrix-TP1", International Journal of Recent Engineering Science, 8, No. 4, (2021), 1-5, DOI: 10.14445/23497157/IJRES-V8I4P101.
  17. Broumi S., Nagarajan D., Bakali A., Talea M., Smarandache F. and Lathamaheswari M., "The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment", Complex & Intelligent Systems, 5, (2019), 391-402, DOI: 10.1007/s40747-019-0092-5.
  18. Habibia M., Broumandnia A. and Harounabadic A., "Improvement of Multi-agent Routing Guidance with an Intelligent Traffic Light Scheduling and the Ability to Select Intermediate Destinations", International Journal of Engineering, Transactions A: Basics, 34, No. 4, (2021), 854-862, DOI: 10.5829/ije.2021.34.04a.11.
  19. Dhouib S., Kouraichi S., Loukil T. and Chabchoub H., “An Interactive Simulated Annealing Multi-agents platform to solve Hierarchical Scheduling Problems with Goals”, Studies in Computational Intelligence: Springer-Verlag, Vol. 236, (2009), 177-187, DOI: 10.1007/978-3-642-03211-0_15.
  20. Dhouib S., “A threshold accepting framework to optimize discrete and continuous search space”, International Journal of Innovative Computing and Applications, Vol. 2, No.3, (2010), 178-187, DOI: 1504/IJICA.2010.033649.