Metode Cabang-Dan-Batas Untuk Menyelesaikan Masalah Travelling Salesman Neutr…

This final projects discusses the solution of the neuteosophic travelling salesman problem in trapezoidal fuzzy using the method of branch-and-bound algorithm. The goal is to find the best obtained path of salesman routes. The discussion concludes that the branch-and-bound algorithm can be used as a method to solve the travelling salesman problem. Keywords: Fuzzy trapezoidal number, rankin…