Abstract
In this paper, triangular intuitionistic fuzzy travelling salesman problem has been considered to identify the shortest distance between the Cities. The Dynamic Programming method is applied to obtain the solution of the intuitionistic fuzzy travelling salesman problem without converting them into a crisp Travelling Salesman Problem. For a better understanding, numerical examples are also provided.
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 callDisclaimer: 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.
