Browsing Prodi Sistem Informasi by Subject "Non-deterministic Polynomial Time Complete, Traveling Salesman Problem, Genetic Algorithm, Efficient"
Now showing items 1-1 of 1
-
Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika
(2015-05-12)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 route must shortest one, ...