期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2021
卷号：10
期号：5
页码：1-4
语种：English
出版社：International Journal of Computer and Information Technology
摘要：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.
关键词：Neutrosophic;Fuzzy set;Optimization;Dhouib;Matrix;TP1 method;travelling salesman pro
