Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika  

Oleh:

Bukhori, Saiful ; Rachman, Taufik

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: Gematika: Jurnal Manajemen Informatika vol. 8 no. 2 (Jun. 2007), page 119-128.
Topik: Perangkat lunak; non - deterministic polynomial time complete; traveling salesman problem; genetic algorithm; efficient

Ketersediaan

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

Lihat Detail Induk

Isi artikel

Electric cable line mapping as Non - deterministic Polynomial - time Complete (NPC) is difficult to solve using ordinary linier algorithm. In solving the problem there isn't a node encounter twice and the route must shortest one, so that it's needed efficiently material. Depend on this problem in this research used Traveling Salesman Problem (TSP). The result showed that using genetic algorithm one of the methods that can be used to determine electric cable line that has high complexity, so gives optimum electric cable design, and using time and cost efficient.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali