Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer and Information Technology(2279-0764)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
