PENERAPAN ALGORITMA SEMUT UNTUK MENCARI RUTE TERPENDEK (STUDI KASUS PENDISTRIBUSIAN BAKPIA KUKUS)

Laila Nur Maulida, NIM.: 18106010010 (2023) PENERAPAN ALGORITMA SEMUT UNTUK MENCARI RUTE TERPENDEK (STUDI KASUS PENDISTRIBUSIAN BAKPIA KUKUS). Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (PENERAPAN ALGORITMA SEMUT UNTUK MENCARI RUTE TERPENDEK (STUDI KASUS PENDISTRIBUSIAN BAKPIA KUKUS)) 18106010010_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (2MB) | Preview
	Text (PENERAPAN ALGORITMA SEMUT UNTUK MENCARI RUTE TERPENDEK (STUDI KASUS PENDISTRIBUSIAN BAKPIA KUKUS)) 18106010010_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf Restricted to Registered users only Download (5MB) | Request a copy

Abstract

Today’s human activities continue to increase along with increasing needs man himself. In this case, of course, it will be quite time-consuming and costly. Therefore we need a shortest route method to reach the destination I want it to be more efficient. Graph theory in mathematics is a branch of study that studies the properties of graphs. A graph is a set objects called nodes. A graph structure can be developed by weights each edge and a Weighted Graph can be used for symbolizes many different concepts. To solve route problems shortest that is using the distance traveled. In this research will uses the ant algorithm to find the shortest route to the problem shortest route search.

Share this knowledge with your friends :

Actions (login required)

View Item