Neutrosophic Travelling Salesman Problem in Trapezoidal Fuzzy number using Branch and Bound Technique

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.