METODE CABANG-DAN-BATAS UNTUK MENYELESAIKAN MASALAH TRAVELLING SALESMAN NEUTROSOPHIC DALAM BILANGAN FUZZY TRAPESIUM

Abstract

This paper discusses the solution of the neuteosophic travelling salesman problem in trapezoidal fuzzy. Solving this problem is used the branch-and-bound algorithm method. This discussion aims to nd the best solution of a rute by a salesman. The best path result from a travel route are obtained and it can be concluded that the branch-and-bound algorithm can be used as a method to solve the travelling salesman problem.