DERAJAT KESAMAAN PADA BILANGAN FUZZY SEGITIGA UNTUK PERMASALAHAN LINTASAN TERPENDEK FUZZY

Abstract

In network acyclic digraphs, the problem of a shortest path is a problem related to the determination of the vertexs that linked in a digraph that forms path with a shortest distance from the source vertex to the destination vertex. This idea is expanded to solve the problem about shortest path of path-shaped fuzzy on triangular fuzzy number. In this final assignment, the author discusses the method of similarity degree to solve the fuzzy shortest path. The algorithm steps for similarity degree method are used to determine all paths that are possible to be passed from the source vertex to the destination vertex, and to count the value of similarity degree , with is the fuzzy shortest path and the is all the possible paths. The result of the Study of Case shows that there are 3 tourist destinations that may be visited from Rumpun Diponegoro Banyumanik toward Pantai Maron. Those three tourist destinations are Museum MURI, Sam Poo Kong and Museum Ronggowarsito with their total of time (62, 88, 108). Keywords : Network Acyclic Digraph, Fuzzy Shortest Path Problem (SPP), Triangular Fuzzy Number, Similarity Degree.