PERENCANAAN PERJALANAN MENGELILINGI PROVINSI RIAU DARATAN DENGAN MENGGUNAKAN ALGORITMA KOLONI SEMUT

Simple item page
dc.contributor.authorNasir, Muhammad Aidil Azizi
dc.date.accessioned2021-10-21T02:21:35Z
dc.date.available2021-10-21T02:21:35Z
dc.date.issued2021-04
dc.description.abstractThis article discusses travel planning around the mainland of riau province using ant colony algorithm, utilizing the heuristic method, with Matlab software to a variative solution. This discussion aims to find the shortest route using data of distance, cost, and a combination of distance and cost. Optimization of the travel index is the shortest route using a combination data of distance and cost that can be used as data guidelines for travel planning. This is a review of the Zheng et al.’s article [American Journal of Information Science and Computer Engineering, 5 (2019), 66-71].en_US
dc.description.sponsorshipJurusan Matematika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riauen_US
dc.identifier.otherwahyu sari yeni
dc.identifier.urihttps://repository.unri.ac.id/handle/123456789/10293
dc.language.isoenen_US
dc.subjectGraphen_US
dc.subjectheuristic methoden_US
dc.subjecttravelling salesman problemen_US
dc.subjectant colony al- gorithmen_US
dc.titlePERENCANAAN PERJALANAN MENGELILINGI PROVINSI RIAU DARATAN DENGAN MENGGUNAKAN ALGORITMA KOLONI SEMUTen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Muhammad Aidil Azizi Nasir_compressed.pdf
Size:
201.21 KB
Format:
Unknown data format
Description:
artikel
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics