PERENCANAAN PERJALANAN MENGELILINGI PROVINSI RIAU DARATAN DENGAN MENGGUNAKAN ALGORITMA KOLONI SEMUT

Nasir, Muhammad Aidil Azizi

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

dc.contributor.author	Nasir, Muhammad Aidil Azizi
dc.date.accessioned	2021-10-21T02:21:35Z
dc.date.available	2021-10-21T02:21:35Z
dc.date.issued	2021-04
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	https://repository.unri.ac.id/handle/123456789/10293
dc.description.abstract	This 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.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2021-10-21T02:21:35Z No. of bitstreams: 1 Muhammad Aidil Azizi Nasir_compressed.pdf: 206040 bytes, checksum: 474f7f1f9d13fdb56c25a30eb48d53c1 (MD5)	en
dc.description.provenance	Made available in DSpace on 2021-10-21T02:21:35Z (GMT). No. of bitstreams: 1 Muhammad Aidil Azizi Nasir_compressed.pdf: 206040 bytes, checksum: 474f7f1f9d13fdb56c25a30eb48d53c1 (MD5) Previous issue date: 2021-04	en
dc.description.sponsorship	Jurusan Matematika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau	en_US
dc.language.iso	en	en_US
dc.subject	Graph	en_US
dc.subject	heuristic method	en_US
dc.subject	travelling salesman problem	en_US
dc.subject	ant colony al- gorithm	en_US
dc.title	PERENCANAAN PERJALANAN MENGELILINGI PROVINSI RIAU DARATAN DENGAN MENGGUNAKAN ALGORITMA KOLONI SEMUT	en_US
dc.type	Article	en_US