Abstract
Travelling salesman problem is a well-known studied problem and intensely used in combinatorial optimization. In this article, we discuss a Neutrosophic fuzzy travelling salesman problem in which each element is considered as a Neutrosophic trapezoidal fuzzy numbers. Here, we provide the Branch and Bound technique is to find the optimal solution. The efficiency of this method is proved by solving a numerical example.
Sign-in/Register to access full text options 
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.
