Penyelesaian Masalah Transportasi Menggunakan ANT Colony Algorithm  

Oleh:

Sholiq ; Asiyanti, Khoiriyah

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: Gematika: Jurnal Manajemen Informatika vol. 6 no. 1 (Dec. 2004), page 49-58.
Topik: algorithms; transportation; ants group algorithms; shortes path; total cost

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: GG4.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Transportation problem, in indusrial is the process of sending goods from the number of sources to the number of destinations with the minimum total cost. Ants Ggroup Algorithms is the distribution algorithms that applied to get shortest path. In this research by using Ants Group Algorithm to determine sending algorithm goods to get minimum cost of distributed goods from sources to the destinations. The test results in this research show that the total cost is the best among other least cost methods like : by using Northwest Corner Method (NWCR) and Minimum Cell Cost Method (MCCM).

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali