METODE CABANG-DAN-BATAS UNTUK MENYELESAIKAN MASALAH TRAVELLING SALESMAN NEUTROSOPHIC DALAM BILANGAN FUZZY TRAPESIUM

Aminah, Nur

Home
→
UR - Student Paper Degree
→
Faculty of Mathematics and Natural Sciences
→
Mathematics
→
View Item

dc.contributor.author	Aminah, Nur
dc.date.accessioned	2022-03-15T02:34:50Z
dc.date.available	2022-03-15T02:34:50Z
dc.date.issued	2021-10
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	https://repository.unri.ac.id/handle/123456789/10487
dc.description.abstract	This paper discusses the solution of the neuteosophic travelling salesman problem in trapezoidal fuzzy. Solving this problem is used the branch-and-bound algorithm method. This discussion aims to nd the best solution of a rute by a salesman. The best path result from a travel route are obtained and it can be concluded that the branch-and-bound algorithm can be used as a method to solve the travelling salesman problem.	en_US
dc.description.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2022-03-15T02:34:50Z No. of bitstreams: 1 Nur Aminah_compressed.pdf: 251741 bytes, checksum: 9c5e73375ac49a27a6db32ba293fb353 (MD5)	en
dc.description.provenance	Made available in DSpace on 2022-03-15T02:34:50Z (GMT). No. of bitstreams: 1 Nur Aminah_compressed.pdf: 251741 bytes, checksum: 9c5e73375ac49a27a6db32ba293fb353 (MD5) Previous issue date: 2021-10	en
dc.description.sponsorship	Jurusan Matematika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau	en_US
dc.language.iso	en	en_US
dc.publisher	perpustakaan UR	en_US
dc.subject	uzzy trapezoidal number	en_US
dc.subject	ranking function	en_US
dc.subject	branch-and-bound method	en_US
dc.subject	neutrosophic number	en_US
dc.subject	travelling salesman problem	en_US
dc.subject	travelling salesman problem	en_US
dc.title	METODE CABANG-DAN-BATAS UNTUK MENYELESAIKAN MASALAH TRAVELLING SALESMAN NEUTROSOPHIC DALAM BILANGAN FUZZY TRAPESIUM	en_US
dc.type	Article	en_US