Image of Penyelesaian Masalah Travelling Salesman Dalam Bilangan Fuzzy Segitiga Menggunakan Pemrograman Dinamik
Penanda Bagikan

CD Skripsi

Penyelesaian Masalah Travelling Salesman Dalam Bilangan Fuzzy Segitiga Menggunakan Pemrograman Dinamik

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. [International Journal of Mechanical Engineering and Technology, 9 (2018),
945-966.]
Keywords: Triangular fuzzy numbers, traveling salesman problem, Yager's
ranking method, dynamic programming

Ketersediaan
#
Perpustakaan Universitas Riau 03 03.120 (0006)
03 03.120 (0006)
Tersedia
Informasi Detail
Judul Seri
-
No. Panggil
03 03.120 (0006)
Penerbit
Pekanbaru : Universitas Riau – FMIPA – Matematika.,
Deskripsi Fisik
xiii, 38 hlm.: ill.: 29 cm
Bahasa
Indonesia
ISBN/ISSN
-
Klasifikasi
03 03.120 (0006)
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
-
Subjek
MATEMATIKA
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
Komentar
Anda harus masuk sebelum memberikan komentar