@article{Dhouib_2021, title={Neutrosophic Triangular Fuzzy Travelling Salesman Problem Based on Dhouib-Matrix-TSP1 Heuristic}, volume={10}, url={https://www.ijcit.com/index.php/ijcit/article/view/154}, DOI={10.24203/ijcit.v10i5.154}, abstractNote={<p>In this paper, the Travelling Salesman Problem is considered in neutrosophic environment which is more realistic in real-world industries. In fact, the distances between cities in the Travelling Salesman Problem are presented as neutrosophic triangular fuzzy number. This problem is solved in two steps: At first, the Yagerâ€™s ranking function is applied to convert the neutrosophic triangular fuzzy number to neutrosophic number then to generate the crisp number. At second, the heuristic Dhouib-Matrix-TSP1 is used to solve this problem. A numerical test example on neutrosophic triangular fuzzy environment shows that, by the use of Dhouib-Matrix-TSP1 heuristic, the optimal or a near optimal solution as well as the crisp and fuzzy total cost can be reached.</p>}, number={5}, journal={International Journal of Computer and Information Technology(2279-0764)}, author={Dhouib, Souhail}, year={2021}, month={Oct.} }