Penyelesaian Masalah Travelling Salesman Dalam Bilangan Fuzzy Segitiga Menggu…

This nal project discusses how to solve the problem of traveling salesman in fuzzy triangles using dynamic programming. The process to obtain the solution begins by converting the fuzzy triangle numbers into crisp numbers using the Yager's ranking method and then the optimal solution is determined using dynamic programming. This nal project is a review of the article Mythili et al. [Inte…