Penyelesaian Masalah Travelling Salesman Dalam Bilangan Fuzzy Segi Delapan De…

This final project discusses solving the traveling salesman problem in the form of an octagonal fuzzy number. The process is started by converting the octagonal fuzzy number into crisp numbers using the Robust’s ranking method , then to get the optimal solution the Hungarian method is used. To understand the process of getting the optimal solution, an example is given. This final project …